/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:31:06,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:31:06,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:31:06,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:31:06,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:31:06,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:31:06,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:31:06,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:31:06,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:31:06,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:31:06,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:31:06,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:31:06,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:31:06,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:31:06,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:31:06,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:31:06,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:31:06,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:31:06,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:31:06,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:31:06,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:31:06,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:31:06,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:31:06,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:31:06,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:31:06,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:31:06,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:31:06,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:31:06,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:31:06,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:31:06,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:31:06,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:31:06,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:31:06,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:31:06,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:31:06,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:31:06,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:31:06,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:31:06,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:31:06,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:31:06,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:31:06,875 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:31:06,889 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:31:06,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:31:06,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:31:06,891 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:31:06,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:31:06,891 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:31:06,891 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:31:06,892 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:31:06,892 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:31:06,892 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:31:06,892 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:31:06,892 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:31:06,892 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:31:06,893 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:31:06,893 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:31:06,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:31:06,893 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:31:06,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:31:06,893 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:31:06,894 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:31:06,894 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:31:06,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:31:06,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:31:06,894 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:31:06,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:31:06,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:31:06,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:31:06,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:31:06,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:31:07,055 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:31:07,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:31:07,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:31:07,073 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:31:07,074 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:31:07,074 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:31:07,144 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_sSrISW/tmp/f1b85400e68c4a57a74ef03fffa9ede8/FLAGd0d7874a0 [2020-07-01 12:31:07,476 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:31:07,477 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:31:07,477 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:31:07,484 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_sSrISW/tmp/f1b85400e68c4a57a74ef03fffa9ede8/FLAGd0d7874a0 [2020-07-01 12:31:07,928 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_sSrISW/tmp/f1b85400e68c4a57a74ef03fffa9ede8 [2020-07-01 12:31:07,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:31:07,941 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:31:07,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:31:07,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:31:07,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:31:07,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:31:07" (1/1) ... [2020-07-01 12:31:07,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774b6771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:07, skipping insertion in model container [2020-07-01 12:31:07,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:31:07" (1/1) ... [2020-07-01 12:31:07,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:31:07,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:31:08,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:31:08,225 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:31:08,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:31:08,260 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:31:08,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08 WrapperNode [2020-07-01 12:31:08,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:31:08,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:31:08,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:31:08,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:31:08,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:31:08,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:31:08,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:31:08,303 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:31:08,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:31:08,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:31:08,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:31:08,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:31:08,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:31:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:31:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:31:08,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:31:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:31:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:31:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:31:08,677 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:31:08,677 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:31:08,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:08 BoogieIcfgContainer [2020-07-01 12:31:08,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:31:08,682 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:31:08,682 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:31:08,685 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:31:08,685 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:08" (1/1) ... [2020-07-01 12:31:08,704 INFO L313 BlockEncoder]: Initial Icfg 27 locations, 31 edges [2020-07-01 12:31:08,705 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:31:08,706 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:31:08,707 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:31:08,707 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:31:08,709 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:31:08,710 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:31:08,710 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:31:08,734 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:31:08,763 INFO L200 BlockEncoder]: SBE split 12 edges [2020-07-01 12:31:08,767 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:31:08,769 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:31:08,794 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 12:31:08,797 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-07-01 12:31:08,798 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:31:08,798 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:31:08,799 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:31:08,799 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:31:08,800 INFO L313 BlockEncoder]: Encoded RCFG 19 locations, 42 edges [2020-07-01 12:31:08,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:31:08 BasicIcfg [2020-07-01 12:31:08,800 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:31:08,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:31:08,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:31:08,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:31:08,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:31:07" (1/4) ... [2020-07-01 12:31:08,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832f7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:31:08, skipping insertion in model container [2020-07-01 12:31:08,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (2/4) ... [2020-07-01 12:31:08,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832f7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:31:08, skipping insertion in model container [2020-07-01 12:31:08,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:08" (3/4) ... [2020-07-01 12:31:08,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1832f7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:31:08, skipping insertion in model container [2020-07-01 12:31:08,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:31:08" (4/4) ... [2020-07-01 12:31:08,810 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:31:08,820 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:31:08,828 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-01 12:31:08,842 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-01 12:31:08,866 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:31:08,866 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:31:08,866 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:31:08,866 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:31:08,866 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:31:08,866 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:31:08,867 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:31:08,867 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:31:08,882 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-01 12:31:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:31:08,888 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:08,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:31:08,889 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:08,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash 4971540, now seen corresponding path program 1 times [2020-07-01 12:31:08,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:08,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549685302] [2020-07-01 12:31:08,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:09,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549685302] [2020-07-01 12:31:09,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:09,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:09,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862530815] [2020-07-01 12:31:09,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:09,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:09,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:09,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,095 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-07-01 12:31:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:09,200 INFO L93 Difference]: Finished difference Result 32 states and 74 transitions. [2020-07-01 12:31:09,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:09,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:31:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:09,215 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:31:09,216 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:31:09,219 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:31:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:31:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:31:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions. [2020-07-01 12:31:09,256 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 38 transitions. Word has length 4 [2020-07-01 12:31:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:09,257 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 38 transitions. [2020-07-01 12:31:09,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 38 transitions. [2020-07-01 12:31:09,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:31:09,257 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:09,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:31:09,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:31:09,259 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:09,260 INFO L82 PathProgramCache]: Analyzing trace with hash 4971542, now seen corresponding path program 1 times [2020-07-01 12:31:09,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:09,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310859815] [2020-07-01 12:31:09,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:09,293 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310859815] [2020-07-01 12:31:09,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:09,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:09,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570025067] [2020-07-01 12:31:09,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:09,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:09,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:09,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,296 INFO L87 Difference]: Start difference. First operand 18 states and 38 transitions. Second operand 3 states. [2020-07-01 12:31:09,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:09,368 INFO L93 Difference]: Finished difference Result 19 states and 38 transitions. [2020-07-01 12:31:09,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:09,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:31:09,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:09,370 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:31:09,370 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:31:09,371 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:31:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:31:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:31:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2020-07-01 12:31:09,375 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 4 [2020-07-01 12:31:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:09,375 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2020-07-01 12:31:09,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2020-07-01 12:31:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:31:09,376 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:09,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:31:09,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:31:09,377 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash 4971543, now seen corresponding path program 1 times [2020-07-01 12:31:09,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:09,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39832308] [2020-07-01 12:31:09,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:09,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39832308] [2020-07-01 12:31:09,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:09,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:09,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712706757] [2020-07-01 12:31:09,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:09,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:09,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:09,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:09,411 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2020-07-01 12:31:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:09,471 INFO L93 Difference]: Finished difference Result 18 states and 37 transitions. [2020-07-01 12:31:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:09,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 12:31:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:09,472 INFO L225 Difference]: With dead ends: 18 [2020-07-01 12:31:09,472 INFO L226 Difference]: Without dead ends: 17 [2020-07-01 12:31:09,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:31:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-01 12:31:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-01 12:31:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:31:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 36 transitions. [2020-07-01 12:31:09,476 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 36 transitions. Word has length 4 [2020-07-01 12:31:09,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:09,476 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 36 transitions. [2020-07-01 12:31:09,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:09,477 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 36 transitions. [2020-07-01 12:31:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:09,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:09,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:09,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:31:09,478 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:09,478 INFO L82 PathProgramCache]: Analyzing trace with hash 154118868, now seen corresponding path program 1 times [2020-07-01 12:31:09,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:09,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410990097] [2020-07-01 12:31:09,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:09,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410990097] [2020-07-01 12:31:09,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:09,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:09,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108663245] [2020-07-01 12:31:09,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:09,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:09,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:09,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,510 INFO L87 Difference]: Start difference. First operand 17 states and 36 transitions. Second operand 3 states. [2020-07-01 12:31:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:09,561 INFO L93 Difference]: Finished difference Result 17 states and 36 transitions. [2020-07-01 12:31:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:09,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:31:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:09,563 INFO L225 Difference]: With dead ends: 17 [2020-07-01 12:31:09,563 INFO L226 Difference]: Without dead ends: 14 [2020-07-01 12:31:09,563 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-01 12:31:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-01 12:31:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 12:31:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2020-07-01 12:31:09,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 30 transitions. Word has length 5 [2020-07-01 12:31:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:09,567 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 30 transitions. [2020-07-01 12:31:09,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 30 transitions. [2020-07-01 12:31:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:31:09,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:09,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:31:09,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:31:09,568 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:09,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash 154118870, now seen corresponding path program 1 times [2020-07-01 12:31:09,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:09,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501755564] [2020-07-01 12:31:09,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:09,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501755564] [2020-07-01 12:31:09,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:09,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:31:09,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397321950] [2020-07-01 12:31:09,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:31:09,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:09,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:31:09,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:31:09,634 INFO L87 Difference]: Start difference. First operand 14 states and 30 transitions. Second operand 5 states. [2020-07-01 12:31:09,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:09,750 INFO L93 Difference]: Finished difference Result 24 states and 54 transitions. [2020-07-01 12:31:09,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:31:09,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-07-01 12:31:09,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:09,752 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:31:09,752 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:31:09,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:31:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:31:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:31:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:31:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2020-07-01 12:31:09,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 47 transitions. Word has length 5 [2020-07-01 12:31:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:09,759 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 47 transitions. [2020-07-01 12:31:09,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:31:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 47 transitions. [2020-07-01 12:31:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:31:09,759 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:09,759 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:09,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:31:09,760 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:09,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:09,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1069293027, now seen corresponding path program 1 times [2020-07-01 12:31:09,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:09,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67309680] [2020-07-01 12:31:09,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:09,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67309680] [2020-07-01 12:31:09,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:09,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:09,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512708229] [2020-07-01 12:31:09,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:09,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:09,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:09,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,794 INFO L87 Difference]: Start difference. First operand 20 states and 47 transitions. Second operand 3 states. [2020-07-01 12:31:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:09,881 INFO L93 Difference]: Finished difference Result 35 states and 79 transitions. [2020-07-01 12:31:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:09,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 12:31:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:09,882 INFO L225 Difference]: With dead ends: 35 [2020-07-01 12:31:09,882 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:31:09,883 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:31:09,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-01 12:31:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:31:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 49 transitions. [2020-07-01 12:31:09,887 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 49 transitions. Word has length 9 [2020-07-01 12:31:09,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:09,888 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 49 transitions. [2020-07-01 12:31:09,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 49 transitions. [2020-07-01 12:31:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:31:09,888 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:09,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:09,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:31:09,889 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1069352609, now seen corresponding path program 1 times [2020-07-01 12:31:09,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:09,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70047639] [2020-07-01 12:31:09,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:09,916 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70047639] [2020-07-01 12:31:09,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:09,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:09,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943308974] [2020-07-01 12:31:09,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:31:09,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:09,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:09,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,918 INFO L87 Difference]: Start difference. First operand 22 states and 49 transitions. Second operand 3 states. [2020-07-01 12:31:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:09,972 INFO L93 Difference]: Finished difference Result 37 states and 86 transitions. [2020-07-01 12:31:09,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:09,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 12:31:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:09,973 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:31:09,973 INFO L226 Difference]: Without dead ends: 21 [2020-07-01 12:31:09,973 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:09,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-01 12:31:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-01 12:31:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:31:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. [2020-07-01 12:31:09,977 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 42 transitions. Word has length 9 [2020-07-01 12:31:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:09,978 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 42 transitions. [2020-07-01 12:31:09,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:31:09,978 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 42 transitions. [2020-07-01 12:31:09,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:31:09,979 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:09,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:09,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:31:09,979 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:09,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1091888932, now seen corresponding path program 1 times [2020-07-01 12:31:09,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:09,980 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748127175] [2020-07-01 12:31:09,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:10,133 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748127175] [2020-07-01 12:31:10,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965611628] [2020-07-01 12:31:10,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:10,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-01 12:31:10,183 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:10,249 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 12:31:10,250 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:10,262 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:10,266 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 12:31:10,266 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 12:31:10,314 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:10,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 12:31:10,316 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:10,319 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:31:10,331 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:10,334 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:31:10,337 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 12:31:10,339 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 12:31:10,339 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-01 12:31:10,375 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:10,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:31:10,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-07-01 12:31:10,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143360996] [2020-07-01 12:31:10,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-01 12:31:10,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:10,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-01 12:31:10,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:31:10,399 INFO L87 Difference]: Start difference. First operand 21 states and 42 transitions. Second operand 11 states. [2020-07-01 12:31:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:10,840 INFO L93 Difference]: Finished difference Result 34 states and 62 transitions. [2020-07-01 12:31:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-01 12:31:10,840 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-07-01 12:31:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:10,841 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:31:10,841 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:31:10,842 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2020-07-01 12:31:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:31:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2020-07-01 12:31:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:31:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 43 transitions. [2020-07-01 12:31:10,846 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 43 transitions. Word has length 11 [2020-07-01 12:31:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:10,847 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 43 transitions. [2020-07-01 12:31:10,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-01 12:31:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 43 transitions. [2020-07-01 12:31:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:31:10,848 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:10,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:11,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-01 12:31:11,050 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:11,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1091888933, now seen corresponding path program 1 times [2020-07-01 12:31:11,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:11,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520205601] [2020-07-01 12:31:11,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:11,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520205601] [2020-07-01 12:31:11,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160598010] [2020-07-01 12:31:11,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:11,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:31:11,133 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:11,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:31:11,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 12:31:11,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068501810] [2020-07-01 12:31:11,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:31:11,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:11,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:31:11,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:31:11,146 INFO L87 Difference]: Start difference. First operand 23 states and 43 transitions. Second operand 4 states. [2020-07-01 12:31:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:11,221 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2020-07-01 12:31:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:31:11,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-01 12:31:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:11,223 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:31:11,223 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:31:11,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:31:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:31:11,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:31:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:31:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 34 transitions. [2020-07-01 12:31:11,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 34 transitions. Word has length 11 [2020-07-01 12:31:11,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:11,227 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 34 transitions. [2020-07-01 12:31:11,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:31:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 34 transitions. [2020-07-01 12:31:11,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-01 12:31:11,228 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:11,228 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-07-01 12:31:11,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:11,429 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:11,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1296249074, now seen corresponding path program 2 times [2020-07-01 12:31:11,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:11,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411185186] [2020-07-01 12:31:11,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:11,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411185186] [2020-07-01 12:31:11,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112674235] [2020-07-01 12:31:11,629 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:11,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:31:11,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:31:11,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-01 12:31:11,670 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:11,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:31:11,677 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:11,681 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:11,681 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:31:11,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 12:31:11,703 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 12:31:11,703 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:11,709 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:11,710 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 12:31:11,710 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 12:31:11,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:11,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 12:31:11,762 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:11,763 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:31:11,780 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:11,781 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 12:31:11,782 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:31:11,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-07-01 12:31:11,815 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:31:11,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:31:11,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-07-01 12:31:11,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039547425] [2020-07-01 12:31:11,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-01 12:31:11,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:11,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-01 12:31:11,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:31:11,839 INFO L87 Difference]: Start difference. First operand 18 states and 34 transitions. Second operand 12 states. [2020-07-01 12:31:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:12,385 INFO L93 Difference]: Finished difference Result 34 states and 69 transitions. [2020-07-01 12:31:12,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-01 12:31:12,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-01 12:31:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:12,386 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:31:12,387 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:31:12,387 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2020-07-01 12:31:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:31:12,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2020-07-01 12:31:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:31:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 47 transitions. [2020-07-01 12:31:12,392 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 47 transitions. Word has length 17 [2020-07-01 12:31:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:12,393 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 47 transitions. [2020-07-01 12:31:12,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-01 12:31:12,393 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 47 transitions. [2020-07-01 12:31:12,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-01 12:31:12,393 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:31:12,394 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:31:12,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 12:31:12,595 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:31:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash 953106655, now seen corresponding path program 1 times [2020-07-01 12:31:12,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:12,595 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144035616] [2020-07-01 12:31:12,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-01 12:31:12,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144035616] [2020-07-01 12:31:12,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639807068] [2020-07-01 12:31:12,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:12,758 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-01 12:31:12,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:31:12,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 12:31:12,770 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:12,775 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:12,775 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:31:12,776 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 12:31:12,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 12:31:12,793 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:31:12,795 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:12,795 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:31:12,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 12:31:12,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:12,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 12:31:12,820 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:12,821 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 12:31:12,830 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:31:12,830 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:31:12,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 12:31:12,849 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 12:31:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-07-01 12:31:12,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:31:12,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-01 12:31:12,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382471094] [2020-07-01 12:31:12,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:31:12,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:12,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:31:12,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:31:12,895 INFO L87 Difference]: Start difference. First operand 24 states and 47 transitions. Second operand 9 states. [2020-07-01 12:31:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:12,984 INFO L93 Difference]: Finished difference Result 24 states and 47 transitions. [2020-07-01 12:31:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:31:12,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-07-01 12:31:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:31:12,985 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:31:12,985 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:31:12,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-01 12:31:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:31:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:31:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:31:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:31:12,986 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-01 12:31:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:31:12,986 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:31:12,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:31:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:31:12,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:31:13,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:31:13,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:31:13,309 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-01 12:31:13,310 INFO L268 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2020-07-01 12:31:13,310 INFO L268 CegarLoopResult]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2020-07-01 12:31:13,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:31:13,310 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 12:31:13,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:31:13,310 INFO L268 CegarLoopResult]: For program point L14-2(line 14) no Hoare annotation was computed. [2020-07-01 12:31:13,310 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:31:13,311 INFO L268 CegarLoopResult]: For program point L14-3(line 14) no Hoare annotation was computed. [2020-07-01 12:31:13,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:31:13,311 INFO L268 CegarLoopResult]: For program point L14-4(line 14) no Hoare annotation was computed. [2020-07-01 12:31:13,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:31:13,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:31:13,311 INFO L268 CegarLoopResult]: For program point L14-6(lines 14 15) no Hoare annotation was computed. [2020-07-01 12:31:13,311 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:31:13,312 INFO L264 CegarLoopResult]: At program point L14-8(lines 14 15) the Hoare annotation is: (let ((.cse1 (select |#length| ULTIMATE.start_cstrchr_~s.base))) (let ((.cse0 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrchr_~s.base) (+ .cse1 (- 1))))) (.cse2 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString~0.base))) (.cse3 (<= 1 ULTIMATE.start_main_~length~0)) (.cse4 (= ULTIMATE.start_main_~length~0 (select |#length| ULTIMATE.start_main_~nondetString~0.base))) (.cse5 (= 1 (select |#valid| ULTIMATE.start_cstrchr_~s.base))) (.cse6 (= 0 ULTIMATE.start_main_~nondetString~0.offset))) (or (and .cse0 (<= (+ ULTIMATE.start_cstrchr_~s.offset 1) .cse1) .cse2 (<= 1 ULTIMATE.start_cstrchr_~s.offset) .cse3 .cse4 .cse5 .cse6) (and .cse0 (= 0 ULTIMATE.start_cstrchr_~s.offset) (<= 1 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6)))) [2020-07-01 12:31:13,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:31:13,312 INFO L268 CegarLoopResult]: For program point L14-9(lines 14 15) no Hoare annotation was computed. [2020-07-01 12:31:13,312 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-07-01 12:31:13,314 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:31:13,323 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:31:13,324 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,324 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,325 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,325 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:31:13,325 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,325 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,326 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,334 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:31:13,334 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,334 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:31:13,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,335 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:31:13 BasicIcfg [2020-07-01 12:31:13,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:31:13,339 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:31:13,339 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:31:13,342 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:31:13,343 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:31:13,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:31:07" (1/5) ... [2020-07-01 12:31:13,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@529ca694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:31:13, skipping insertion in model container [2020-07-01 12:31:13,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:31:13,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:31:08" (2/5) ... [2020-07-01 12:31:13,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@529ca694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:31:13, skipping insertion in model container [2020-07-01 12:31:13,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:31:13,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:31:08" (3/5) ... [2020-07-01 12:31:13,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@529ca694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:31:13, skipping insertion in model container [2020-07-01 12:31:13,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:31:13,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:31:08" (4/5) ... [2020-07-01 12:31:13,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@529ca694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:31:13, skipping insertion in model container [2020-07-01 12:31:13,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:31:13,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:31:13" (5/5) ... [2020-07-01 12:31:13,347 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:31:13,368 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:31:13,368 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:31:13,368 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:31:13,368 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:31:13,368 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:31:13,368 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:31:13,368 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:31:13,368 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:31:13,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-01 12:31:13,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:31:13,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:31:13,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:31:13,381 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:31:13,381 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:31:13,381 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:31:13,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-01 12:31:13,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-01 12:31:13,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:31:13,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:31:13,383 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:31:13,383 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:31:13,389 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue [133] ULTIMATE.startENTRY-->L21: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_15| (store |v_#valid_16| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_6, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_4|, ULTIMATE.start_main_#t~ret9.offset=|v_ULTIMATE.start_main_#t~ret9.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_15|, ULTIMATE.start_main_#t~ret9.base=|v_ULTIMATE.start_main_#t~ret9.base_4|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~ret9.offset, #NULL.offset, ULTIMATE.start_main_#t~nondet6, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_main_~nondetString~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret9.base, ULTIMATE.start_main_~length~0] 14#L21true [60] L21-->L21-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 9#L21-2true [100] L21-2-->L25: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| v_ULTIMATE.start_main_~length~0_7) |v_#length_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~nondetString~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~nondetString~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~nondetString~0.base, #valid, ULTIMATE.start_main_~nondetString~0.offset, #length, ULTIMATE.start_main_#t~malloc7.offset] 21#L25true [134] L25-->L14-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11))) (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_main_~nondetString~0.base_8)) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_main_~nondetString~0.offset_7) (= v_ULTIMATE.start_main_~nondetString~0.base_8 |v_ULTIMATE.start_cstrchr_#in~s.base_2|) (= |v_ULTIMATE.start_cstrchr_#in~c_2| |v_ULTIMATE.start_main_#t~nondet8_5|) (= |v_ULTIMATE.start_cstrchr_#in~s.base_2| v_ULTIMATE.start_cstrchr_~s.base_15) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrchr_#in~c_2| v_ULTIMATE.start_cstrchr_~c_6) (= |v_ULTIMATE.start_cstrchr_#in~s.offset_2| v_ULTIMATE.start_cstrchr_~s.offset_12) (= (store |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8 (store (select |v_#memory_int_7| v_ULTIMATE.start_main_~nondetString~0.base_8) (+ v_ULTIMATE.start_main_~nondetString~0.offset_7 v_ULTIMATE.start_main_~length~0_11 (- 1)) 0)) |v_#memory_int_6|) (<= .cse0 (select |v_#length_11| v_ULTIMATE.start_main_~nondetString~0.base_8)))) InVars {ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_12, ULTIMATE.start_cstrchr_#res.offset=|v_ULTIMATE.start_cstrchr_#res.offset_4|, ULTIMATE.start_cstrchr_#t~ite5.base=|v_ULTIMATE.start_cstrchr_#t~ite5.base_6|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_4|, ULTIMATE.start_cstrchr_#res.base=|v_ULTIMATE.start_cstrchr_#res.base_4|, ULTIMATE.start_main_~nondetString~0.offset=v_ULTIMATE.start_main_~nondetString~0.offset_7, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_4|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_5|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_15, ULTIMATE.start_cstrchr_#in~s.offset=|v_ULTIMATE.start_cstrchr_#in~s.offset_2|, ULTIMATE.start_cstrchr_#in~c=|v_ULTIMATE.start_cstrchr_#in~c_2|, ULTIMATE.start_cstrchr_#t~mem4=|v_ULTIMATE.start_cstrchr_#t~mem4_6|, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_6|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_10|, ULTIMATE.start_main_~nondetString~0.base=v_ULTIMATE.start_main_~nondetString~0.base_8, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrchr_#t~ite5.offset=|v_ULTIMATE.start_cstrchr_#t~ite5.offset_6|, #length=|v_#length_11|, ULTIMATE.start_cstrchr_~c=v_ULTIMATE.start_cstrchr_~c_6, ULTIMATE.start_cstrchr_#in~s.base=|v_ULTIMATE.start_cstrchr_#in~s.base_2|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_6|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#res.offset, ULTIMATE.start_cstrchr_#t~ite5.base, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#res.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#in~s.offset, ULTIMATE.start_cstrchr_#in~c, ULTIMATE.start_cstrchr_#t~mem4, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, #memory_int, ULTIMATE.start_cstrchr_#t~ite5.offset, ULTIMATE.start_cstrchr_~c, ULTIMATE.start_cstrchr_#in~s.base, ULTIMATE.start_cstrchr_#t~mem0] 6#L14-8true [2020-07-01 12:31:13,389 INFO L796 eck$LassoCheckResult]: Loop: 6#L14-8true [79] L14-8-->L14-1: Formula: (and (<= 0 v_ULTIMATE.start_cstrchr_~s.offset_3) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrchr_~s.base_3) v_ULTIMATE.start_cstrchr_~s.offset_3) |v_ULTIMATE.start_cstrchr_#t~mem0_2|) (= 1 (select |v_#valid_7| v_ULTIMATE.start_cstrchr_~s.base_3)) (<= (+ v_ULTIMATE.start_cstrchr_~s.offset_3 1) (select |v_#length_5| v_ULTIMATE.start_cstrchr_~s.base_3))) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_3, #length=|v_#length_5|, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~mem0] 20#L14-1true [113] L14-1-->L14-2: Formula: (and (< 0 |v_ULTIMATE.start_cstrchr_#t~mem0_3|) |v_ULTIMATE.start_cstrchr_#t~short2_2|) InVars {ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|} OutVars{ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_3|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_#t~short2] 19#L14-2true [66] L14-2-->L14-6: Formula: (not |v_ULTIMATE.start_cstrchr_#t~short2_5|) InVars {ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} OutVars{ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_5|} AuxVars[] AssignedVars[] 8#L14-6true [83] L14-6-->L14-8: Formula: (and (= v_ULTIMATE.start_cstrchr_~s.offset_7 (+ v_ULTIMATE.start_cstrchr_~s.offset_8 1)) (= v_ULTIMATE.start_cstrchr_~s.base_9 v_ULTIMATE.start_cstrchr_~s.base_10) |v_ULTIMATE.start_cstrchr_#t~short2_9|) InVars {ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_8, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_10, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_9|} OutVars{ULTIMATE.start_cstrchr_~s.offset=v_ULTIMATE.start_cstrchr_~s.offset_7, ULTIMATE.start_cstrchr_#t~mem1=|v_ULTIMATE.start_cstrchr_#t~mem1_5|, ULTIMATE.start_cstrchr_#t~short2=|v_ULTIMATE.start_cstrchr_#t~short2_8|, ULTIMATE.start_cstrchr_#t~post3.base=|v_ULTIMATE.start_cstrchr_#t~post3.base_2|, ULTIMATE.start_cstrchr_#t~post3.offset=|v_ULTIMATE.start_cstrchr_#t~post3.offset_2|, ULTIMATE.start_cstrchr_~s.base=v_ULTIMATE.start_cstrchr_~s.base_9, ULTIMATE.start_cstrchr_#t~mem0=|v_ULTIMATE.start_cstrchr_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrchr_~s.offset, ULTIMATE.start_cstrchr_#t~mem1, ULTIMATE.start_cstrchr_#t~short2, ULTIMATE.start_cstrchr_#t~post3.base, ULTIMATE.start_cstrchr_#t~post3.offset, ULTIMATE.start_cstrchr_~s.base, ULTIMATE.start_cstrchr_#t~mem0] 6#L14-8true [2020-07-01 12:31:13,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:13,390 INFO L82 PathProgramCache]: Analyzing trace with hash 4946618, now seen corresponding path program 1 times [2020-07-01 12:31:13,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:13,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289803432] [2020-07-01 12:31:13,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:13,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289803432] [2020-07-01 12:31:13,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:13,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:31:13,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353370670] [2020-07-01 12:31:13,409 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:31:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:31:13,410 INFO L82 PathProgramCache]: Analyzing trace with hash 3387732, now seen corresponding path program 1 times [2020-07-01 12:31:13,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:31:13,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983429046] [2020-07-01 12:31:13,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:31:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:31:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:31:13,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983429046] [2020-07-01 12:31:13,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:31:13,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:31:13,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066773781] [2020-07-01 12:31:13,420 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:31:13,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:31:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:31:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:31:13,422 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-07-01 12:31:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:31:13,494 INFO L93 Difference]: Finished difference Result 21 states and 42 transitions. [2020-07-01 12:31:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:31:13,497 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:31:13,500 INFO L168 Benchmark]: Toolchain (without parser) took 5559.87 ms. Allocated memory was 514.9 MB in the beginning and 641.2 MB in the end (delta: 126.4 MB). Free memory was 435.9 MB in the beginning and 511.7 MB in the end (delta: -75.9 MB). Peak memory consumption was 50.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:31:13,501 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:31:13,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.97 ms. Allocated memory was 514.9 MB in the beginning and 573.6 MB in the end (delta: 58.7 MB). Free memory was 435.3 MB in the beginning and 542.1 MB in the end (delta: -106.7 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:31:13,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.39 ms. Allocated memory is still 573.6 MB. Free memory was 542.1 MB in the beginning and 540.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:31:13,502 INFO L168 Benchmark]: Boogie Preprocessor took 25.54 ms. Allocated memory is still 573.6 MB. Free memory was 540.4 MB in the beginning and 538.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:31:13,502 INFO L168 Benchmark]: RCFGBuilder took 352.63 ms. Allocated memory is still 573.6 MB. Free memory was 538.9 MB in the beginning and 519.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:31:13,503 INFO L168 Benchmark]: BlockEncodingV2 took 118.35 ms. Allocated memory is still 573.6 MB. Free memory was 519.9 MB in the beginning and 511.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:31:13,503 INFO L168 Benchmark]: TraceAbstraction took 4536.30 ms. Allocated memory was 573.6 MB in the beginning and 641.2 MB in the end (delta: 67.6 MB). Free memory was 510.8 MB in the beginning and 534.1 MB in the end (delta: -23.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:31:13,504 INFO L168 Benchmark]: BuchiAutomizer took 160.18 ms. Allocated memory is still 641.2 MB. Free memory was 534.1 MB in the beginning and 511.7 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:31:13,507 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 27 locations, 31 edges - StatisticsResult: Encoded RCFG 19 locations, 42 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 318.97 ms. Allocated memory was 514.9 MB in the beginning and 573.6 MB in the end (delta: 58.7 MB). Free memory was 435.3 MB in the beginning and 542.1 MB in the end (delta: -106.7 MB). Peak memory consumption was 28.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.39 ms. Allocated memory is still 573.6 MB. Free memory was 542.1 MB in the beginning and 540.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.54 ms. Allocated memory is still 573.6 MB. Free memory was 540.4 MB in the beginning and 538.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * RCFGBuilder took 352.63 ms. Allocated memory is still 573.6 MB. Free memory was 538.9 MB in the beginning and 519.9 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 118.35 ms. Allocated memory is still 573.6 MB. Free memory was 519.9 MB in the beginning and 511.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4536.30 ms. Allocated memory was 573.6 MB in the beginning and 641.2 MB in the end (delta: 67.6 MB). Free memory was 510.8 MB in the beginning and 534.1 MB in the end (delta: -23.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 160.18 ms. Allocated memory is still 641.2 MB. Free memory was 534.1 MB in the beginning and 511.7 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 12:31:13,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:31:13,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:31:13,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:31:13,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:31:13,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:31:13,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] && s + 1 <= unknown-#length-unknown[s]) && 1 == \valid[nondetString]) && 1 <= s) && 1 <= length) && length == unknown-#length-unknown[nondetString]) && 1 == \valid[s]) && 0 == nondetString) || (((((((0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1] && 0 == s) && 1 <= unknown-#length-unknown[s]) && 1 == \valid[nondetString]) && 1 <= length) && length == unknown-#length-unknown[nondetString]) && 1 == \valid[s]) && 0 == nondetString) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.3s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 66 SDtfs, 761 SDslu, 227 SDs, 0 SdLazy, 625 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 4 NumberOfFragments, 85 HoareAnnotationTreeSize, 1 FomulaSimplifications, 92 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 72 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 149 ConstructedInterpolants, 8 QuantifiedInterpolants, 18823 SizeOfPredicates, 24 NumberOfNonLiveVariables, 317 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 18/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:31:04.650 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_sSrISW/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:31:13.743 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check