/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-8fc6572 [2020-07-11 02:28:04,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:28:04,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:28:04,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:28:04,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:28:04,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:28:04,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:28:04,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:28:04,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:28:04,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:28:04,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:28:04,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:28:04,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:28:04,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:28:04,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:28:04,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:28:04,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:28:04,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:28:04,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:28:04,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:28:04,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:28:04,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:28:04,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:28:04,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:28:04,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:28:04,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:28:04,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:28:04,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:28:04,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:28:04,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:28:04,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:28:04,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:28:04,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:28:04,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:28:04,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:28:04,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:28:04,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:28:04,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:28:04,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:28:04,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:28:04,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:28:04,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:28:04,418 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:28:04,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:28:04,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:28:04,420 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:28:04,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:28:04,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:28:04,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:28:04,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:28:04,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:28:04,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:28:04,421 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:28:04,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:28:04,421 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:28:04,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:28:04,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:28:04,422 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:28:04,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:28:04,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:28:04,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:28:04,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:28:04,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:28:04,423 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:28:04,423 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-11 02:28:04,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:28:04,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:28:04,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:28:04,726 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:28:04,726 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:28:04,727 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-11 02:28:04,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c691c7e40/4309bc747ef74c83a15ec859c168d4ac/FLAG01132c6df [2020-07-11 02:28:05,236 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:28:05,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-1.i [2020-07-11 02:28:05,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c691c7e40/4309bc747ef74c83a15ec859c168d4ac/FLAG01132c6df [2020-07-11 02:28:05,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c691c7e40/4309bc747ef74c83a15ec859c168d4ac [2020-07-11 02:28:05,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:28:05,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:28:05,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:28:05,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:28:05,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:28:05,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:28:05" (1/1) ... [2020-07-11 02:28:05,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582fec3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05, skipping insertion in model container [2020-07-11 02:28:05,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:28:05" (1/1) ... [2020-07-11 02:28:05,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:28:05,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:28:05,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:28:05,845 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:28:05,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:28:05,877 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:28:05,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05 WrapperNode [2020-07-11 02:28:05,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:28:05,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:28:05,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:28:05,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:28:05,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05" (1/1) ... [2020-07-11 02:28:05,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05" (1/1) ... [2020-07-11 02:28:05,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05" (1/1) ... [2020-07-11 02:28:05,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05" (1/1) ... [2020-07-11 02:28:05,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05" (1/1) ... [2020-07-11 02:28:06,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05" (1/1) ... [2020-07-11 02:28:06,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05" (1/1) ... [2020-07-11 02:28:06,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:28:06,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:28:06,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:28:06,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:28:06,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05" (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-11 02:28:06,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:28:06,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:28:06,075 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:28:06,075 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:28:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:28:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:28:06,075 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:28:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:28:06,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:28:06,301 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:28:06,301 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:28:06,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:28:06 BoogieIcfgContainer [2020-07-11 02:28:06,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:28:06,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:28:06,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:28:06,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:28:06,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:28:05" (1/3) ... [2020-07-11 02:28:06,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6155dbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:28:06, skipping insertion in model container [2020-07-11 02:28:06,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:28:05" (2/3) ... [2020-07-11 02:28:06,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6155dbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:28:06, skipping insertion in model container [2020-07-11 02:28:06,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:28:06" (3/3) ... [2020-07-11 02:28:06,315 INFO L109 eAbstractionObserver]: Analyzing ICFG sum04-1.i [2020-07-11 02:28:06,327 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:28:06,336 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:28:06,353 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:28:06,377 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:28:06,377 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:28:06,377 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:28:06,377 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:28:06,378 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:28:06,378 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:28:06,378 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:28:06,378 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:28:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-11 02:28:06,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-11 02:28:06,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:06,404 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:06,404 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:06,411 INFO L82 PathProgramCache]: Analyzing trace with hash -649727231, now seen corresponding path program 1 times [2020-07-11 02:28:06,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:06,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1927824076] [2020-07-11 02:28:06,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:06,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:06,556 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-11 02:28:06,557 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2020-07-11 02:28:06,559 INFO L263 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2020-07-11 02:28:06,560 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2020-07-11 02:28:06,560 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #42#return; {27#true} is VALID [2020-07-11 02:28:06,561 INFO L263 TraceCheckUtils]: 3: Hoare triple {27#true} call #t~ret1 := main(); {27#true} is VALID [2020-07-11 02:28:06,561 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#true} havoc ~i~0; {27#true} is VALID [2020-07-11 02:28:06,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {27#true} ~sn~0 := 0; {27#true} is VALID [2020-07-11 02:28:06,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {27#true} ~i~0 := 1; {27#true} is VALID [2020-07-11 02:28:06,564 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-11 02:28:06,564 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-11 02:28:06,564 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2020-07-11 02:28:06,565 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2020-07-11 02:28:06,565 INFO L280 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-11 02:28:06,566 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-11 02:28:06,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1927824076] [2020-07-11 02:28:06,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:28:06,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-11 02:28:06,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028788913] [2020-07-11 02:28:06,578 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-11 02:28:06,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:06,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-11 02:28:06,623 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-11 02:28:06,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-11 02:28:06,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:06,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-11 02:28:06,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:28:06,639 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-11 02:28:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:06,717 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-11 02:28:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-11 02:28:06,718 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-11 02:28:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:28:06,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2020-07-11 02:28:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:28:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2020-07-11 02:28:06,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2020-07-11 02:28:06,806 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-11 02:28:06,817 INFO L225 Difference]: With dead ends: 35 [2020-07-11 02:28:06,818 INFO L226 Difference]: Without dead ends: 18 [2020-07-11 02:28:06,822 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-11 02:28:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-11 02:28:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-11 02:28:06,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:06,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-11 02:28:06,875 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-11 02:28:06,875 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-11 02:28:06,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:06,879 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-11 02:28:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-11 02:28:06,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:06,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:06,881 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-11 02:28:06,881 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-11 02:28:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:06,886 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-11 02:28:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-11 02:28:06,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:06,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:06,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:06,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-11 02:28:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-11 02:28:06,893 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2020-07-11 02:28:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:06,894 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-11 02:28:06,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-11 02:28:06,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2020-07-11 02:28:06,928 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-11 02:28:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-11 02:28:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-11 02:28:06,929 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:06,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:06,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:28:06,930 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash -662656525, now seen corresponding path program 1 times [2020-07-11 02:28:06,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:06,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904225793] [2020-07-11 02:28:06,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:06,992 INFO L280 TraceCheckUtils]: 0: Hoare triple {175#true} assume true; {175#true} is VALID [2020-07-11 02:28:06,993 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {175#true} {175#true} #42#return; {175#true} is VALID [2020-07-11 02:28:06,993 INFO L263 TraceCheckUtils]: 0: Hoare triple {175#true} call ULTIMATE.init(); {175#true} is VALID [2020-07-11 02:28:06,993 INFO L280 TraceCheckUtils]: 1: Hoare triple {175#true} assume true; {175#true} is VALID [2020-07-11 02:28:06,994 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {175#true} {175#true} #42#return; {175#true} is VALID [2020-07-11 02:28:06,994 INFO L263 TraceCheckUtils]: 3: Hoare triple {175#true} call #t~ret1 := main(); {175#true} is VALID [2020-07-11 02:28:06,994 INFO L280 TraceCheckUtils]: 4: Hoare triple {175#true} havoc ~i~0; {175#true} is VALID [2020-07-11 02:28:06,995 INFO L280 TraceCheckUtils]: 5: Hoare triple {175#true} ~sn~0 := 0; {175#true} is VALID [2020-07-11 02:28:06,996 INFO L280 TraceCheckUtils]: 6: Hoare triple {175#true} ~i~0 := 1; {179#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:06,998 INFO L280 TraceCheckUtils]: 7: Hoare triple {179#(<= main_~i~0 1)} assume !(~i~0 <= 8); {176#false} is VALID [2020-07-11 02:28:06,998 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-11 02:28:06,998 INFO L280 TraceCheckUtils]: 9: Hoare triple {176#false} ~cond := #in~cond; {176#false} is VALID [2020-07-11 02:28:06,999 INFO L280 TraceCheckUtils]: 10: Hoare triple {176#false} assume 0 == ~cond; {176#false} is VALID [2020-07-11 02:28:06,999 INFO L280 TraceCheckUtils]: 11: Hoare triple {176#false} assume !false; {176#false} is VALID [2020-07-11 02:28:07,001 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-11 02:28:07,001 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904225793] [2020-07-11 02:28:07,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:28:07,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:28:07,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823775966] [2020-07-11 02:28:07,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-11 02:28:07,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:07,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:28:07,022 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-11 02:28:07,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:28:07,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:07,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:28:07,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:28:07,024 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2020-07-11 02:28:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:07,113 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2020-07-11 02:28:07,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:28:07,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-11 02:28:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:28:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-11 02:28:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:28:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-11 02:28:07,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2020-07-11 02:28:07,182 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-11 02:28:07,184 INFO L225 Difference]: With dead ends: 34 [2020-07-11 02:28:07,184 INFO L226 Difference]: Without dead ends: 23 [2020-07-11 02:28:07,185 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-11 02:28:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-11 02:28:07,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2020-07-11 02:28:07,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:07,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 20 states. [2020-07-11 02:28:07,205 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 20 states. [2020-07-11 02:28:07,205 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 20 states. [2020-07-11 02:28:07,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:07,208 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-11 02:28:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 02:28:07,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:07,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:07,209 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 23 states. [2020-07-11 02:28:07,210 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 23 states. [2020-07-11 02:28:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:07,212 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-11 02:28:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 02:28:07,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:07,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:07,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:07,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-11 02:28:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-11 02:28:07,216 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2020-07-11 02:28:07,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:07,217 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-11 02:28:07,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:28:07,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2020-07-11 02:28:07,251 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-11 02:28:07,252 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-11 02:28:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-11 02:28:07,253 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:07,253 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-11 02:28:07,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:28:07,253 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:07,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1659803531, now seen corresponding path program 1 times [2020-07-11 02:28:07,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:07,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263747932] [2020-07-11 02:28:07,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:07,365 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-11 02:28:07,366 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {336#true} {336#true} #42#return; {336#true} is VALID [2020-07-11 02:28:07,366 INFO L263 TraceCheckUtils]: 0: Hoare triple {336#true} call ULTIMATE.init(); {336#true} is VALID [2020-07-11 02:28:07,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {336#true} assume true; {336#true} is VALID [2020-07-11 02:28:07,367 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {336#true} {336#true} #42#return; {336#true} is VALID [2020-07-11 02:28:07,367 INFO L263 TraceCheckUtils]: 3: Hoare triple {336#true} call #t~ret1 := main(); {336#true} is VALID [2020-07-11 02:28:07,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {336#true} havoc ~i~0; {336#true} is VALID [2020-07-11 02:28:07,368 INFO L280 TraceCheckUtils]: 5: Hoare triple {336#true} ~sn~0 := 0; {336#true} is VALID [2020-07-11 02:28:07,369 INFO L280 TraceCheckUtils]: 6: Hoare triple {336#true} ~i~0 := 1; {340#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:07,371 INFO L280 TraceCheckUtils]: 7: Hoare triple {340#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {340#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:07,372 INFO L280 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 1)} assume ~i~0 < 4; {340#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:07,373 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-11 02:28:07,374 INFO L280 TraceCheckUtils]: 10: Hoare triple {340#(<= main_~i~0 1)} #t~post0 := ~i~0; {341#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:07,375 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-11 02:28:07,376 INFO L280 TraceCheckUtils]: 12: Hoare triple {342#(<= main_~i~0 2)} havoc #t~post0; {342#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:07,378 INFO L280 TraceCheckUtils]: 13: Hoare triple {342#(<= main_~i~0 2)} assume !(~i~0 <= 8); {337#false} is VALID [2020-07-11 02:28:07,378 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-11 02:28:07,378 INFO L280 TraceCheckUtils]: 15: Hoare triple {337#false} ~cond := #in~cond; {337#false} is VALID [2020-07-11 02:28:07,379 INFO L280 TraceCheckUtils]: 16: Hoare triple {337#false} assume 0 == ~cond; {337#false} is VALID [2020-07-11 02:28:07,379 INFO L280 TraceCheckUtils]: 17: Hoare triple {337#false} assume !false; {337#false} is VALID [2020-07-11 02:28:07,381 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-11 02:28:07,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263747932] [2020-07-11 02:28:07,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:07,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-11 02:28:07,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887559385] [2020-07-11 02:28:07,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 02:28:07,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:07,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:28:07,409 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-11 02:28:07,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:28:07,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:07,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:28:07,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:28:07,411 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2020-07-11 02:28:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:07,588 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-11 02:28:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:28:07,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-11 02:28:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:28:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-11 02:28:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:28:07,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2020-07-11 02:28:07,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2020-07-11 02:28:07,651 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-11 02:28:07,652 INFO L225 Difference]: With dead ends: 40 [2020-07-11 02:28:07,652 INFO L226 Difference]: Without dead ends: 29 [2020-07-11 02:28:07,653 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-11 02:28:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-11 02:28:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2020-07-11 02:28:07,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:07,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 26 states. [2020-07-11 02:28:07,679 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 26 states. [2020-07-11 02:28:07,679 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 26 states. [2020-07-11 02:28:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:07,681 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-11 02:28:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 02:28:07,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:07,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:07,683 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states. [2020-07-11 02:28:07,683 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states. [2020-07-11 02:28:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:07,685 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2020-07-11 02:28:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-07-11 02:28:07,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:07,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:07,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:07,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-11 02:28:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-07-11 02:28:07,689 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2020-07-11 02:28:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:07,689 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-07-11 02:28:07,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:28:07,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 27 transitions. [2020-07-11 02:28:07,725 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-11 02:28:07,725 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-07-11 02:28:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-11 02:28:07,726 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:07,726 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-11 02:28:07,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:28:07,727 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:07,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:07,727 INFO L82 PathProgramCache]: Analyzing trace with hash 891941667, now seen corresponding path program 2 times [2020-07-11 02:28:07,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:07,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114274377] [2020-07-11 02:28:07,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:07,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {539#true} assume true; {539#true} is VALID [2020-07-11 02:28:07,829 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {539#true} {539#true} #42#return; {539#true} is VALID [2020-07-11 02:28:07,830 INFO L263 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {539#true} is VALID [2020-07-11 02:28:07,830 INFO L280 TraceCheckUtils]: 1: Hoare triple {539#true} assume true; {539#true} is VALID [2020-07-11 02:28:07,830 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {539#true} {539#true} #42#return; {539#true} is VALID [2020-07-11 02:28:07,831 INFO L263 TraceCheckUtils]: 3: Hoare triple {539#true} call #t~ret1 := main(); {539#true} is VALID [2020-07-11 02:28:07,831 INFO L280 TraceCheckUtils]: 4: Hoare triple {539#true} havoc ~i~0; {539#true} is VALID [2020-07-11 02:28:07,831 INFO L280 TraceCheckUtils]: 5: Hoare triple {539#true} ~sn~0 := 0; {539#true} is VALID [2020-07-11 02:28:07,832 INFO L280 TraceCheckUtils]: 6: Hoare triple {539#true} ~i~0 := 1; {543#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:07,833 INFO L280 TraceCheckUtils]: 7: Hoare triple {543#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {543#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:07,834 INFO L280 TraceCheckUtils]: 8: Hoare triple {543#(<= main_~i~0 1)} assume ~i~0 < 4; {543#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:07,835 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-11 02:28:07,836 INFO L280 TraceCheckUtils]: 10: Hoare triple {543#(<= main_~i~0 1)} #t~post0 := ~i~0; {544#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:07,837 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-11 02:28:07,838 INFO L280 TraceCheckUtils]: 12: Hoare triple {545#(<= main_~i~0 2)} havoc #t~post0; {545#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:07,839 INFO L280 TraceCheckUtils]: 13: Hoare triple {545#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {545#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:07,840 INFO L280 TraceCheckUtils]: 14: Hoare triple {545#(<= main_~i~0 2)} assume ~i~0 < 4; {545#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:07,841 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-11 02:28:07,842 INFO L280 TraceCheckUtils]: 16: Hoare triple {545#(<= main_~i~0 2)} #t~post0 := ~i~0; {546#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:07,843 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-11 02:28:07,844 INFO L280 TraceCheckUtils]: 18: Hoare triple {547#(<= main_~i~0 3)} havoc #t~post0; {547#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:07,845 INFO L280 TraceCheckUtils]: 19: Hoare triple {547#(<= main_~i~0 3)} assume !(~i~0 <= 8); {540#false} is VALID [2020-07-11 02:28:07,845 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-11 02:28:07,846 INFO L280 TraceCheckUtils]: 21: Hoare triple {540#false} ~cond := #in~cond; {540#false} is VALID [2020-07-11 02:28:07,846 INFO L280 TraceCheckUtils]: 22: Hoare triple {540#false} assume 0 == ~cond; {540#false} is VALID [2020-07-11 02:28:07,846 INFO L280 TraceCheckUtils]: 23: Hoare triple {540#false} assume !false; {540#false} is VALID [2020-07-11 02:28:07,847 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-11 02:28:07,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114274377] [2020-07-11 02:28:07,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:07,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 02:28:07,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488573564] [2020-07-11 02:28:07,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 02:28:07,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:07,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:28:07,882 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-11 02:28:07,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:28:07,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:28:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:28:07,883 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 7 states. [2020-07-11 02:28:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,113 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-11 02:28:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:28:08,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-11 02:28:08,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:28:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-11 02:28:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:28:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2020-07-11 02:28:08,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2020-07-11 02:28:08,184 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-11 02:28:08,186 INFO L225 Difference]: With dead ends: 45 [2020-07-11 02:28:08,186 INFO L226 Difference]: Without dead ends: 34 [2020-07-11 02:28:08,187 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-11 02:28:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-11 02:28:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-11 02:28:08,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:08,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2020-07-11 02:28:08,224 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2020-07-11 02:28:08,225 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2020-07-11 02:28:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,227 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-11 02:28:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-11 02:28:08,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:08,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:08,228 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2020-07-11 02:28:08,229 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2020-07-11 02:28:08,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,231 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-07-11 02:28:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-07-11 02:28:08,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:08,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:08,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:08,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-11 02:28:08,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-07-11 02:28:08,235 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 24 [2020-07-11 02:28:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:08,235 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-07-11 02:28:08,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:28:08,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 33 transitions. [2020-07-11 02:28:08,294 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-11 02:28:08,294 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-07-11 02:28:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-11 02:28:08,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:08,296 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-11 02:28:08,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:28:08,296 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:08,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:08,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1860713659, now seen corresponding path program 3 times [2020-07-11 02:28:08,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:08,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076249504] [2020-07-11 02:28:08,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:08,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {780#true} assume true; {780#true} is VALID [2020-07-11 02:28:08,416 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {780#true} {780#true} #42#return; {780#true} is VALID [2020-07-11 02:28:08,417 INFO L263 TraceCheckUtils]: 0: Hoare triple {780#true} call ULTIMATE.init(); {780#true} is VALID [2020-07-11 02:28:08,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {780#true} assume true; {780#true} is VALID [2020-07-11 02:28:08,417 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {780#true} {780#true} #42#return; {780#true} is VALID [2020-07-11 02:28:08,417 INFO L263 TraceCheckUtils]: 3: Hoare triple {780#true} call #t~ret1 := main(); {780#true} is VALID [2020-07-11 02:28:08,418 INFO L280 TraceCheckUtils]: 4: Hoare triple {780#true} havoc ~i~0; {780#true} is VALID [2020-07-11 02:28:08,418 INFO L280 TraceCheckUtils]: 5: Hoare triple {780#true} ~sn~0 := 0; {780#true} is VALID [2020-07-11 02:28:08,419 INFO L280 TraceCheckUtils]: 6: Hoare triple {780#true} ~i~0 := 1; {784#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:08,420 INFO L280 TraceCheckUtils]: 7: Hoare triple {784#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {784#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:08,420 INFO L280 TraceCheckUtils]: 8: Hoare triple {784#(<= main_~i~0 1)} assume ~i~0 < 4; {784#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:08,421 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-11 02:28:08,422 INFO L280 TraceCheckUtils]: 10: Hoare triple {784#(<= main_~i~0 1)} #t~post0 := ~i~0; {785#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:08,423 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-11 02:28:08,424 INFO L280 TraceCheckUtils]: 12: Hoare triple {786#(<= main_~i~0 2)} havoc #t~post0; {786#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:08,424 INFO L280 TraceCheckUtils]: 13: Hoare triple {786#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {786#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:08,425 INFO L280 TraceCheckUtils]: 14: Hoare triple {786#(<= main_~i~0 2)} assume ~i~0 < 4; {786#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:08,426 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-11 02:28:08,426 INFO L280 TraceCheckUtils]: 16: Hoare triple {786#(<= main_~i~0 2)} #t~post0 := ~i~0; {787#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:08,428 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-11 02:28:08,428 INFO L280 TraceCheckUtils]: 18: Hoare triple {788#(<= main_~i~0 3)} havoc #t~post0; {788#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:08,429 INFO L280 TraceCheckUtils]: 19: Hoare triple {788#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {788#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:08,430 INFO L280 TraceCheckUtils]: 20: Hoare triple {788#(<= main_~i~0 3)} assume ~i~0 < 4; {788#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:08,431 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-11 02:28:08,432 INFO L280 TraceCheckUtils]: 22: Hoare triple {788#(<= main_~i~0 3)} #t~post0 := ~i~0; {789#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:08,433 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-11 02:28:08,434 INFO L280 TraceCheckUtils]: 24: Hoare triple {790#(<= main_~i~0 4)} havoc #t~post0; {790#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:08,435 INFO L280 TraceCheckUtils]: 25: Hoare triple {790#(<= main_~i~0 4)} assume !(~i~0 <= 8); {781#false} is VALID [2020-07-11 02:28:08,435 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-11 02:28:08,436 INFO L280 TraceCheckUtils]: 27: Hoare triple {781#false} ~cond := #in~cond; {781#false} is VALID [2020-07-11 02:28:08,436 INFO L280 TraceCheckUtils]: 28: Hoare triple {781#false} assume 0 == ~cond; {781#false} is VALID [2020-07-11 02:28:08,436 INFO L280 TraceCheckUtils]: 29: Hoare triple {781#false} assume !false; {781#false} is VALID [2020-07-11 02:28:08,438 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-11 02:28:08,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076249504] [2020-07-11 02:28:08,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:08,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-11 02:28:08,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263900333] [2020-07-11 02:28:08,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-11 02:28:08,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:08,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-11 02:28:08,477 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-11 02:28:08,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-11 02:28:08,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:08,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-11 02:28:08,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:28:08,478 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 9 states. [2020-07-11 02:28:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,752 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-11 02:28:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:28:08,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-07-11 02:28:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:28:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-11 02:28:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-11 02:28:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-11 02:28:08,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2020-07-11 02:28:08,807 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-11 02:28:08,808 INFO L225 Difference]: With dead ends: 44 [2020-07-11 02:28:08,809 INFO L226 Difference]: Without dead ends: 39 [2020-07-11 02:28:08,809 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-11 02:28:08,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-11 02:28:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-07-11 02:28:08,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:08,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2020-07-11 02:28:08,840 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2020-07-11 02:28:08,840 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2020-07-11 02:28:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,843 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-11 02:28:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-11 02:28:08,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:08,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:08,844 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2020-07-11 02:28:08,844 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2020-07-11 02:28:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:08,846 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-07-11 02:28:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-11 02:28:08,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:08,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:08,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:08,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-11 02:28:08,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-07-11 02:28:08,849 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2020-07-11 02:28:08,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:08,850 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-07-11 02:28:08,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-11 02:28:08,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 37 transitions. [2020-07-11 02:28:08,888 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-11 02:28:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-07-11 02:28:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 02:28:08,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:08,889 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-11 02:28:08,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:28:08,890 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:08,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1338804338, now seen corresponding path program 1 times [2020-07-11 02:28:08,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:08,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217596280] [2020-07-11 02:28:08,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:09,068 INFO L280 TraceCheckUtils]: 0: Hoare triple {1043#true} assume true; {1043#true} is VALID [2020-07-11 02:28:09,068 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1043#true} {1043#true} #42#return; {1043#true} is VALID [2020-07-11 02:28:09,069 INFO L263 TraceCheckUtils]: 0: Hoare triple {1043#true} call ULTIMATE.init(); {1043#true} is VALID [2020-07-11 02:28:09,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {1043#true} assume true; {1043#true} is VALID [2020-07-11 02:28:09,069 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1043#true} {1043#true} #42#return; {1043#true} is VALID [2020-07-11 02:28:09,069 INFO L263 TraceCheckUtils]: 3: Hoare triple {1043#true} call #t~ret1 := main(); {1043#true} is VALID [2020-07-11 02:28:09,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {1043#true} havoc ~i~0; {1043#true} is VALID [2020-07-11 02:28:09,070 INFO L280 TraceCheckUtils]: 5: Hoare triple {1043#true} ~sn~0 := 0; {1043#true} is VALID [2020-07-11 02:28:09,071 INFO L280 TraceCheckUtils]: 6: Hoare triple {1043#true} ~i~0 := 1; {1047#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,071 INFO L280 TraceCheckUtils]: 7: Hoare triple {1047#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1047#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,072 INFO L280 TraceCheckUtils]: 8: Hoare triple {1047#(<= main_~i~0 1)} assume ~i~0 < 4; {1047#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,073 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-11 02:28:09,073 INFO L280 TraceCheckUtils]: 10: Hoare triple {1047#(<= main_~i~0 1)} #t~post0 := ~i~0; {1048#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:09,074 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-11 02:28:09,075 INFO L280 TraceCheckUtils]: 12: Hoare triple {1049#(<= main_~i~0 2)} havoc #t~post0; {1049#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,076 INFO L280 TraceCheckUtils]: 13: Hoare triple {1049#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1049#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,076 INFO L280 TraceCheckUtils]: 14: Hoare triple {1049#(<= main_~i~0 2)} assume ~i~0 < 4; {1049#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,077 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-11 02:28:09,078 INFO L280 TraceCheckUtils]: 16: Hoare triple {1049#(<= main_~i~0 2)} #t~post0 := ~i~0; {1050#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:09,079 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-11 02:28:09,079 INFO L280 TraceCheckUtils]: 18: Hoare triple {1051#(<= main_~i~0 3)} havoc #t~post0; {1051#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,080 INFO L280 TraceCheckUtils]: 19: Hoare triple {1051#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1051#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,081 INFO L280 TraceCheckUtils]: 20: Hoare triple {1051#(<= main_~i~0 3)} assume ~i~0 < 4; {1051#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,081 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-11 02:28:09,082 INFO L280 TraceCheckUtils]: 22: Hoare triple {1051#(<= main_~i~0 3)} #t~post0 := ~i~0; {1052#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:09,083 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-11 02:28:09,084 INFO L280 TraceCheckUtils]: 24: Hoare triple {1053#(<= main_~i~0 4)} havoc #t~post0; {1053#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:09,084 INFO L280 TraceCheckUtils]: 25: Hoare triple {1053#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1053#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:09,085 INFO L280 TraceCheckUtils]: 26: Hoare triple {1053#(<= main_~i~0 4)} assume !(~i~0 < 4); {1053#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:09,086 INFO L280 TraceCheckUtils]: 27: Hoare triple {1053#(<= main_~i~0 4)} #t~post0 := ~i~0; {1054#(<= |main_#t~post0| 4)} is VALID [2020-07-11 02:28:09,087 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-11 02:28:09,088 INFO L280 TraceCheckUtils]: 29: Hoare triple {1055#(<= main_~i~0 5)} havoc #t~post0; {1055#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:09,088 INFO L280 TraceCheckUtils]: 30: Hoare triple {1055#(<= main_~i~0 5)} assume !(~i~0 <= 8); {1044#false} is VALID [2020-07-11 02:28:09,089 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-11 02:28:09,089 INFO L280 TraceCheckUtils]: 32: Hoare triple {1044#false} ~cond := #in~cond; {1044#false} is VALID [2020-07-11 02:28:09,089 INFO L280 TraceCheckUtils]: 33: Hoare triple {1044#false} assume 0 == ~cond; {1044#false} is VALID [2020-07-11 02:28:09,089 INFO L280 TraceCheckUtils]: 34: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2020-07-11 02:28:09,091 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-11 02:28:09,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217596280] [2020-07-11 02:28:09,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:09,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:28:09,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804926013] [2020-07-11 02:28:09,093 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-11 02:28:09,093 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:09,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:28:09,131 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-11 02:28:09,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:28:09,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:09,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:28:09,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:28:09,132 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 11 states. [2020-07-11 02:28:09,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:09,491 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2020-07-11 02:28:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-11 02:28:09,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-11 02:28:09,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:28:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2020-07-11 02:28:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:28:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2020-07-11 02:28:09,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 52 transitions. [2020-07-11 02:28:09,572 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-11 02:28:09,574 INFO L225 Difference]: With dead ends: 49 [2020-07-11 02:28:09,574 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 02:28:09,575 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-11 02:28:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 02:28:09,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-07-11 02:28:09,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:09,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2020-07-11 02:28:09,628 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2020-07-11 02:28:09,628 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2020-07-11 02:28:09,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:09,630 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-11 02:28:09,630 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-11 02:28:09,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:09,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:09,631 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2020-07-11 02:28:09,631 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2020-07-11 02:28:09,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:09,633 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2020-07-11 02:28:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-07-11 02:28:09,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:09,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:09,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:09,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-11 02:28:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-07-11 02:28:09,636 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 35 [2020-07-11 02:28:09,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:09,636 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-07-11 02:28:09,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:28:09,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2020-07-11 02:28:09,677 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-11 02:28:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-07-11 02:28:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-11 02:28:09,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:09,678 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-11 02:28:09,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:28:09,679 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1859782885, now seen corresponding path program 2 times [2020-07-11 02:28:09,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:09,680 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [754039435] [2020-07-11 02:28:09,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:09,842 INFO L280 TraceCheckUtils]: 0: Hoare triple {1342#true} assume true; {1342#true} is VALID [2020-07-11 02:28:09,842 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1342#true} {1342#true} #42#return; {1342#true} is VALID [2020-07-11 02:28:09,842 INFO L263 TraceCheckUtils]: 0: Hoare triple {1342#true} call ULTIMATE.init(); {1342#true} is VALID [2020-07-11 02:28:09,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {1342#true} assume true; {1342#true} is VALID [2020-07-11 02:28:09,843 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1342#true} {1342#true} #42#return; {1342#true} is VALID [2020-07-11 02:28:09,843 INFO L263 TraceCheckUtils]: 3: Hoare triple {1342#true} call #t~ret1 := main(); {1342#true} is VALID [2020-07-11 02:28:09,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {1342#true} havoc ~i~0; {1342#true} is VALID [2020-07-11 02:28:09,843 INFO L280 TraceCheckUtils]: 5: Hoare triple {1342#true} ~sn~0 := 0; {1342#true} is VALID [2020-07-11 02:28:09,844 INFO L280 TraceCheckUtils]: 6: Hoare triple {1342#true} ~i~0 := 1; {1346#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {1346#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1346#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,845 INFO L280 TraceCheckUtils]: 8: Hoare triple {1346#(<= main_~i~0 1)} assume ~i~0 < 4; {1346#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:09,846 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-11 02:28:09,846 INFO L280 TraceCheckUtils]: 10: Hoare triple {1346#(<= main_~i~0 1)} #t~post0 := ~i~0; {1347#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:09,847 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-11 02:28:09,847 INFO L280 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~i~0 2)} havoc #t~post0; {1348#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,848 INFO L280 TraceCheckUtils]: 13: Hoare triple {1348#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1348#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,848 INFO L280 TraceCheckUtils]: 14: Hoare triple {1348#(<= main_~i~0 2)} assume ~i~0 < 4; {1348#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:09,849 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-11 02:28:09,851 INFO L280 TraceCheckUtils]: 16: Hoare triple {1348#(<= main_~i~0 2)} #t~post0 := ~i~0; {1349#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:09,852 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-11 02:28:09,853 INFO L280 TraceCheckUtils]: 18: Hoare triple {1350#(<= main_~i~0 3)} havoc #t~post0; {1350#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,853 INFO L280 TraceCheckUtils]: 19: Hoare triple {1350#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1350#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,853 INFO L280 TraceCheckUtils]: 20: Hoare triple {1350#(<= main_~i~0 3)} assume ~i~0 < 4; {1350#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:09,856 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-11 02:28:09,857 INFO L280 TraceCheckUtils]: 22: Hoare triple {1350#(<= main_~i~0 3)} #t~post0 := ~i~0; {1351#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:09,859 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-11 02:28:09,860 INFO L280 TraceCheckUtils]: 24: Hoare triple {1352#(<= main_~i~0 4)} havoc #t~post0; {1352#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:09,862 INFO L280 TraceCheckUtils]: 25: Hoare triple {1352#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1352#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:09,863 INFO L280 TraceCheckUtils]: 26: Hoare triple {1352#(<= main_~i~0 4)} assume !(~i~0 < 4); {1352#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:09,864 INFO L280 TraceCheckUtils]: 27: Hoare triple {1352#(<= main_~i~0 4)} #t~post0 := ~i~0; {1353#(<= |main_#t~post0| 4)} is VALID [2020-07-11 02:28:09,865 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-11 02:28:09,865 INFO L280 TraceCheckUtils]: 29: Hoare triple {1354#(<= main_~i~0 5)} havoc #t~post0; {1354#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:09,866 INFO L280 TraceCheckUtils]: 30: Hoare triple {1354#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1354#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:09,866 INFO L280 TraceCheckUtils]: 31: Hoare triple {1354#(<= main_~i~0 5)} assume !(~i~0 < 4); {1354#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:09,867 INFO L280 TraceCheckUtils]: 32: Hoare triple {1354#(<= main_~i~0 5)} #t~post0 := ~i~0; {1355#(<= |main_#t~post0| 5)} is VALID [2020-07-11 02:28:09,868 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-11 02:28:09,868 INFO L280 TraceCheckUtils]: 34: Hoare triple {1356#(<= main_~i~0 6)} havoc #t~post0; {1356#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:09,869 INFO L280 TraceCheckUtils]: 35: Hoare triple {1356#(<= main_~i~0 6)} assume !(~i~0 <= 8); {1343#false} is VALID [2020-07-11 02:28:09,869 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-11 02:28:09,870 INFO L280 TraceCheckUtils]: 37: Hoare triple {1343#false} ~cond := #in~cond; {1343#false} is VALID [2020-07-11 02:28:09,870 INFO L280 TraceCheckUtils]: 38: Hoare triple {1343#false} assume 0 == ~cond; {1343#false} is VALID [2020-07-11 02:28:09,870 INFO L280 TraceCheckUtils]: 39: Hoare triple {1343#false} assume !false; {1343#false} is VALID [2020-07-11 02:28:09,872 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-11 02:28:09,873 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [754039435] [2020-07-11 02:28:09,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:09,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:28:09,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73340453] [2020-07-11 02:28:09,874 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-11 02:28:09,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:09,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:28:09,916 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-11 02:28:09,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:28:09,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:09,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:28:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:28:09,917 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 13 states. [2020-07-11 02:28:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:10,382 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-11 02:28:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-11 02:28:10,382 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-11 02:28:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:28:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2020-07-11 02:28:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:28:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2020-07-11 02:28:10,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 58 transitions. [2020-07-11 02:28:10,454 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-11 02:28:10,455 INFO L225 Difference]: With dead ends: 54 [2020-07-11 02:28:10,455 INFO L226 Difference]: Without dead ends: 49 [2020-07-11 02:28:10,456 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-11 02:28:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-11 02:28:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-07-11 02:28:10,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:10,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2020-07-11 02:28:10,501 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2020-07-11 02:28:10,501 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2020-07-11 02:28:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:10,504 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-11 02:28:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-11 02:28:10,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:10,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:10,505 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2020-07-11 02:28:10,505 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2020-07-11 02:28:10,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:10,507 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-11 02:28:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-11 02:28:10,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:10,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:10,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:10,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-11 02:28:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2020-07-11 02:28:10,510 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 40 [2020-07-11 02:28:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:10,511 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2020-07-11 02:28:10,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:28:10,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 49 transitions. [2020-07-11 02:28:10,562 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-11 02:28:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2020-07-11 02:28:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-07-11 02:28:10,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:10,563 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-11 02:28:10,564 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:28:10,564 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:10,564 INFO L82 PathProgramCache]: Analyzing trace with hash 350505490, now seen corresponding path program 3 times [2020-07-11 02:28:10,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:10,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [255698900] [2020-07-11 02:28:10,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:10,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {1677#true} assume true; {1677#true} is VALID [2020-07-11 02:28:10,761 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1677#true} {1677#true} #42#return; {1677#true} is VALID [2020-07-11 02:28:10,761 INFO L263 TraceCheckUtils]: 0: Hoare triple {1677#true} call ULTIMATE.init(); {1677#true} is VALID [2020-07-11 02:28:10,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {1677#true} assume true; {1677#true} is VALID [2020-07-11 02:28:10,761 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1677#true} {1677#true} #42#return; {1677#true} is VALID [2020-07-11 02:28:10,761 INFO L263 TraceCheckUtils]: 3: Hoare triple {1677#true} call #t~ret1 := main(); {1677#true} is VALID [2020-07-11 02:28:10,762 INFO L280 TraceCheckUtils]: 4: Hoare triple {1677#true} havoc ~i~0; {1677#true} is VALID [2020-07-11 02:28:10,762 INFO L280 TraceCheckUtils]: 5: Hoare triple {1677#true} ~sn~0 := 0; {1677#true} is VALID [2020-07-11 02:28:10,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {1677#true} ~i~0 := 1; {1681#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:10,766 INFO L280 TraceCheckUtils]: 7: Hoare triple {1681#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {1681#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:10,766 INFO L280 TraceCheckUtils]: 8: Hoare triple {1681#(<= main_~i~0 1)} assume ~i~0 < 4; {1681#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:10,767 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-11 02:28:10,767 INFO L280 TraceCheckUtils]: 10: Hoare triple {1681#(<= main_~i~0 1)} #t~post0 := ~i~0; {1682#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:10,768 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-11 02:28:10,769 INFO L280 TraceCheckUtils]: 12: Hoare triple {1683#(<= main_~i~0 2)} havoc #t~post0; {1683#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:10,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {1683#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {1683#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:10,770 INFO L280 TraceCheckUtils]: 14: Hoare triple {1683#(<= main_~i~0 2)} assume ~i~0 < 4; {1683#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:10,775 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-11 02:28:10,775 INFO L280 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~0 2)} #t~post0 := ~i~0; {1684#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:10,776 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-11 02:28:10,777 INFO L280 TraceCheckUtils]: 18: Hoare triple {1685#(<= main_~i~0 3)} havoc #t~post0; {1685#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:10,777 INFO L280 TraceCheckUtils]: 19: Hoare triple {1685#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {1685#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:10,778 INFO L280 TraceCheckUtils]: 20: Hoare triple {1685#(<= main_~i~0 3)} assume ~i~0 < 4; {1685#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:10,778 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-11 02:28:10,779 INFO L280 TraceCheckUtils]: 22: Hoare triple {1685#(<= main_~i~0 3)} #t~post0 := ~i~0; {1686#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:10,779 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-11 02:28:10,780 INFO L280 TraceCheckUtils]: 24: Hoare triple {1687#(<= main_~i~0 4)} havoc #t~post0; {1687#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:10,780 INFO L280 TraceCheckUtils]: 25: Hoare triple {1687#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {1687#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:10,781 INFO L280 TraceCheckUtils]: 26: Hoare triple {1687#(<= main_~i~0 4)} assume !(~i~0 < 4); {1687#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:10,781 INFO L280 TraceCheckUtils]: 27: Hoare triple {1687#(<= main_~i~0 4)} #t~post0 := ~i~0; {1688#(<= |main_#t~post0| 4)} is VALID [2020-07-11 02:28:10,782 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-11 02:28:10,782 INFO L280 TraceCheckUtils]: 29: Hoare triple {1689#(<= main_~i~0 5)} havoc #t~post0; {1689#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:10,782 INFO L280 TraceCheckUtils]: 30: Hoare triple {1689#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {1689#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:10,783 INFO L280 TraceCheckUtils]: 31: Hoare triple {1689#(<= main_~i~0 5)} assume !(~i~0 < 4); {1689#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:10,783 INFO L280 TraceCheckUtils]: 32: Hoare triple {1689#(<= main_~i~0 5)} #t~post0 := ~i~0; {1690#(<= |main_#t~post0| 5)} is VALID [2020-07-11 02:28:10,784 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-11 02:28:10,784 INFO L280 TraceCheckUtils]: 34: Hoare triple {1691#(<= main_~i~0 6)} havoc #t~post0; {1691#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:10,785 INFO L280 TraceCheckUtils]: 35: Hoare triple {1691#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {1691#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:10,785 INFO L280 TraceCheckUtils]: 36: Hoare triple {1691#(<= main_~i~0 6)} assume !(~i~0 < 4); {1691#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:10,787 INFO L280 TraceCheckUtils]: 37: Hoare triple {1691#(<= main_~i~0 6)} #t~post0 := ~i~0; {1692#(<= |main_#t~post0| 6)} is VALID [2020-07-11 02:28:10,788 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-11 02:28:10,788 INFO L280 TraceCheckUtils]: 39: Hoare triple {1693#(<= main_~i~0 7)} havoc #t~post0; {1693#(<= main_~i~0 7)} is VALID [2020-07-11 02:28:10,789 INFO L280 TraceCheckUtils]: 40: Hoare triple {1693#(<= main_~i~0 7)} assume !(~i~0 <= 8); {1678#false} is VALID [2020-07-11 02:28:10,789 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-11 02:28:10,789 INFO L280 TraceCheckUtils]: 42: Hoare triple {1678#false} ~cond := #in~cond; {1678#false} is VALID [2020-07-11 02:28:10,789 INFO L280 TraceCheckUtils]: 43: Hoare triple {1678#false} assume 0 == ~cond; {1678#false} is VALID [2020-07-11 02:28:10,789 INFO L280 TraceCheckUtils]: 44: Hoare triple {1678#false} assume !false; {1678#false} is VALID [2020-07-11 02:28:10,792 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-11 02:28:10,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [255698900] [2020-07-11 02:28:10,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:10,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-11 02:28:10,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491643999] [2020-07-11 02:28:10,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2020-07-11 02:28:10,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:10,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-11 02:28:10,846 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-11 02:28:10,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-11 02:28:10,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:10,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-11 02:28:10,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-11 02:28:10,847 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 15 states. [2020-07-11 02:28:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:11,427 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2020-07-11 02:28:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-11 02:28:11,427 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2020-07-11 02:28:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:28:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 64 transitions. [2020-07-11 02:28:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-11 02:28:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 64 transitions. [2020-07-11 02:28:11,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 64 transitions. [2020-07-11 02:28:11,508 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-11 02:28:11,509 INFO L225 Difference]: With dead ends: 59 [2020-07-11 02:28:11,510 INFO L226 Difference]: Without dead ends: 54 [2020-07-11 02:28:11,510 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-11 02:28:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-11 02:28:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2020-07-11 02:28:11,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:11,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 51 states. [2020-07-11 02:28:11,558 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 51 states. [2020-07-11 02:28:11,558 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 51 states. [2020-07-11 02:28:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:11,560 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-11 02:28:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-11 02:28:11,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:11,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:11,561 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 54 states. [2020-07-11 02:28:11,561 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 54 states. [2020-07-11 02:28:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:11,563 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-11 02:28:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2020-07-11 02:28:11,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:11,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:11,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:11,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-11 02:28:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-07-11 02:28:11,566 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 45 [2020-07-11 02:28:11,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:11,567 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-07-11 02:28:11,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-11 02:28:11,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 55 transitions. [2020-07-11 02:28:11,629 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-11 02:28:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-07-11 02:28:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-11 02:28:11,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:11,630 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-11 02:28:11,630 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:28:11,631 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:11,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:11,631 INFO L82 PathProgramCache]: Analyzing trace with hash -892978821, now seen corresponding path program 4 times [2020-07-11 02:28:11,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:11,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [115467934] [2020-07-11 02:28:11,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:11,862 INFO L280 TraceCheckUtils]: 0: Hoare triple {2048#true} assume true; {2048#true} is VALID [2020-07-11 02:28:11,862 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2048#true} {2048#true} #42#return; {2048#true} is VALID [2020-07-11 02:28:11,863 INFO L263 TraceCheckUtils]: 0: Hoare triple {2048#true} call ULTIMATE.init(); {2048#true} is VALID [2020-07-11 02:28:11,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {2048#true} assume true; {2048#true} is VALID [2020-07-11 02:28:11,863 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2048#true} {2048#true} #42#return; {2048#true} is VALID [2020-07-11 02:28:11,864 INFO L263 TraceCheckUtils]: 3: Hoare triple {2048#true} call #t~ret1 := main(); {2048#true} is VALID [2020-07-11 02:28:11,864 INFO L280 TraceCheckUtils]: 4: Hoare triple {2048#true} havoc ~i~0; {2048#true} is VALID [2020-07-11 02:28:11,864 INFO L280 TraceCheckUtils]: 5: Hoare triple {2048#true} ~sn~0 := 0; {2048#true} is VALID [2020-07-11 02:28:11,865 INFO L280 TraceCheckUtils]: 6: Hoare triple {2048#true} ~i~0 := 1; {2052#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:11,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {2052#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {2052#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:11,866 INFO L280 TraceCheckUtils]: 8: Hoare triple {2052#(<= main_~i~0 1)} assume ~i~0 < 4; {2052#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:11,867 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-11 02:28:11,868 INFO L280 TraceCheckUtils]: 10: Hoare triple {2052#(<= main_~i~0 1)} #t~post0 := ~i~0; {2053#(<= |main_#t~post0| 1)} is VALID [2020-07-11 02:28:11,868 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-11 02:28:11,869 INFO L280 TraceCheckUtils]: 12: Hoare triple {2054#(<= main_~i~0 2)} havoc #t~post0; {2054#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:11,870 INFO L280 TraceCheckUtils]: 13: Hoare triple {2054#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {2054#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:11,870 INFO L280 TraceCheckUtils]: 14: Hoare triple {2054#(<= main_~i~0 2)} assume ~i~0 < 4; {2054#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:11,871 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-11 02:28:11,872 INFO L280 TraceCheckUtils]: 16: Hoare triple {2054#(<= main_~i~0 2)} #t~post0 := ~i~0; {2055#(<= |main_#t~post0| 2)} is VALID [2020-07-11 02:28:11,873 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-11 02:28:11,875 INFO L280 TraceCheckUtils]: 18: Hoare triple {2056#(<= main_~i~0 3)} havoc #t~post0; {2056#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:11,878 INFO L280 TraceCheckUtils]: 19: Hoare triple {2056#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {2056#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:11,881 INFO L280 TraceCheckUtils]: 20: Hoare triple {2056#(<= main_~i~0 3)} assume ~i~0 < 4; {2056#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:11,885 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-11 02:28:11,887 INFO L280 TraceCheckUtils]: 22: Hoare triple {2056#(<= main_~i~0 3)} #t~post0 := ~i~0; {2057#(<= |main_#t~post0| 3)} is VALID [2020-07-11 02:28:11,888 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-11 02:28:11,888 INFO L280 TraceCheckUtils]: 24: Hoare triple {2058#(<= main_~i~0 4)} havoc #t~post0; {2058#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:11,889 INFO L280 TraceCheckUtils]: 25: Hoare triple {2058#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {2058#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:11,889 INFO L280 TraceCheckUtils]: 26: Hoare triple {2058#(<= main_~i~0 4)} assume !(~i~0 < 4); {2058#(<= main_~i~0 4)} is VALID [2020-07-11 02:28:11,890 INFO L280 TraceCheckUtils]: 27: Hoare triple {2058#(<= main_~i~0 4)} #t~post0 := ~i~0; {2059#(<= |main_#t~post0| 4)} is VALID [2020-07-11 02:28:11,891 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-11 02:28:11,891 INFO L280 TraceCheckUtils]: 29: Hoare triple {2060#(<= main_~i~0 5)} havoc #t~post0; {2060#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:11,892 INFO L280 TraceCheckUtils]: 30: Hoare triple {2060#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {2060#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:11,892 INFO L280 TraceCheckUtils]: 31: Hoare triple {2060#(<= main_~i~0 5)} assume !(~i~0 < 4); {2060#(<= main_~i~0 5)} is VALID [2020-07-11 02:28:11,893 INFO L280 TraceCheckUtils]: 32: Hoare triple {2060#(<= main_~i~0 5)} #t~post0 := ~i~0; {2061#(<= |main_#t~post0| 5)} is VALID [2020-07-11 02:28:11,894 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-11 02:28:11,895 INFO L280 TraceCheckUtils]: 34: Hoare triple {2062#(<= main_~i~0 6)} havoc #t~post0; {2062#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:11,895 INFO L280 TraceCheckUtils]: 35: Hoare triple {2062#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {2062#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:11,896 INFO L280 TraceCheckUtils]: 36: Hoare triple {2062#(<= main_~i~0 6)} assume !(~i~0 < 4); {2062#(<= main_~i~0 6)} is VALID [2020-07-11 02:28:11,896 INFO L280 TraceCheckUtils]: 37: Hoare triple {2062#(<= main_~i~0 6)} #t~post0 := ~i~0; {2063#(<= |main_#t~post0| 6)} is VALID [2020-07-11 02:28:11,897 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-11 02:28:11,897 INFO L280 TraceCheckUtils]: 39: Hoare triple {2064#(<= main_~i~0 7)} havoc #t~post0; {2064#(<= main_~i~0 7)} is VALID [2020-07-11 02:28:11,898 INFO L280 TraceCheckUtils]: 40: Hoare triple {2064#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {2064#(<= main_~i~0 7)} is VALID [2020-07-11 02:28:11,898 INFO L280 TraceCheckUtils]: 41: Hoare triple {2064#(<= main_~i~0 7)} assume !(~i~0 < 4); {2064#(<= main_~i~0 7)} is VALID [2020-07-11 02:28:11,899 INFO L280 TraceCheckUtils]: 42: Hoare triple {2064#(<= main_~i~0 7)} #t~post0 := ~i~0; {2065#(<= |main_#t~post0| 7)} is VALID [2020-07-11 02:28:11,900 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-11 02:28:11,900 INFO L280 TraceCheckUtils]: 44: Hoare triple {2066#(<= main_~i~0 8)} havoc #t~post0; {2066#(<= main_~i~0 8)} is VALID [2020-07-11 02:28:11,901 INFO L280 TraceCheckUtils]: 45: Hoare triple {2066#(<= main_~i~0 8)} assume !(~i~0 <= 8); {2049#false} is VALID [2020-07-11 02:28:11,901 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-11 02:28:11,901 INFO L280 TraceCheckUtils]: 47: Hoare triple {2049#false} ~cond := #in~cond; {2049#false} is VALID [2020-07-11 02:28:11,901 INFO L280 TraceCheckUtils]: 48: Hoare triple {2049#false} assume 0 == ~cond; {2049#false} is VALID [2020-07-11 02:28:11,901 INFO L280 TraceCheckUtils]: 49: Hoare triple {2049#false} assume !false; {2049#false} is VALID [2020-07-11 02:28:11,907 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-11 02:28:11,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [115467934] [2020-07-11 02:28:11,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:11,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-11 02:28:11,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954133344] [2020-07-11 02:28:11,913 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2020-07-11 02:28:11,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:11,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-11 02:28:11,965 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-11 02:28:11,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-11 02:28:11,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-11 02:28:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-11 02:28:11,966 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 17 states. [2020-07-11 02:28:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:12,543 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2020-07-11 02:28:12,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-11 02:28:12,543 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2020-07-11 02:28:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:28:12,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2020-07-11 02:28:12,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-11 02:28:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2020-07-11 02:28:12,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 66 transitions. [2020-07-11 02:28:12,614 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-11 02:28:12,617 INFO L225 Difference]: With dead ends: 61 [2020-07-11 02:28:12,617 INFO L226 Difference]: Without dead ends: 56 [2020-07-11 02:28:12,618 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-11 02:28:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-11 02:28:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-11 02:28:12,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:12,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-11 02:28:12,668 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-11 02:28:12,668 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-11 02:28:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:12,674 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-11 02:28:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-11 02:28:12,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:12,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:12,675 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-11 02:28:12,675 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-11 02:28:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:12,681 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2020-07-11 02:28:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-11 02:28:12,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:12,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:12,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:12,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-11 02:28:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2020-07-11 02:28:12,684 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2020-07-11 02:28:12,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:12,685 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2020-07-11 02:28:12,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-11 02:28:12,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2020-07-11 02:28:12,749 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-11 02:28:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2020-07-11 02:28:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-11 02:28:12,750 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:12,751 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-11 02:28:12,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-11 02:28:12,751 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash 586056626, now seen corresponding path program 5 times [2020-07-11 02:28:12,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:12,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316980872] [2020-07-11 02:28:12,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:12,803 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 02:28:12,803 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:28:12,804 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-11 02:28:12,829 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:28:12,830 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:28:12,831 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:28:12,831 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:28:12,831 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:12,831 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:12,831 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-11 02:28:12,831 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:12,831 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:12,831 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:12,831 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:28:12,832 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-11 02:28:12,832 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-11 02:28:12,832 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 02:28:12,832 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 02:28:12,832 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:28:12,833 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 02:28:12,833 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:28:12,833 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:28:12,833 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-11 02:28:12,833 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-11 02:28:12,833 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-11 02:28:12,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:28:12 BoogieIcfgContainer [2020-07-11 02:28:12,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:28:12,840 INFO L168 Benchmark]: Toolchain (without parser) took 7203.44 ms. Allocated memory was 135.8 MB in the beginning and 313.0 MB in the end (delta: 177.2 MB). Free memory was 99.4 MB in the beginning and 185.7 MB in the end (delta: -86.3 MB). Peak memory consumption was 90.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:12,840 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.8 MB. Free memory was 118.0 MB in the beginning and 117.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:28:12,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.02 ms. Allocated memory is still 135.8 MB. Free memory was 99.1 MB in the beginning and 89.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:12,841 INFO L168 Benchmark]: Boogie Preprocessor took 127.97 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 89.6 MB in the beginning and 179.3 MB in the end (delta: -89.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:12,842 INFO L168 Benchmark]: RCFGBuilder took 300.18 ms. Allocated memory is still 200.8 MB. Free memory was 179.3 MB in the beginning and 164.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:12,842 INFO L168 Benchmark]: TraceAbstraction took 6529.01 ms. Allocated memory was 200.8 MB in the beginning and 313.0 MB in the end (delta: 112.2 MB). Free memory was 163.9 MB in the beginning and 185.7 MB in the end (delta: -21.7 MB). Peak memory consumption was 90.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:12,845 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.25 ms. Allocated memory is still 135.8 MB. Free memory was 118.0 MB in the beginning and 117.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 241.02 ms. Allocated memory is still 135.8 MB. Free memory was 99.1 MB in the beginning and 89.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.97 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 89.6 MB in the beginning and 179.3 MB in the end (delta: -89.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 300.18 ms. Allocated memory is still 200.8 MB. Free memory was 179.3 MB in the beginning and 164.6 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6529.01 ms. Allocated memory was 200.8 MB in the beginning and 313.0 MB in the end (delta: 112.2 MB). Free memory was 163.9 MB in the beginning and 185.7 MB in the end (delta: -21.7 MB). Peak memory consumption was 90.5 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.4s, OverallIterations: 10, TraceHistogramMax: 8, AutomataDifference: 3.5s, 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.5s 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.2s 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...