/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum04-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:37:09,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:37:09,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:37:09,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:37:09,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:37:09,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:37:09,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:37:09,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:37:09,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:37:09,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:37:09,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:37:09,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:37:09,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:37:09,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:37:09,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:37:09,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:37:09,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:37:09,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:37:09,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:37:09,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:37:09,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:37:09,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:37:09,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:37:09,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:37:09,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:37:09,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:37:09,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:37:09,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:37:09,071 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:37:09,072 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:37:09,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:37:09,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:37:09,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:37:09,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:37:09,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:37:09,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:37:09,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:37:09,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:37:09,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:37:09,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:37:09,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:37:09,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:37:09,097 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:37:09,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:37:09,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:37:09,100 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:37:09,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:37:09,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:37:09,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:37:09,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:37:09,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:37:09,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:37:09,102 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:37:09,103 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:37:09,103 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:37:09,103 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:37:09,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:37:09,104 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:37:09,104 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:37:09,104 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:37:09,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:37:09,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:37:09,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:37:09,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:37:09,105 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:37:09,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:37:09,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:37:09,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:37:09,382 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:37:09,383 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:37:09,383 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-1.i [2020-07-08 23:37:09,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a16d9bf/6d4124af1d184024adbc961feb084427/FLAG2947ecd66 [2020-07-08 23:37:09,871 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:37:09,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2020-07-08 23:37:09,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a16d9bf/6d4124af1d184024adbc961feb084427/FLAG2947ecd66 [2020-07-08 23:37:10,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a16d9bf/6d4124af1d184024adbc961feb084427 [2020-07-08 23:37:10,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:37:10,272 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:37:10,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:37:10,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:37:10,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:37:10,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:37:10" (1/1) ... [2020-07-08 23:37:10,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456c721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10, skipping insertion in model container [2020-07-08 23:37:10,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:37:10" (1/1) ... [2020-07-08 23:37:10,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:37:10,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:37:10,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:37:10,495 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:37:10,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:37:10,531 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:37:10,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10 WrapperNode [2020-07-08 23:37:10,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:37:10,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:37:10,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:37:10,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:37:10,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10" (1/1) ... [2020-07-08 23:37:10,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10" (1/1) ... [2020-07-08 23:37:10,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10" (1/1) ... [2020-07-08 23:37:10,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10" (1/1) ... [2020-07-08 23:37:10,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10" (1/1) ... [2020-07-08 23:37:10,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10" (1/1) ... [2020-07-08 23:37:10,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10" (1/1) ... [2020-07-08 23:37:10,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:37:10,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:37:10,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:37:10,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:37:10,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:37:10,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:37:10,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:37:10,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:37:10,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:37:10,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:37:10,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:37:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:37:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:37:10,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:37:10,995 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:37:10,996 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 23:37:10,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:37:10 BoogieIcfgContainer [2020-07-08 23:37:10,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:37:11,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:37:11,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:37:11,004 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:37:11,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:37:10" (1/3) ... [2020-07-08 23:37:11,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103f6f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:37:11, skipping insertion in model container [2020-07-08 23:37:11,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:37:10" (2/3) ... [2020-07-08 23:37:11,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103f6f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:37:11, skipping insertion in model container [2020-07-08 23:37:11,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:37:10" (3/3) ... [2020-07-08 23:37:11,008 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-1.i [2020-07-08 23:37:11,020 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:37:11,033 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:37:11,050 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:37:11,106 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:37:11,107 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:37:11,107 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:37:11,107 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:37:11,107 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:37:11,107 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:37:11,108 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:37:11,108 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:37:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-08 23:37:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 23:37:11,138 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:11,139 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:11,140 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:11,146 INFO L82 PathProgramCache]: Analyzing trace with hash -649727231, now seen corresponding path program 1 times [2020-07-08 23:37:11,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:11,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363507869] [2020-07-08 23:37:11,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:11,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-08 23:37:11,287 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2020-07-08 23:37:11,289 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-08 23:37:11,290 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-08 23:37:11,290 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2020-07-08 23:37:11,290 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret1 := main(); {27#true} is VALID [2020-07-08 23:37:11,291 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~i~0; {27#true} is VALID [2020-07-08 23:37:11,291 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} ~sn~0 := 0; {27#true} is VALID [2020-07-08 23:37:11,291 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#true} ~i~0 := 1; {27#true} is VALID [2020-07-08 23:37:11,293 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-08 23:37:11,293 INFO L263 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {28#false} is VALID [2020-07-08 23:37:11,293 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2020-07-08 23:37:11,294 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2020-07-08 23:37:11,294 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-08 23:37:11,295 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-08 23:37:11,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [363507869] [2020-07-08 23:37:11,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:11,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 23:37:11,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014668312] [2020-07-08 23:37:11,305 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-08 23:37:11,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:11,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 23:37:11,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:11,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 23:37:11,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:11,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 23:37:11,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:37:11,357 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-08 23:37:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:11,450 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 23:37:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 23:37:11,451 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-08 23:37:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:37:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2020-07-08 23:37:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:37:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2020-07-08 23:37:11,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2020-07-08 23:37:11,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:11,573 INFO L225 Difference]: With dead ends: 35 [2020-07-08 23:37:11,574 INFO L226 Difference]: Without dead ends: 18 [2020-07-08 23:37:11,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:37:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-08 23:37:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-08 23:37:11,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:11,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-08 23:37:11,660 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 23:37:11,660 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 23:37:11,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:11,665 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-08 23:37:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 23:37:11,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:11,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:11,666 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 23:37:11,666 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 23:37:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:11,670 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-08 23:37:11,671 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 23:37:11,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:11,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:11,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:11,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 23:37:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-08 23:37:11,676 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2020-07-08 23:37:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:11,677 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-08 23:37:11,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 23:37:11,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2020-07-08 23:37:11,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:11,713 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-08 23:37:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-08 23:37:11,714 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:11,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:11,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:37:11,715 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash -662656525, now seen corresponding path program 1 times [2020-07-08 23:37:11,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:11,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1393407821] [2020-07-08 23:37:11,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:11,771 INFO L280 TraceCheckUtils]: 0: Hoare triple {175#true} assume true; {175#true} is VALID [2020-07-08 23:37:11,772 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {175#true} {175#true} #42#return; {175#true} is VALID [2020-07-08 23:37:11,772 INFO L263 TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {175#true} is VALID [2020-07-08 23:37:11,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID [2020-07-08 23:37:11,773 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #42#return; {175#true} is VALID [2020-07-08 23:37:11,773 INFO L263 TraceCheckUtils]: 3: Hoare triple {175#true} call #t~ret1 := main(); {175#true} is VALID [2020-07-08 23:37:11,774 INFO L280 TraceCheckUtils]: 4: Hoare triple {175#true} havoc ~i~0; {175#true} is VALID [2020-07-08 23:37:11,774 INFO L280 TraceCheckUtils]: 5: Hoare triple {175#true} ~sn~0 := 0; {175#true} is VALID [2020-07-08 23:37:11,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {175#true} ~i~0 := 1; {179#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:11,776 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= main_~i~0 1)} assume !(~i~0 <= 8); {176#false} is VALID [2020-07-08 23:37:11,776 INFO L263 TraceCheckUtils]: 8: Hoare triple {176#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {176#false} is VALID [2020-07-08 23:37:11,777 INFO L280 TraceCheckUtils]: 9: Hoare triple {176#false} ~cond := #in~cond; {176#false} is VALID [2020-07-08 23:37:11,777 INFO L280 TraceCheckUtils]: 10: Hoare triple {176#false} assume 0 == ~cond; {176#false} is VALID [2020-07-08 23:37:11,777 INFO L280 TraceCheckUtils]: 11: Hoare triple {176#false} assume !false; {176#false} is VALID [2020-07-08 23:37:11,778 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-08 23:37:11,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1393407821] [2020-07-08 23:37:11,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:37:11,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:37:11,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658928962] [2020-07-08 23:37:11,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-08 23:37:11,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:11,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:37:11,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:11,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:37:11,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:11,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:37:11,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:37:11,799 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2020-07-08 23:37:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:11,874 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-08 23:37:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:37:11,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-08 23:37:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:37:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-08 23:37:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:37:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-08 23:37:11,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2020-07-08 23:37:11,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:11,934 INFO L225 Difference]: With dead ends: 34 [2020-07-08 23:37:11,934 INFO L226 Difference]: Without dead ends: 23 [2020-07-08 23:37:11,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 23:37:11,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-08 23:37:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2020-07-08 23:37:11,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:11,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 20 states. [2020-07-08 23:37:11,954 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 20 states. [2020-07-08 23:37:11,954 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 20 states. [2020-07-08 23:37:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:11,957 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-08 23:37:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 23:37:11,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:11,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:11,958 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 23 states. [2020-07-08 23:37:11,959 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 23 states. [2020-07-08 23:37:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:11,961 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-08 23:37:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 23:37:11,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:11,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:11,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:11,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 23:37:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-08 23:37:11,965 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2020-07-08 23:37:11,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:11,965 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-08 23:37:11,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:37:11,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2020-07-08 23:37:12,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 23:37:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 23:37:12,011 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:12,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:12,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:37:12,011 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:12,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:12,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1659803531, now seen corresponding path program 1 times [2020-07-08 23:37:12,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:12,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1822664127] [2020-07-08 23:37:12,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:12,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-08 23:37:12,083 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {336#true} {336#true} #42#return; {336#true} is VALID [2020-07-08 23:37:12,084 INFO L263 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2020-07-08 23:37:12,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-08 23:37:12,085 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {336#true} {336#true} #42#return; {336#true} is VALID [2020-07-08 23:37:12,085 INFO L263 TraceCheckUtils]: 3: Hoare triple {336#true} call #t~ret1 := main(); {336#true} is VALID [2020-07-08 23:37:12,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {336#true} havoc ~i~0; {336#true} is VALID [2020-07-08 23:37:12,085 INFO L280 TraceCheckUtils]: 5: Hoare triple {336#true} ~sn~0 := 0; {336#true} is VALID [2020-07-08 23:37:12,086 INFO L280 TraceCheckUtils]: 6: Hoare triple {336#true} ~i~0 := 1; {340#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:12,087 INFO L280 TraceCheckUtils]: 7: Hoare triple {340#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {340#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:12,088 INFO L280 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 1)} assume ~i~0 < 4; {340#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:12,089 INFO L280 TraceCheckUtils]: 9: Hoare triple {340#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {340#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:12,090 INFO L280 TraceCheckUtils]: 10: Hoare triple {340#(<= main_~i~0 1)} #t~post0 := ~i~0; {341#(<= |main_#t~post0| 1)} is VALID [2020-07-08 23:37:12,091 INFO L280 TraceCheckUtils]: 11: Hoare triple {341#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {342#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:12,092 INFO L280 TraceCheckUtils]: 12: Hoare triple {342#(<= main_~i~0 2)} havoc #t~post0; {342#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:12,093 INFO L280 TraceCheckUtils]: 13: Hoare triple {342#(<= main_~i~0 2)} assume !(~i~0 <= 8); {337#false} is VALID [2020-07-08 23:37:12,093 INFO L263 TraceCheckUtils]: 14: Hoare triple {337#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {337#false} is VALID [2020-07-08 23:37:12,093 INFO L280 TraceCheckUtils]: 15: Hoare triple {337#false} ~cond := #in~cond; {337#false} is VALID [2020-07-08 23:37:12,094 INFO L280 TraceCheckUtils]: 16: Hoare triple {337#false} assume 0 == ~cond; {337#false} is VALID [2020-07-08 23:37:12,094 INFO L280 TraceCheckUtils]: 17: Hoare triple {337#false} assume !false; {337#false} is VALID [2020-07-08 23:37:12,095 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-08 23:37:12,096 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1822664127] [2020-07-08 23:37:12,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:12,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 23:37:12,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089767888] [2020-07-08 23:37:12,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 23:37:12,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:12,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:37:12,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:12,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:37:12,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:12,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:37:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:37:12,120 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2020-07-08 23:37:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:12,269 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-08 23:37:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:37:12,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-08 23:37:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:37:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-08 23:37:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:37:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-08 23:37:12,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2020-07-08 23:37:12,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:12,325 INFO L225 Difference]: With dead ends: 40 [2020-07-08 23:37:12,326 INFO L226 Difference]: Without dead ends: 29 [2020-07-08 23:37:12,326 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:37:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-08 23:37:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2020-07-08 23:37:12,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:12,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 26 states. [2020-07-08 23:37:12,349 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 26 states. [2020-07-08 23:37:12,349 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 26 states. [2020-07-08 23:37:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:12,352 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-08 23:37:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 23:37:12,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:12,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:12,353 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states. [2020-07-08 23:37:12,353 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states. [2020-07-08 23:37:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:12,355 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-08 23:37:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-08 23:37:12,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:12,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:12,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:12,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 23:37:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-08 23:37:12,359 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2020-07-08 23:37:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:12,359 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-08 23:37:12,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:37:12,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2020-07-08 23:37:12,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-08 23:37:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 23:37:12,392 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:12,392 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:12,392 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:37:12,392 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:12,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:12,393 INFO L82 PathProgramCache]: Analyzing trace with hash 891941667, now seen corresponding path program 2 times [2020-07-08 23:37:12,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:12,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1498817632] [2020-07-08 23:37:12,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:12,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {539#true} assume true; {539#true} is VALID [2020-07-08 23:37:12,509 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {539#true} {539#true} #42#return; {539#true} is VALID [2020-07-08 23:37:12,511 INFO L263 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {539#true} is VALID [2020-07-08 23:37:12,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {539#true} assume true; {539#true} is VALID [2020-07-08 23:37:12,512 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {539#true} {539#true} #42#return; {539#true} is VALID [2020-07-08 23:37:12,512 INFO L263 TraceCheckUtils]: 3: Hoare triple {539#true} call #t~ret1 := main(); {539#true} is VALID [2020-07-08 23:37:12,513 INFO L280 TraceCheckUtils]: 4: Hoare triple {539#true} havoc ~i~0; {539#true} is VALID [2020-07-08 23:37:12,513 INFO L280 TraceCheckUtils]: 5: Hoare triple {539#true} ~sn~0 := 0; {539#true} is VALID [2020-07-08 23:37:12,516 INFO L280 TraceCheckUtils]: 6: Hoare triple {539#true} ~i~0 := 1; {543#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:12,517 INFO L280 TraceCheckUtils]: 7: Hoare triple {543#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {543#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:12,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {543#(<= main_~i~0 1)} assume ~i~0 < 4; {543#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:12,518 INFO L280 TraceCheckUtils]: 9: Hoare triple {543#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {543#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:12,519 INFO L280 TraceCheckUtils]: 10: Hoare triple {543#(<= main_~i~0 1)} #t~post0 := ~i~0; {544#(<= |main_#t~post0| 1)} is VALID [2020-07-08 23:37:12,520 INFO L280 TraceCheckUtils]: 11: Hoare triple {544#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {545#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:12,523 INFO L280 TraceCheckUtils]: 12: Hoare triple {545#(<= main_~i~0 2)} havoc #t~post0; {545#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:12,524 INFO L280 TraceCheckUtils]: 13: Hoare triple {545#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {545#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:12,524 INFO L280 TraceCheckUtils]: 14: Hoare triple {545#(<= main_~i~0 2)} assume ~i~0 < 4; {545#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:12,525 INFO L280 TraceCheckUtils]: 15: Hoare triple {545#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {545#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:12,526 INFO L280 TraceCheckUtils]: 16: Hoare triple {545#(<= main_~i~0 2)} #t~post0 := ~i~0; {546#(<= |main_#t~post0| 2)} is VALID [2020-07-08 23:37:12,527 INFO L280 TraceCheckUtils]: 17: Hoare triple {546#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {547#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:12,528 INFO L280 TraceCheckUtils]: 18: Hoare triple {547#(<= main_~i~0 3)} havoc #t~post0; {547#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:12,529 INFO L280 TraceCheckUtils]: 19: Hoare triple {547#(<= main_~i~0 3)} assume !(~i~0 <= 8); {540#false} is VALID [2020-07-08 23:37:12,530 INFO L263 TraceCheckUtils]: 20: Hoare triple {540#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {540#false} is VALID [2020-07-08 23:37:12,530 INFO L280 TraceCheckUtils]: 21: Hoare triple {540#false} ~cond := #in~cond; {540#false} is VALID [2020-07-08 23:37:12,530 INFO L280 TraceCheckUtils]: 22: Hoare triple {540#false} assume 0 == ~cond; {540#false} is VALID [2020-07-08 23:37:12,530 INFO L280 TraceCheckUtils]: 23: Hoare triple {540#false} assume !false; {540#false} is VALID [2020-07-08 23:37:12,532 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-08 23:37:12,532 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1498817632] [2020-07-08 23:37:12,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:12,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 23:37:12,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645047468] [2020-07-08 23:37:12,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 23:37:12,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:12,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:37:12,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:12,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:37:12,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:12,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:37:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:37:12,567 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 7 states. [2020-07-08 23:37:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:12,810 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-08 23:37:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:37:12,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 23:37:12,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:37:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-08 23:37:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:37:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-08 23:37:12,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2020-07-08 23:37:12,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:12,876 INFO L225 Difference]: With dead ends: 45 [2020-07-08 23:37:12,876 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 23:37:12,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:37:12,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 23:37:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-08 23:37:12,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:12,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-08 23:37:12,906 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-08 23:37:12,906 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-08 23:37:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:12,909 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-08 23:37:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-08 23:37:12,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:12,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:12,911 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-08 23:37:12,911 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-08 23:37:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:12,913 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-08 23:37:12,914 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-08 23:37:12,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:12,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:12,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:12,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 23:37:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-08 23:37:12,925 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2020-07-08 23:37:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:12,926 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-08 23:37:12,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:37:12,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-08 23:37:12,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:12,969 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-08 23:37:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 23:37:12,970 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:12,971 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:12,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:37:12,971 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:12,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:12,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1860713659, now seen corresponding path program 3 times [2020-07-08 23:37:12,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:12,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1252951057] [2020-07-08 23:37:12,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:13,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {780#true} assume true; {780#true} is VALID [2020-07-08 23:37:13,077 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {780#true} {780#true} #42#return; {780#true} is VALID [2020-07-08 23:37:13,078 INFO L263 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {780#true} is VALID [2020-07-08 23:37:13,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {780#true} assume true; {780#true} is VALID [2020-07-08 23:37:13,078 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {780#true} {780#true} #42#return; {780#true} is VALID [2020-07-08 23:37:13,079 INFO L263 TraceCheckUtils]: 3: Hoare triple {780#true} call #t~ret1 := main(); {780#true} is VALID [2020-07-08 23:37:13,079 INFO L280 TraceCheckUtils]: 4: Hoare triple {780#true} havoc ~i~0; {780#true} is VALID [2020-07-08 23:37:13,079 INFO L280 TraceCheckUtils]: 5: Hoare triple {780#true} ~sn~0 := 0; {780#true} is VALID [2020-07-08 23:37:13,080 INFO L280 TraceCheckUtils]: 6: Hoare triple {780#true} ~i~0 := 1; {784#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:13,081 INFO L280 TraceCheckUtils]: 7: Hoare triple {784#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {784#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:13,081 INFO L280 TraceCheckUtils]: 8: Hoare triple {784#(<= main_~i~0 1)} assume ~i~0 < 4; {784#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:13,082 INFO L280 TraceCheckUtils]: 9: Hoare triple {784#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {784#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:13,083 INFO L280 TraceCheckUtils]: 10: Hoare triple {784#(<= main_~i~0 1)} #t~post0 := ~i~0; {785#(<= |main_#t~post0| 1)} is VALID [2020-07-08 23:37:13,083 INFO L280 TraceCheckUtils]: 11: Hoare triple {785#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {786#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,084 INFO L280 TraceCheckUtils]: 12: Hoare triple {786#(<= main_~i~0 2)} havoc #t~post0; {786#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,085 INFO L280 TraceCheckUtils]: 13: Hoare triple {786#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {786#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,086 INFO L280 TraceCheckUtils]: 14: Hoare triple {786#(<= main_~i~0 2)} assume ~i~0 < 4; {786#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,086 INFO L280 TraceCheckUtils]: 15: Hoare triple {786#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {786#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,087 INFO L280 TraceCheckUtils]: 16: Hoare triple {786#(<= main_~i~0 2)} #t~post0 := ~i~0; {787#(<= |main_#t~post0| 2)} is VALID [2020-07-08 23:37:13,088 INFO L280 TraceCheckUtils]: 17: Hoare triple {787#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {788#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,088 INFO L280 TraceCheckUtils]: 18: Hoare triple {788#(<= main_~i~0 3)} havoc #t~post0; {788#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,089 INFO L280 TraceCheckUtils]: 19: Hoare triple {788#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {788#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,090 INFO L280 TraceCheckUtils]: 20: Hoare triple {788#(<= main_~i~0 3)} assume ~i~0 < 4; {788#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,090 INFO L280 TraceCheckUtils]: 21: Hoare triple {788#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {788#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,091 INFO L280 TraceCheckUtils]: 22: Hoare triple {788#(<= main_~i~0 3)} #t~post0 := ~i~0; {789#(<= |main_#t~post0| 3)} is VALID [2020-07-08 23:37:13,092 INFO L280 TraceCheckUtils]: 23: Hoare triple {789#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {790#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:13,093 INFO L280 TraceCheckUtils]: 24: Hoare triple {790#(<= main_~i~0 4)} havoc #t~post0; {790#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:13,093 INFO L280 TraceCheckUtils]: 25: Hoare triple {790#(<= main_~i~0 4)} assume !(~i~0 <= 8); {781#false} is VALID [2020-07-08 23:37:13,094 INFO L263 TraceCheckUtils]: 26: Hoare triple {781#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {781#false} is VALID [2020-07-08 23:37:13,094 INFO L280 TraceCheckUtils]: 27: Hoare triple {781#false} ~cond := #in~cond; {781#false} is VALID [2020-07-08 23:37:13,094 INFO L280 TraceCheckUtils]: 28: Hoare triple {781#false} assume 0 == ~cond; {781#false} is VALID [2020-07-08 23:37:13,094 INFO L280 TraceCheckUtils]: 29: Hoare triple {781#false} assume !false; {781#false} is VALID [2020-07-08 23:37:13,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:13,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1252951057] [2020-07-08 23:37:13,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:13,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 23:37:13,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240609694] [2020-07-08 23:37:13,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-08 23:37:13,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:13,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:37:13,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:13,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:37:13,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:37:13,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:37:13,133 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 9 states. [2020-07-08 23:37:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:13,394 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-08 23:37:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:37:13,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-08 23:37:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:13,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:37:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-08 23:37:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:37:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-08 23:37:13,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2020-07-08 23:37:13,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:13,445 INFO L225 Difference]: With dead ends: 44 [2020-07-08 23:37:13,446 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 23:37:13,447 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:37:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 23:37:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-07-08 23:37:13,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:13,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2020-07-08 23:37:13,500 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2020-07-08 23:37:13,500 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2020-07-08 23:37:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:13,502 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 23:37:13,502 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 23:37:13,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:13,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:13,504 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2020-07-08 23:37:13,504 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2020-07-08 23:37:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:13,506 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-08 23:37:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-08 23:37:13,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:13,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:13,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:13,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 23:37:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-08 23:37:13,513 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2020-07-08 23:37:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:13,513 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-08 23:37:13,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:37:13,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2020-07-08 23:37:13,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-08 23:37:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 23:37:13,553 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:13,554 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:13,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:37:13,554 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:13,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:13,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1338804338, now seen corresponding path program 1 times [2020-07-08 23:37:13,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:13,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2037727636] [2020-07-08 23:37:13,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:13,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {1043#true} assume true; {1043#true} is VALID [2020-07-08 23:37:13,707 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1043#true} {1043#true} #42#return; {1043#true} is VALID [2020-07-08 23:37:13,708 INFO L263 TraceCheckUtils]: 0: Hoare triple {1043#true} call ULTIMATE.init(); {1043#true} is VALID [2020-07-08 23:37:13,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1043#true} assume true; {1043#true} is VALID [2020-07-08 23:37:13,708 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1043#true} {1043#true} #42#return; {1043#true} is VALID [2020-07-08 23:37:13,709 INFO L263 TraceCheckUtils]: 3: Hoare triple {1043#true} call #t~ret1 := main(); {1043#true} is VALID [2020-07-08 23:37:13,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {1043#true} havoc ~i~0; {1043#true} is VALID [2020-07-08 23:37:13,716 INFO L280 TraceCheckUtils]: 5: Hoare triple {1043#true} ~sn~0 := 0; {1043#true} is VALID [2020-07-08 23:37:13,722 INFO L280 TraceCheckUtils]: 6: Hoare triple {1043#true} ~i~0 := 1; {1047#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:13,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {1047#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1047#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:13,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {1047#(<= main_~i~0 1)} assume ~i~0 < 4; {1047#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:13,724 INFO L280 TraceCheckUtils]: 9: Hoare triple {1047#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1047#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:13,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {1047#(<= main_~i~0 1)} #t~post0 := ~i~0; {1048#(<= |main_#t~post0| 1)} is VALID [2020-07-08 23:37:13,725 INFO L280 TraceCheckUtils]: 11: Hoare triple {1048#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {1049#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,726 INFO L280 TraceCheckUtils]: 12: Hoare triple {1049#(<= main_~i~0 2)} havoc #t~post0; {1049#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,737 INFO L280 TraceCheckUtils]: 13: Hoare triple {1049#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1049#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {1049#(<= main_~i~0 2)} assume ~i~0 < 4; {1049#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {1049#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1049#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:13,742 INFO L280 TraceCheckUtils]: 16: Hoare triple {1049#(<= main_~i~0 2)} #t~post0 := ~i~0; {1050#(<= |main_#t~post0| 2)} is VALID [2020-07-08 23:37:13,742 INFO L280 TraceCheckUtils]: 17: Hoare triple {1050#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {1051#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {1051#(<= main_~i~0 3)} havoc #t~post0; {1051#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,743 INFO L280 TraceCheckUtils]: 19: Hoare triple {1051#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1051#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,744 INFO L280 TraceCheckUtils]: 20: Hoare triple {1051#(<= main_~i~0 3)} assume ~i~0 < 4; {1051#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,745 INFO L280 TraceCheckUtils]: 21: Hoare triple {1051#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1051#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:13,746 INFO L280 TraceCheckUtils]: 22: Hoare triple {1051#(<= main_~i~0 3)} #t~post0 := ~i~0; {1052#(<= |main_#t~post0| 3)} is VALID [2020-07-08 23:37:13,747 INFO L280 TraceCheckUtils]: 23: Hoare triple {1052#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {1053#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:13,747 INFO L280 TraceCheckUtils]: 24: Hoare triple {1053#(<= main_~i~0 4)} havoc #t~post0; {1053#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:13,750 INFO L280 TraceCheckUtils]: 25: Hoare triple {1053#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1053#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:13,752 INFO L280 TraceCheckUtils]: 26: Hoare triple {1053#(<= main_~i~0 4)} assume !(~i~0 < 4); {1053#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:13,755 INFO L280 TraceCheckUtils]: 27: Hoare triple {1053#(<= main_~i~0 4)} #t~post0 := ~i~0; {1054#(<= |main_#t~post0| 4)} is VALID [2020-07-08 23:37:13,755 INFO L280 TraceCheckUtils]: 28: Hoare triple {1054#(<= |main_#t~post0| 4)} ~i~0 := 1 + #t~post0; {1055#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:13,756 INFO L280 TraceCheckUtils]: 29: Hoare triple {1055#(<= main_~i~0 5)} havoc #t~post0; {1055#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:13,757 INFO L280 TraceCheckUtils]: 30: Hoare triple {1055#(<= main_~i~0 5)} assume !(~i~0 <= 8); {1044#false} is VALID [2020-07-08 23:37:13,757 INFO L263 TraceCheckUtils]: 31: Hoare triple {1044#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1044#false} is VALID [2020-07-08 23:37:13,757 INFO L280 TraceCheckUtils]: 32: Hoare triple {1044#false} ~cond := #in~cond; {1044#false} is VALID [2020-07-08 23:37:13,757 INFO L280 TraceCheckUtils]: 33: Hoare triple {1044#false} assume 0 == ~cond; {1044#false} is VALID [2020-07-08 23:37:13,758 INFO L280 TraceCheckUtils]: 34: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2020-07-08 23:37:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:13,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2037727636] [2020-07-08 23:37:13,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:13,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:37:13,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675893215] [2020-07-08 23:37:13,766 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-08 23:37:13,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:13,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:37:13,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:13,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:37:13,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:13,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:37:13,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:37:13,808 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 11 states. [2020-07-08 23:37:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:14,170 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-08 23:37:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 23:37:14,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-08 23:37:14,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:37:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2020-07-08 23:37:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:37:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2020-07-08 23:37:14,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 52 transitions. [2020-07-08 23:37:14,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:14,236 INFO L225 Difference]: With dead ends: 49 [2020-07-08 23:37:14,236 INFO L226 Difference]: Without dead ends: 44 [2020-07-08 23:37:14,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2020-07-08 23:37:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-08 23:37:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-07-08 23:37:14,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:14,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2020-07-08 23:37:14,277 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2020-07-08 23:37:14,277 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2020-07-08 23:37:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:14,279 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-08 23:37:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-08 23:37:14,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:14,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:14,280 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2020-07-08 23:37:14,280 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2020-07-08 23:37:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:14,282 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-08 23:37:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-08 23:37:14,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:14,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:14,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:14,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-08 23:37:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-07-08 23:37:14,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 35 [2020-07-08 23:37:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:14,285 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-07-08 23:37:14,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:37:14,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2020-07-08 23:37:14,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-08 23:37:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-08 23:37:14,329 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:14,329 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:14,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:37:14,330 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:14,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:14,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1859782885, now seen corresponding path program 2 times [2020-07-08 23:37:14,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:14,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1016211827] [2020-07-08 23:37:14,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:14,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {1342#true} assume true; {1342#true} is VALID [2020-07-08 23:37:14,511 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1342#true} {1342#true} #42#return; {1342#true} is VALID [2020-07-08 23:37:14,520 INFO L263 TraceCheckUtils]: 0: Hoare triple {1342#true} call ULTIMATE.init(); {1342#true} is VALID [2020-07-08 23:37:14,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {1342#true} assume true; {1342#true} is VALID [2020-07-08 23:37:14,520 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1342#true} {1342#true} #42#return; {1342#true} is VALID [2020-07-08 23:37:14,521 INFO L263 TraceCheckUtils]: 3: Hoare triple {1342#true} call #t~ret1 := main(); {1342#true} is VALID [2020-07-08 23:37:14,521 INFO L280 TraceCheckUtils]: 4: Hoare triple {1342#true} havoc ~i~0; {1342#true} is VALID [2020-07-08 23:37:14,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {1342#true} ~sn~0 := 0; {1342#true} is VALID [2020-07-08 23:37:14,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {1342#true} ~i~0 := 1; {1346#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:14,523 INFO L280 TraceCheckUtils]: 7: Hoare triple {1346#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1346#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:14,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {1346#(<= main_~i~0 1)} assume ~i~0 < 4; {1346#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:14,524 INFO L280 TraceCheckUtils]: 9: Hoare triple {1346#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1346#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:14,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {1346#(<= main_~i~0 1)} #t~post0 := ~i~0; {1347#(<= |main_#t~post0| 1)} is VALID [2020-07-08 23:37:14,525 INFO L280 TraceCheckUtils]: 11: Hoare triple {1347#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {1348#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:14,526 INFO L280 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~i~0 2)} havoc #t~post0; {1348#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:14,526 INFO L280 TraceCheckUtils]: 13: Hoare triple {1348#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1348#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:14,527 INFO L280 TraceCheckUtils]: 14: Hoare triple {1348#(<= main_~i~0 2)} assume ~i~0 < 4; {1348#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:14,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {1348#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1348#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:14,529 INFO L280 TraceCheckUtils]: 16: Hoare triple {1348#(<= main_~i~0 2)} #t~post0 := ~i~0; {1349#(<= |main_#t~post0| 2)} is VALID [2020-07-08 23:37:14,530 INFO L280 TraceCheckUtils]: 17: Hoare triple {1349#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {1350#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:14,533 INFO L280 TraceCheckUtils]: 18: Hoare triple {1350#(<= main_~i~0 3)} havoc #t~post0; {1350#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:14,536 INFO L280 TraceCheckUtils]: 19: Hoare triple {1350#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1350#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:14,537 INFO L280 TraceCheckUtils]: 20: Hoare triple {1350#(<= main_~i~0 3)} assume ~i~0 < 4; {1350#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:14,539 INFO L280 TraceCheckUtils]: 21: Hoare triple {1350#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1350#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:14,540 INFO L280 TraceCheckUtils]: 22: Hoare triple {1350#(<= main_~i~0 3)} #t~post0 := ~i~0; {1351#(<= |main_#t~post0| 3)} is VALID [2020-07-08 23:37:14,544 INFO L280 TraceCheckUtils]: 23: Hoare triple {1351#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {1352#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:14,545 INFO L280 TraceCheckUtils]: 24: Hoare triple {1352#(<= main_~i~0 4)} havoc #t~post0; {1352#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:14,546 INFO L280 TraceCheckUtils]: 25: Hoare triple {1352#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1352#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:14,547 INFO L280 TraceCheckUtils]: 26: Hoare triple {1352#(<= main_~i~0 4)} assume !(~i~0 < 4); {1352#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:14,548 INFO L280 TraceCheckUtils]: 27: Hoare triple {1352#(<= main_~i~0 4)} #t~post0 := ~i~0; {1353#(<= |main_#t~post0| 4)} is VALID [2020-07-08 23:37:14,548 INFO L280 TraceCheckUtils]: 28: Hoare triple {1353#(<= |main_#t~post0| 4)} ~i~0 := 1 + #t~post0; {1354#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:14,549 INFO L280 TraceCheckUtils]: 29: Hoare triple {1354#(<= main_~i~0 5)} havoc #t~post0; {1354#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:14,550 INFO L280 TraceCheckUtils]: 30: Hoare triple {1354#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1354#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:14,550 INFO L280 TraceCheckUtils]: 31: Hoare triple {1354#(<= main_~i~0 5)} assume !(~i~0 < 4); {1354#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:14,551 INFO L280 TraceCheckUtils]: 32: Hoare triple {1354#(<= main_~i~0 5)} #t~post0 := ~i~0; {1355#(<= |main_#t~post0| 5)} is VALID [2020-07-08 23:37:14,553 INFO L280 TraceCheckUtils]: 33: Hoare triple {1355#(<= |main_#t~post0| 5)} ~i~0 := 1 + #t~post0; {1356#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:14,553 INFO L280 TraceCheckUtils]: 34: Hoare triple {1356#(<= main_~i~0 6)} havoc #t~post0; {1356#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:14,554 INFO L280 TraceCheckUtils]: 35: Hoare triple {1356#(<= main_~i~0 6)} assume !(~i~0 <= 8); {1343#false} is VALID [2020-07-08 23:37:14,554 INFO L263 TraceCheckUtils]: 36: Hoare triple {1343#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1343#false} is VALID [2020-07-08 23:37:14,555 INFO L280 TraceCheckUtils]: 37: Hoare triple {1343#false} ~cond := #in~cond; {1343#false} is VALID [2020-07-08 23:37:14,555 INFO L280 TraceCheckUtils]: 38: Hoare triple {1343#false} assume 0 == ~cond; {1343#false} is VALID [2020-07-08 23:37:14,555 INFO L280 TraceCheckUtils]: 39: Hoare triple {1343#false} assume !false; {1343#false} is VALID [2020-07-08 23:37:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:14,558 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1016211827] [2020-07-08 23:37:14,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:14,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 23:37:14,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152273569] [2020-07-08 23:37:14,559 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-08 23:37:14,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:14,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 23:37:14,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:14,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 23:37:14,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:14,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 23:37:14,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:37:14,601 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 13 states. [2020-07-08 23:37:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:15,005 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-08 23:37:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 23:37:15,005 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-08 23:37:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:37:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2020-07-08 23:37:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:37:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2020-07-08 23:37:15,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 58 transitions. [2020-07-08 23:37:15,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:15,067 INFO L225 Difference]: With dead ends: 54 [2020-07-08 23:37:15,067 INFO L226 Difference]: Without dead ends: 49 [2020-07-08 23:37:15,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2020-07-08 23:37:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-08 23:37:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-07-08 23:37:15,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:15,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2020-07-08 23:37:15,108 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2020-07-08 23:37:15,108 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2020-07-08 23:37:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:15,111 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-08 23:37:15,111 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-08 23:37:15,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:15,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:15,111 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2020-07-08 23:37:15,112 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2020-07-08 23:37:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:15,114 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-08 23:37:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-08 23:37:15,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:15,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:15,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:15,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-08 23:37:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-07-08 23:37:15,116 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 40 [2020-07-08 23:37:15,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:15,117 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-07-08 23:37:15,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 23:37:15,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2020-07-08 23:37:15,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-07-08 23:37:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-08 23:37:15,172 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:15,172 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:15,173 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 23:37:15,173 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:15,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:15,173 INFO L82 PathProgramCache]: Analyzing trace with hash 350505490, now seen corresponding path program 3 times [2020-07-08 23:37:15,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:15,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [708310894] [2020-07-08 23:37:15,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:15,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {1677#true} assume true; {1677#true} is VALID [2020-07-08 23:37:15,402 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1677#true} {1677#true} #42#return; {1677#true} is VALID [2020-07-08 23:37:15,403 INFO L263 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2020-07-08 23:37:15,403 INFO L280 TraceCheckUtils]: 1: Hoare triple {1677#true} assume true; {1677#true} is VALID [2020-07-08 23:37:15,403 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1677#true} {1677#true} #42#return; {1677#true} is VALID [2020-07-08 23:37:15,404 INFO L263 TraceCheckUtils]: 3: Hoare triple {1677#true} call #t~ret1 := main(); {1677#true} is VALID [2020-07-08 23:37:15,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {1677#true} havoc ~i~0; {1677#true} is VALID [2020-07-08 23:37:15,405 INFO L280 TraceCheckUtils]: 5: Hoare triple {1677#true} ~sn~0 := 0; {1677#true} is VALID [2020-07-08 23:37:15,408 INFO L280 TraceCheckUtils]: 6: Hoare triple {1677#true} ~i~0 := 1; {1681#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:15,409 INFO L280 TraceCheckUtils]: 7: Hoare triple {1681#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1681#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:15,409 INFO L280 TraceCheckUtils]: 8: Hoare triple {1681#(<= main_~i~0 1)} assume ~i~0 < 4; {1681#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:15,410 INFO L280 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1681#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:15,411 INFO L280 TraceCheckUtils]: 10: Hoare triple {1681#(<= main_~i~0 1)} #t~post0 := ~i~0; {1682#(<= |main_#t~post0| 1)} is VALID [2020-07-08 23:37:15,412 INFO L280 TraceCheckUtils]: 11: Hoare triple {1682#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {1683#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:15,413 INFO L280 TraceCheckUtils]: 12: Hoare triple {1683#(<= main_~i~0 2)} havoc #t~post0; {1683#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:15,414 INFO L280 TraceCheckUtils]: 13: Hoare triple {1683#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1683#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:15,414 INFO L280 TraceCheckUtils]: 14: Hoare triple {1683#(<= main_~i~0 2)} assume ~i~0 < 4; {1683#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:15,423 INFO L280 TraceCheckUtils]: 15: Hoare triple {1683#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1683#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:15,424 INFO L280 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~0 2)} #t~post0 := ~i~0; {1684#(<= |main_#t~post0| 2)} is VALID [2020-07-08 23:37:15,426 INFO L280 TraceCheckUtils]: 17: Hoare triple {1684#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {1685#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:15,427 INFO L280 TraceCheckUtils]: 18: Hoare triple {1685#(<= main_~i~0 3)} havoc #t~post0; {1685#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:15,427 INFO L280 TraceCheckUtils]: 19: Hoare triple {1685#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1685#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:15,428 INFO L280 TraceCheckUtils]: 20: Hoare triple {1685#(<= main_~i~0 3)} assume ~i~0 < 4; {1685#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:15,429 INFO L280 TraceCheckUtils]: 21: Hoare triple {1685#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1685#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:15,430 INFO L280 TraceCheckUtils]: 22: Hoare triple {1685#(<= main_~i~0 3)} #t~post0 := ~i~0; {1686#(<= |main_#t~post0| 3)} is VALID [2020-07-08 23:37:15,432 INFO L280 TraceCheckUtils]: 23: Hoare triple {1686#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {1687#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:15,433 INFO L280 TraceCheckUtils]: 24: Hoare triple {1687#(<= main_~i~0 4)} havoc #t~post0; {1687#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:15,433 INFO L280 TraceCheckUtils]: 25: Hoare triple {1687#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1687#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:15,434 INFO L280 TraceCheckUtils]: 26: Hoare triple {1687#(<= main_~i~0 4)} assume !(~i~0 < 4); {1687#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:15,435 INFO L280 TraceCheckUtils]: 27: Hoare triple {1687#(<= main_~i~0 4)} #t~post0 := ~i~0; {1688#(<= |main_#t~post0| 4)} is VALID [2020-07-08 23:37:15,436 INFO L280 TraceCheckUtils]: 28: Hoare triple {1688#(<= |main_#t~post0| 4)} ~i~0 := 1 + #t~post0; {1689#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:15,436 INFO L280 TraceCheckUtils]: 29: Hoare triple {1689#(<= main_~i~0 5)} havoc #t~post0; {1689#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:15,437 INFO L280 TraceCheckUtils]: 30: Hoare triple {1689#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1689#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:15,437 INFO L280 TraceCheckUtils]: 31: Hoare triple {1689#(<= main_~i~0 5)} assume !(~i~0 < 4); {1689#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:15,438 INFO L280 TraceCheckUtils]: 32: Hoare triple {1689#(<= main_~i~0 5)} #t~post0 := ~i~0; {1690#(<= |main_#t~post0| 5)} is VALID [2020-07-08 23:37:15,440 INFO L280 TraceCheckUtils]: 33: Hoare triple {1690#(<= |main_#t~post0| 5)} ~i~0 := 1 + #t~post0; {1691#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:15,441 INFO L280 TraceCheckUtils]: 34: Hoare triple {1691#(<= main_~i~0 6)} havoc #t~post0; {1691#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:15,443 INFO L280 TraceCheckUtils]: 35: Hoare triple {1691#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1691#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:15,443 INFO L280 TraceCheckUtils]: 36: Hoare triple {1691#(<= main_~i~0 6)} assume !(~i~0 < 4); {1691#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:15,445 INFO L280 TraceCheckUtils]: 37: Hoare triple {1691#(<= main_~i~0 6)} #t~post0 := ~i~0; {1692#(<= |main_#t~post0| 6)} is VALID [2020-07-08 23:37:15,446 INFO L280 TraceCheckUtils]: 38: Hoare triple {1692#(<= |main_#t~post0| 6)} ~i~0 := 1 + #t~post0; {1693#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:15,447 INFO L280 TraceCheckUtils]: 39: Hoare triple {1693#(<= main_~i~0 7)} havoc #t~post0; {1693#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:15,448 INFO L280 TraceCheckUtils]: 40: Hoare triple {1693#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1678#false} is VALID [2020-07-08 23:37:15,448 INFO L263 TraceCheckUtils]: 41: Hoare triple {1678#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1678#false} is VALID [2020-07-08 23:37:15,458 INFO L280 TraceCheckUtils]: 42: Hoare triple {1678#false} ~cond := #in~cond; {1678#false} is VALID [2020-07-08 23:37:15,458 INFO L280 TraceCheckUtils]: 43: Hoare triple {1678#false} assume 0 == ~cond; {1678#false} is VALID [2020-07-08 23:37:15,459 INFO L280 TraceCheckUtils]: 44: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2020-07-08 23:37:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:15,462 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [708310894] [2020-07-08 23:37:15,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:15,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-08 23:37:15,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131262520] [2020-07-08 23:37:15,464 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2020-07-08 23:37:15,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:15,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 23:37:15,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:15,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 23:37:15,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:15,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 23:37:15,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:37:15,509 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 15 states. [2020-07-08 23:37:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:15,989 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2020-07-08 23:37:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-08 23:37:15,989 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2020-07-08 23:37:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:37:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 64 transitions. [2020-07-08 23:37:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:37:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 64 transitions. [2020-07-08 23:37:15,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 64 transitions. [2020-07-08 23:37:16,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:16,058 INFO L225 Difference]: With dead ends: 59 [2020-07-08 23:37:16,059 INFO L226 Difference]: Without dead ends: 54 [2020-07-08 23:37:16,061 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2020-07-08 23:37:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-08 23:37:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2020-07-08 23:37:16,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:16,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 51 states. [2020-07-08 23:37:16,108 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 51 states. [2020-07-08 23:37:16,109 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 51 states. [2020-07-08 23:37:16,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:16,113 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-08 23:37:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-08 23:37:16,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:16,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:16,113 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 54 states. [2020-07-08 23:37:16,114 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 54 states. [2020-07-08 23:37:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:16,116 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-08 23:37:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-08 23:37:16,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:16,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:16,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:16,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-08 23:37:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-07-08 23:37:16,119 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 45 [2020-07-08 23:37:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:16,120 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-07-08 23:37:16,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 23:37:16,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 55 transitions. [2020-07-08 23:37:16,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-07-08 23:37:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 23:37:16,167 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:16,168 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:16,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 23:37:16,168 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:16,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash -892978821, now seen corresponding path program 4 times [2020-07-08 23:37:16,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:16,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1504442099] [2020-07-08 23:37:16,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:16,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {2048#true} assume true; {2048#true} is VALID [2020-07-08 23:37:16,449 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2048#true} {2048#true} #42#return; {2048#true} is VALID [2020-07-08 23:37:16,449 INFO L263 TraceCheckUtils]: 0: Hoare triple {2048#true} call ULTIMATE.init(); {2048#true} is VALID [2020-07-08 23:37:16,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {2048#true} assume true; {2048#true} is VALID [2020-07-08 23:37:16,449 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2048#true} {2048#true} #42#return; {2048#true} is VALID [2020-07-08 23:37:16,449 INFO L263 TraceCheckUtils]: 3: Hoare triple {2048#true} call #t~ret1 := main(); {2048#true} is VALID [2020-07-08 23:37:16,450 INFO L280 TraceCheckUtils]: 4: Hoare triple {2048#true} havoc ~i~0; {2048#true} is VALID [2020-07-08 23:37:16,450 INFO L280 TraceCheckUtils]: 5: Hoare triple {2048#true} ~sn~0 := 0; {2048#true} is VALID [2020-07-08 23:37:16,450 INFO L280 TraceCheckUtils]: 6: Hoare triple {2048#true} ~i~0 := 1; {2052#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:16,451 INFO L280 TraceCheckUtils]: 7: Hoare triple {2052#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {2052#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:16,451 INFO L280 TraceCheckUtils]: 8: Hoare triple {2052#(<= main_~i~0 1)} assume ~i~0 < 4; {2052#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:16,451 INFO L280 TraceCheckUtils]: 9: Hoare triple {2052#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2052#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:16,452 INFO L280 TraceCheckUtils]: 10: Hoare triple {2052#(<= main_~i~0 1)} #t~post0 := ~i~0; {2053#(<= |main_#t~post0| 1)} is VALID [2020-07-08 23:37:16,452 INFO L280 TraceCheckUtils]: 11: Hoare triple {2053#(<= |main_#t~post0| 1)} ~i~0 := 1 + #t~post0; {2054#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:16,453 INFO L280 TraceCheckUtils]: 12: Hoare triple {2054#(<= main_~i~0 2)} havoc #t~post0; {2054#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:16,454 INFO L280 TraceCheckUtils]: 13: Hoare triple {2054#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {2054#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:16,454 INFO L280 TraceCheckUtils]: 14: Hoare triple {2054#(<= main_~i~0 2)} assume ~i~0 < 4; {2054#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:16,455 INFO L280 TraceCheckUtils]: 15: Hoare triple {2054#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2054#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:16,456 INFO L280 TraceCheckUtils]: 16: Hoare triple {2054#(<= main_~i~0 2)} #t~post0 := ~i~0; {2055#(<= |main_#t~post0| 2)} is VALID [2020-07-08 23:37:16,457 INFO L280 TraceCheckUtils]: 17: Hoare triple {2055#(<= |main_#t~post0| 2)} ~i~0 := 1 + #t~post0; {2056#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:16,457 INFO L280 TraceCheckUtils]: 18: Hoare triple {2056#(<= main_~i~0 3)} havoc #t~post0; {2056#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:16,459 INFO L280 TraceCheckUtils]: 19: Hoare triple {2056#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {2056#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:16,462 INFO L280 TraceCheckUtils]: 20: Hoare triple {2056#(<= main_~i~0 3)} assume ~i~0 < 4; {2056#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:16,463 INFO L280 TraceCheckUtils]: 21: Hoare triple {2056#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2056#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:16,465 INFO L280 TraceCheckUtils]: 22: Hoare triple {2056#(<= main_~i~0 3)} #t~post0 := ~i~0; {2057#(<= |main_#t~post0| 3)} is VALID [2020-07-08 23:37:16,466 INFO L280 TraceCheckUtils]: 23: Hoare triple {2057#(<= |main_#t~post0| 3)} ~i~0 := 1 + #t~post0; {2058#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:16,466 INFO L280 TraceCheckUtils]: 24: Hoare triple {2058#(<= main_~i~0 4)} havoc #t~post0; {2058#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:16,467 INFO L280 TraceCheckUtils]: 25: Hoare triple {2058#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {2058#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:16,468 INFO L280 TraceCheckUtils]: 26: Hoare triple {2058#(<= main_~i~0 4)} assume !(~i~0 < 4); {2058#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:16,468 INFO L280 TraceCheckUtils]: 27: Hoare triple {2058#(<= main_~i~0 4)} #t~post0 := ~i~0; {2059#(<= |main_#t~post0| 4)} is VALID [2020-07-08 23:37:16,469 INFO L280 TraceCheckUtils]: 28: Hoare triple {2059#(<= |main_#t~post0| 4)} ~i~0 := 1 + #t~post0; {2060#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:16,469 INFO L280 TraceCheckUtils]: 29: Hoare triple {2060#(<= main_~i~0 5)} havoc #t~post0; {2060#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:16,469 INFO L280 TraceCheckUtils]: 30: Hoare triple {2060#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {2060#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:16,470 INFO L280 TraceCheckUtils]: 31: Hoare triple {2060#(<= main_~i~0 5)} assume !(~i~0 < 4); {2060#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:16,471 INFO L280 TraceCheckUtils]: 32: Hoare triple {2060#(<= main_~i~0 5)} #t~post0 := ~i~0; {2061#(<= |main_#t~post0| 5)} is VALID [2020-07-08 23:37:16,471 INFO L280 TraceCheckUtils]: 33: Hoare triple {2061#(<= |main_#t~post0| 5)} ~i~0 := 1 + #t~post0; {2062#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:16,473 INFO L280 TraceCheckUtils]: 34: Hoare triple {2062#(<= main_~i~0 6)} havoc #t~post0; {2062#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:16,474 INFO L280 TraceCheckUtils]: 35: Hoare triple {2062#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {2062#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:16,474 INFO L280 TraceCheckUtils]: 36: Hoare triple {2062#(<= main_~i~0 6)} assume !(~i~0 < 4); {2062#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:16,475 INFO L280 TraceCheckUtils]: 37: Hoare triple {2062#(<= main_~i~0 6)} #t~post0 := ~i~0; {2063#(<= |main_#t~post0| 6)} is VALID [2020-07-08 23:37:16,475 INFO L280 TraceCheckUtils]: 38: Hoare triple {2063#(<= |main_#t~post0| 6)} ~i~0 := 1 + #t~post0; {2064#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:16,476 INFO L280 TraceCheckUtils]: 39: Hoare triple {2064#(<= main_~i~0 7)} havoc #t~post0; {2064#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:16,477 INFO L280 TraceCheckUtils]: 40: Hoare triple {2064#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {2064#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:16,477 INFO L280 TraceCheckUtils]: 41: Hoare triple {2064#(<= main_~i~0 7)} assume !(~i~0 < 4); {2064#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:16,478 INFO L280 TraceCheckUtils]: 42: Hoare triple {2064#(<= main_~i~0 7)} #t~post0 := ~i~0; {2065#(<= |main_#t~post0| 7)} is VALID [2020-07-08 23:37:16,478 INFO L280 TraceCheckUtils]: 43: Hoare triple {2065#(<= |main_#t~post0| 7)} ~i~0 := 1 + #t~post0; {2066#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:16,479 INFO L280 TraceCheckUtils]: 44: Hoare triple {2066#(<= main_~i~0 8)} havoc #t~post0; {2066#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:16,479 INFO L280 TraceCheckUtils]: 45: Hoare triple {2066#(<= main_~i~0 8)} assume !(~i~0 <= 8); {2049#false} is VALID [2020-07-08 23:37:16,479 INFO L263 TraceCheckUtils]: 46: Hoare triple {2049#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {2049#false} is VALID [2020-07-08 23:37:16,479 INFO L280 TraceCheckUtils]: 47: Hoare triple {2049#false} ~cond := #in~cond; {2049#false} is VALID [2020-07-08 23:37:16,480 INFO L280 TraceCheckUtils]: 48: Hoare triple {2049#false} assume 0 == ~cond; {2049#false} is VALID [2020-07-08 23:37:16,480 INFO L280 TraceCheckUtils]: 49: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2020-07-08 23:37:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:16,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1504442099] [2020-07-08 23:37:16,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:16,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-08 23:37:16,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185843720] [2020-07-08 23:37:16,484 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2020-07-08 23:37:16,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:16,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 23:37:16,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:16,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 23:37:16,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:16,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 23:37:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-08 23:37:16,545 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 17 states. [2020-07-08 23:37:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:17,113 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-07-08 23:37:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-08 23:37:17,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2020-07-08 23:37:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 23:37:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2020-07-08 23:37:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 23:37:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2020-07-08 23:37:17,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 66 transitions. [2020-07-08 23:37:17,173 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:17,175 INFO L225 Difference]: With dead ends: 61 [2020-07-08 23:37:17,175 INFO L226 Difference]: Without dead ends: 56 [2020-07-08 23:37:17,176 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2020-07-08 23:37:17,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-08 23:37:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-08 23:37:17,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:17,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-08 23:37:17,216 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-08 23:37:17,217 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-08 23:37:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:17,219 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-08 23:37:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-08 23:37:17,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:17,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:17,220 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-08 23:37:17,220 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-08 23:37:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:17,223 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-08 23:37:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-08 23:37:17,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:17,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:17,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:17,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:17,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-08 23:37:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-07-08 23:37:17,226 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2020-07-08 23:37:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:17,226 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-07-08 23:37:17,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 23:37:17,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2020-07-08 23:37:17,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:17,292 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-08 23:37:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-08 23:37:17,293 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:17,294 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:17,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 23:37:17,294 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:17,294 INFO L82 PathProgramCache]: Analyzing trace with hash 586056626, now seen corresponding path program 5 times [2020-07-08 23:37:17,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:17,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2093403215] [2020-07-08 23:37:17,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:37:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:37:17,354 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:37:17,354 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:37:17,355 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 23:37:17,381 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:37:17,381 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:37:17,381 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:37:17,381 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:37:17,382 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:37:17,382 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:37:17,382 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:37:17,382 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:37:17,382 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 23:37:17,382 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:37:17,382 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:37:17,383 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:37:17,383 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:37:17,383 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 23:37:17,383 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 23:37:17,383 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 23:37:17,383 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-08 23:37:17,383 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-08 23:37:17,384 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-08 23:37:17,384 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:37:17,384 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-08 23:37:17,384 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-08 23:37:17,384 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 23:37:17,384 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 23:37:17,384 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:37:17,385 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 23:37:17,385 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:37:17,385 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:37:17,385 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-08 23:37:17,385 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-08 23:37:17,385 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:37:17,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:37:17 BoogieIcfgContainer [2020-07-08 23:37:17,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:37:17,391 INFO L168 Benchmark]: Toolchain (without parser) took 7119.42 ms. Allocated memory was 138.9 MB in the beginning and 297.8 MB in the end (delta: 158.9 MB). Free memory was 103.0 MB in the beginning and 267.0 MB in the end (delta: -164.0 MB). Peak memory consumption was 163.7 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:17,392 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:37:17,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.44 ms. Allocated memory is still 138.9 MB. Free memory was 102.8 MB in the beginning and 93.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:17,393 INFO L168 Benchmark]: Boogie Preprocessor took 31.75 ms. Allocated memory is still 138.9 MB. Free memory was 93.4 MB in the beginning and 92.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:17,394 INFO L168 Benchmark]: RCFGBuilder took 434.05 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 91.8 MB in the beginning and 167.7 MB in the end (delta: -75.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:17,395 INFO L168 Benchmark]: TraceAbstraction took 6387.81 ms. Allocated memory was 202.9 MB in the beginning and 297.8 MB in the end (delta: 94.9 MB). Free memory was 167.1 MB in the beginning and 267.0 MB in the end (delta: -100.0 MB). Peak memory consumption was 163.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:17,397 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 138.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.44 ms. Allocated memory is still 138.9 MB. Free memory was 102.8 MB in the beginning and 93.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.75 ms. Allocated memory is still 138.9 MB. Free memory was 93.4 MB in the beginning and 92.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 434.05 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 91.8 MB in the beginning and 167.7 MB in the end (delta: -75.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6387.81 ms. Allocated memory was 202.9 MB in the beginning and 297.8 MB in the end (delta: 94.9 MB). Free memory was 167.1 MB in the beginning and 267.0 MB in the end (delta: -100.0 MB). Peak memory consumption was 163.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, sn=0; VAL [sn=0] [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 VAL [i=1, sn=0] [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 VAL [i=2, sn=2] [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 VAL [i=3, sn=4] [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.2s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 141 SDtfs, 130 SDslu, 733 SDs, 0 SdLazy, 426 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 21583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 0/324 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...