/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/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:34:07,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:34:07,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:34:07,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:34:07,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:34:07,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:34:07,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:34:07,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:34:07,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:34:07,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:34:07,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:34:07,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:34:07,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:34:07,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:34:07,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:34:07,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:34:07,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:34:07,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:34:07,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:34:07,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:34:07,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:34:07,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:34:07,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:34:07,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:34:07,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:34:07,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:34:07,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:34:07,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:34:07,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:34:07,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:34:07,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:34:07,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:34:07,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:34:07,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:34:07,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:34:07,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:34:07,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:34:07,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:34:07,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:34:07,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:34:07,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:34:07,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 06:34:07,440 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:34:07,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:34:07,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:34:07,443 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:34:07,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:34:07,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:34:07,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:34:07,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:34:07,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:34:07,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:34:07,446 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:34:07,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:34:07,446 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:34:07,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:34:07,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:34:07,447 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:34:07,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:34:07,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:34:07,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:34:07,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:34:07,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:34:07,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:34:07,449 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-18 06:34:07,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:34:07,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:34:07,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:34:07,776 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:34:07,776 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:34:07,777 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2020-07-18 06:34:07,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c474da69/26f77f4460f6473aa44215cc48b412ec/FLAG00105fb65 [2020-07-18 06:34:08,353 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:34:08,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2020-07-18 06:34:08,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c474da69/26f77f4460f6473aa44215cc48b412ec/FLAG00105fb65 [2020-07-18 06:34:08,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c474da69/26f77f4460f6473aa44215cc48b412ec [2020-07-18 06:34:08,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:34:08,692 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:34:08,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:34:08,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:34:08,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:34:08,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:34:08" (1/1) ... [2020-07-18 06:34:08,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ba6efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:08, skipping insertion in model container [2020-07-18 06:34:08,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:34:08" (1/1) ... [2020-07-18 06:34:08,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:34:08,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:34:08,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:34:08,966 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:34:08,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:34:09,001 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:34:09,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09 WrapperNode [2020-07-18 06:34:09,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:34:09,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:34:09,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:34:09,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:34:09,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09" (1/1) ... [2020-07-18 06:34:09,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09" (1/1) ... [2020-07-18 06:34:09,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09" (1/1) ... [2020-07-18 06:34:09,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09" (1/1) ... [2020-07-18 06:34:09,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09" (1/1) ... [2020-07-18 06:34:09,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09" (1/1) ... [2020-07-18 06:34:09,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09" (1/1) ... [2020-07-18 06:34:09,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:34:09,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:34:09,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:34:09,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:34:09,133 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09" (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-18 06:34:09,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:34:09,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:34:09,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:34:09,206 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:34:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:34:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:34:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-18 06:34:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:34:09,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:34:09,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:34:09,469 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:34:09,470 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 06:34:09,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:34:09 BoogieIcfgContainer [2020-07-18 06:34:09,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:34:09,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:34:09,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:34:09,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:34:09,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:34:08" (1/3) ... [2020-07-18 06:34:09,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae421ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:34:09, skipping insertion in model container [2020-07-18 06:34:09,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:34:09" (2/3) ... [2020-07-18 06:34:09,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae421ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:34:09, skipping insertion in model container [2020-07-18 06:34:09,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:34:09" (3/3) ... [2020-07-18 06:34:09,512 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2020-07-18 06:34:09,543 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:34:09,562 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:34:09,605 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:34:09,638 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:34:09,638 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:34:09,639 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:34:09,639 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:34:09,640 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:34:09,640 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:34:09,640 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:34:09,640 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:34:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-18 06:34:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 06:34:09,675 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:09,677 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:09,677 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:09,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:09,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1882057920, now seen corresponding path program 1 times [2020-07-18 06:34:09,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:09,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1483955971] [2020-07-18 06:34:09,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:09,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-18 06:34:09,871 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-18 06:34:09,873 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-18 06:34:09,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-18 06:34:09,875 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-18 06:34:09,875 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret2 := main(); {29#true} is VALID [2020-07-18 06:34:09,875 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} havoc ~i~0; {29#true} is VALID [2020-07-18 06:34:09,876 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {29#true} is VALID [2020-07-18 06:34:09,876 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} havoc #t~nondet0; {29#true} is VALID [2020-07-18 06:34:09,877 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#true} ~sn~0 := 0; {29#true} is VALID [2020-07-18 06:34:09,877 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#true} ~i~0 := 1; {29#true} is VALID [2020-07-18 06:34:09,882 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#true} assume !true; {30#false} is VALID [2020-07-18 06:34:09,882 INFO L263 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {30#false} is VALID [2020-07-18 06:34:09,883 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2020-07-18 06:34:09,883 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2020-07-18 06:34:09,884 INFO L280 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-18 06:34:09,885 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-18 06:34:09,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1483955971] [2020-07-18 06:34:09,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:09,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 06:34:09,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659133233] [2020-07-18 06:34:09,903 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 06:34:09,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:09,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 06:34:09,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:09,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 06:34:09,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 06:34:09,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 06:34:09,967 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2020-07-18 06:34:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:10,087 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-18 06:34:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 06:34:10,088 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 06:34:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:34:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-18 06:34:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 06:34:10,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-18 06:34:10,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 41 transitions. [2020-07-18 06:34:10,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:10,209 INFO L225 Difference]: With dead ends: 37 [2020-07-18 06:34:10,209 INFO L226 Difference]: Without dead ends: 20 [2020-07-18 06:34:10,215 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-18 06:34:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-18 06:34:10,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-18 06:34:10,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:10,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-18 06:34:10,284 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-18 06:34:10,285 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-18 06:34:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:10,290 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-18 06:34:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-18 06:34:10,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:10,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:10,292 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-18 06:34:10,292 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-18 06:34:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:10,297 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-18 06:34:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-18 06:34:10,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:10,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:10,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:10,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-18 06:34:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-18 06:34:10,304 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2020-07-18 06:34:10,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:10,305 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-18 06:34:10,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 06:34:10,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2020-07-18 06:34:10,347 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-18 06:34:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-18 06:34:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 06:34:10,348 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:10,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:10,349 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:34:10,350 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:10,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1869128626, now seen corresponding path program 1 times [2020-07-18 06:34:10,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:10,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2061150560] [2020-07-18 06:34:10,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:10,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-18 06:34:10,496 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-18 06:34:10,496 INFO L263 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2020-07-18 06:34:10,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-18 06:34:10,497 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-18 06:34:10,497 INFO L263 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2020-07-18 06:34:10,497 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-18 06:34:10,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {189#true} is VALID [2020-07-18 06:34:10,498 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} havoc #t~nondet0; {189#true} is VALID [2020-07-18 06:34:10,499 INFO L280 TraceCheckUtils]: 7: Hoare triple {189#true} ~sn~0 := 0; {193#(= 0 main_~sn~0)} is VALID [2020-07-18 06:34:10,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {193#(= 0 main_~sn~0)} ~i~0 := 1; {193#(= 0 main_~sn~0)} is VALID [2020-07-18 06:34:10,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {193#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {193#(= 0 main_~sn~0)} is VALID [2020-07-18 06:34:10,505 INFO L263 TraceCheckUtils]: 10: Hoare triple {193#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:10,507 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {195#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:10,509 INFO L280 TraceCheckUtils]: 12: Hoare triple {195#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {190#false} is VALID [2020-07-18 06:34:10,509 INFO L280 TraceCheckUtils]: 13: Hoare triple {190#false} assume !false; {190#false} is VALID [2020-07-18 06:34:10,511 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-18 06:34:10,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2061150560] [2020-07-18 06:34:10,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:34:10,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:34:10,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48459112] [2020-07-18 06:34:10,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 06:34:10,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:10,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:34:10,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:10,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:34:10,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:10,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:34:10,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:34:10,544 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2020-07-18 06:34:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:10,707 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-18 06:34:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 06:34:10,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 06:34:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-18 06:34:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:10,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-18 06:34:10,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-18 06:34:10,781 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-18 06:34:10,783 INFO L225 Difference]: With dead ends: 31 [2020-07-18 06:34:10,784 INFO L226 Difference]: Without dead ends: 26 [2020-07-18 06:34:10,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:34:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-18 06:34:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-18 06:34:10,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:10,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-18 06:34:10,812 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-18 06:34:10,813 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-18 06:34:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:10,816 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-18 06:34:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-18 06:34:10,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:10,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:10,817 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-18 06:34:10,818 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-18 06:34:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:10,820 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-18 06:34:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-18 06:34:10,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:10,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:10,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:10,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-18 06:34:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-18 06:34:10,825 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2020-07-18 06:34:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:10,825 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-18 06:34:10,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:34:10,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-18 06:34:10,870 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-18 06:34:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-18 06:34:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 06:34:10,872 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:10,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:10,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:34:10,873 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:10,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1535432394, now seen corresponding path program 1 times [2020-07-18 06:34:10,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:10,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1502367060] [2020-07-18 06:34:10,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:11,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-18 06:34:11,399 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-18 06:34:11,399 INFO L263 TraceCheckUtils]: 0: Hoare triple {364#true} call ULTIMATE.init(); {364#true} is VALID [2020-07-18 06:34:11,400 INFO L280 TraceCheckUtils]: 1: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-18 06:34:11,400 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-18 06:34:11,400 INFO L263 TraceCheckUtils]: 3: Hoare triple {364#true} call #t~ret2 := main(); {364#true} is VALID [2020-07-18 06:34:11,401 INFO L280 TraceCheckUtils]: 4: Hoare triple {364#true} havoc ~i~0; {364#true} is VALID [2020-07-18 06:34:11,401 INFO L280 TraceCheckUtils]: 5: Hoare triple {364#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {364#true} is VALID [2020-07-18 06:34:11,401 INFO L280 TraceCheckUtils]: 6: Hoare triple {364#true} havoc #t~nondet0; {364#true} is VALID [2020-07-18 06:34:11,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#true} ~sn~0 := 0; {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 06:34:11,404 INFO L280 TraceCheckUtils]: 8: Hoare triple {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:11,405 INFO L280 TraceCheckUtils]: 9: Hoare triple {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:11,407 INFO L280 TraceCheckUtils]: 10: Hoare triple {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10; {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:11,409 INFO L280 TraceCheckUtils]: 11: Hoare triple {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {371#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:11,410 INFO L280 TraceCheckUtils]: 12: Hoare triple {371#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0; {372#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-18 06:34:11,412 INFO L280 TraceCheckUtils]: 13: Hoare triple {372#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:11,413 INFO L280 TraceCheckUtils]: 14: Hoare triple {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:11,414 INFO L280 TraceCheckUtils]: 15: Hoare triple {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {374#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-18 06:34:11,416 INFO L263 TraceCheckUtils]: 16: Hoare triple {374#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {375#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:11,417 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {376#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:11,418 INFO L280 TraceCheckUtils]: 18: Hoare triple {376#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {365#false} is VALID [2020-07-18 06:34:11,419 INFO L280 TraceCheckUtils]: 19: Hoare triple {365#false} assume !false; {365#false} is VALID [2020-07-18 06:34:11,421 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-18 06:34:11,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1502367060] [2020-07-18 06:34:11,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:11,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 06:34:11,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044530236] [2020-07-18 06:34:11,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-18 06:34:11,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:11,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 06:34:11,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:11,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 06:34:11,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 06:34:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-18 06:34:11,458 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 11 states. [2020-07-18 06:34:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:12,206 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-18 06:34:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 06:34:12,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-18 06:34:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2020-07-18 06:34:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2020-07-18 06:34:12,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 50 transitions. [2020-07-18 06:34:12,279 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-18 06:34:12,281 INFO L225 Difference]: With dead ends: 50 [2020-07-18 06:34:12,282 INFO L226 Difference]: Without dead ends: 31 [2020-07-18 06:34:12,283 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-18 06:34:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-18 06:34:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-07-18 06:34:12,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:12,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 27 states. [2020-07-18 06:34:12,332 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 27 states. [2020-07-18 06:34:12,332 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 27 states. [2020-07-18 06:34:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:12,335 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-18 06:34:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-18 06:34:12,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:12,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:12,336 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 31 states. [2020-07-18 06:34:12,337 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 31 states. [2020-07-18 06:34:12,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:12,339 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-18 06:34:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-18 06:34:12,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:12,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:12,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:12,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-18 06:34:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-18 06:34:12,343 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2020-07-18 06:34:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:12,343 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-18 06:34:12,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 06:34:12,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2020-07-18 06:34:12,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:12,375 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-18 06:34:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-18 06:34:12,376 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:12,376 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:12,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:34:12,377 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:12,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:12,377 INFO L82 PathProgramCache]: Analyzing trace with hash -927596731, now seen corresponding path program 1 times [2020-07-18 06:34:12,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:12,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1920083972] [2020-07-18 06:34:12,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:12,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {605#true} assume true; {605#true} is VALID [2020-07-18 06:34:12,455 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {605#true} {605#true} #44#return; {605#true} is VALID [2020-07-18 06:34:12,455 INFO L263 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2020-07-18 06:34:12,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2020-07-18 06:34:12,456 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #44#return; {605#true} is VALID [2020-07-18 06:34:12,456 INFO L263 TraceCheckUtils]: 3: Hoare triple {605#true} call #t~ret2 := main(); {605#true} is VALID [2020-07-18 06:34:12,456 INFO L280 TraceCheckUtils]: 4: Hoare triple {605#true} havoc ~i~0; {605#true} is VALID [2020-07-18 06:34:12,457 INFO L280 TraceCheckUtils]: 5: Hoare triple {605#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {605#true} is VALID [2020-07-18 06:34:12,457 INFO L280 TraceCheckUtils]: 6: Hoare triple {605#true} havoc #t~nondet0; {605#true} is VALID [2020-07-18 06:34:12,457 INFO L280 TraceCheckUtils]: 7: Hoare triple {605#true} ~sn~0 := 0; {605#true} is VALID [2020-07-18 06:34:12,460 INFO L280 TraceCheckUtils]: 8: Hoare triple {605#true} ~i~0 := 1; {609#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:12,460 INFO L280 TraceCheckUtils]: 9: Hoare triple {609#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {609#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:12,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {609#(<= main_~i~0 1)} assume ~i~0 < 10; {609#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:12,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {609#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {609#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:12,462 INFO L280 TraceCheckUtils]: 12: Hoare triple {609#(<= main_~i~0 1)} #t~post1 := ~i~0; {610#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:12,466 INFO L280 TraceCheckUtils]: 13: Hoare triple {610#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {611#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:12,467 INFO L280 TraceCheckUtils]: 14: Hoare triple {611#(<= main_~i~0 2)} havoc #t~post1; {611#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:12,467 INFO L280 TraceCheckUtils]: 15: Hoare triple {611#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {611#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:12,468 INFO L280 TraceCheckUtils]: 16: Hoare triple {611#(<= main_~i~0 2)} assume !(~i~0 < 10); {606#false} is VALID [2020-07-18 06:34:12,468 INFO L280 TraceCheckUtils]: 17: Hoare triple {606#false} #t~post1 := ~i~0; {606#false} is VALID [2020-07-18 06:34:12,469 INFO L280 TraceCheckUtils]: 18: Hoare triple {606#false} ~i~0 := 1 + #t~post1; {606#false} is VALID [2020-07-18 06:34:12,469 INFO L280 TraceCheckUtils]: 19: Hoare triple {606#false} havoc #t~post1; {606#false} is VALID [2020-07-18 06:34:12,469 INFO L280 TraceCheckUtils]: 20: Hoare triple {606#false} assume !(~i~0 <= ~n~0); {606#false} is VALID [2020-07-18 06:34:12,469 INFO L263 TraceCheckUtils]: 21: Hoare triple {606#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {606#false} is VALID [2020-07-18 06:34:12,469 INFO L280 TraceCheckUtils]: 22: Hoare triple {606#false} ~cond := #in~cond; {606#false} is VALID [2020-07-18 06:34:12,470 INFO L280 TraceCheckUtils]: 23: Hoare triple {606#false} assume 0 == ~cond; {606#false} is VALID [2020-07-18 06:34:12,470 INFO L280 TraceCheckUtils]: 24: Hoare triple {606#false} assume !false; {606#false} is VALID [2020-07-18 06:34:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:12,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1920083972] [2020-07-18 06:34:12,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:12,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-18 06:34:12,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71516014] [2020-07-18 06:34:12,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-18 06:34:12,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:12,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:34:12,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:12,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:34:12,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:12,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:34:12,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:34:12,538 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2020-07-18 06:34:12,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:12,737 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2020-07-18 06:34:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 06:34:12,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-18 06:34:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-18 06:34:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:34:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-18 06:34:12,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2020-07-18 06:34:12,787 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-18 06:34:12,788 INFO L225 Difference]: With dead ends: 42 [2020-07-18 06:34:12,789 INFO L226 Difference]: Without dead ends: 31 [2020-07-18 06:34:12,790 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-18 06:34:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-18 06:34:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-18 06:34:12,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:12,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-18 06:34:12,839 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-18 06:34:12,839 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-18 06:34:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:12,842 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-18 06:34:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-18 06:34:12,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:12,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:12,843 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-18 06:34:12,844 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-18 06:34:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:12,846 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-18 06:34:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-18 06:34:12,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:12,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:12,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:12,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 06:34:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-18 06:34:12,850 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2020-07-18 06:34:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:12,850 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-18 06:34:12,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:34:12,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-18 06:34:12,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-18 06:34:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-18 06:34:12,886 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:12,886 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:12,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 06:34:12,887 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1778100254, now seen corresponding path program 2 times [2020-07-18 06:34:12,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:12,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [947177656] [2020-07-18 06:34:12,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:13,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {820#true} assume true; {820#true} is VALID [2020-07-18 06:34:13,362 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {820#true} {820#true} #44#return; {820#true} is VALID [2020-07-18 06:34:13,362 INFO L263 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2020-07-18 06:34:13,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2020-07-18 06:34:13,363 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #44#return; {820#true} is VALID [2020-07-18 06:34:13,363 INFO L263 TraceCheckUtils]: 3: Hoare triple {820#true} call #t~ret2 := main(); {820#true} is VALID [2020-07-18 06:34:13,364 INFO L280 TraceCheckUtils]: 4: Hoare triple {820#true} havoc ~i~0; {820#true} is VALID [2020-07-18 06:34:13,364 INFO L280 TraceCheckUtils]: 5: Hoare triple {820#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {820#true} is VALID [2020-07-18 06:34:13,364 INFO L280 TraceCheckUtils]: 6: Hoare triple {820#true} havoc #t~nondet0; {820#true} is VALID [2020-07-18 06:34:13,366 INFO L280 TraceCheckUtils]: 7: Hoare triple {820#true} ~sn~0 := 0; {824#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-18 06:34:13,368 INFO L280 TraceCheckUtils]: 8: Hoare triple {824#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:13,372 INFO L280 TraceCheckUtils]: 9: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:13,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:13,374 INFO L280 TraceCheckUtils]: 11: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {826#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-18 06:34:13,375 INFO L280 TraceCheckUtils]: 12: Hoare triple {826#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0; {827#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} is VALID [2020-07-18 06:34:13,377 INFO L280 TraceCheckUtils]: 13: Hoare triple {827#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} ~i~0 := 1 + #t~post1; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:13,378 INFO L280 TraceCheckUtils]: 14: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} havoc #t~post1; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:13,379 INFO L280 TraceCheckUtils]: 15: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:13,382 INFO L280 TraceCheckUtils]: 16: Hoare triple {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10; {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-18 06:34:13,383 INFO L280 TraceCheckUtils]: 17: Hoare triple {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {829#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-18 06:34:13,384 INFO L280 TraceCheckUtils]: 18: Hoare triple {829#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0; {830#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-18 06:34:13,385 INFO L280 TraceCheckUtils]: 19: Hoare triple {830#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {831#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:13,386 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {831#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-18 06:34:13,390 INFO L280 TraceCheckUtils]: 21: Hoare triple {831#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {832#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-18 06:34:13,394 INFO L263 TraceCheckUtils]: 22: Hoare triple {832#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {833#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 06:34:13,394 INFO L280 TraceCheckUtils]: 23: Hoare triple {833#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {834#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 06:34:13,395 INFO L280 TraceCheckUtils]: 24: Hoare triple {834#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {821#false} is VALID [2020-07-18 06:34:13,396 INFO L280 TraceCheckUtils]: 25: Hoare triple {821#false} assume !false; {821#false} is VALID [2020-07-18 06:34:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-18 06:34:13,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [947177656] [2020-07-18 06:34:13,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:13,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 06:34:13,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467740155] [2020-07-18 06:34:13,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-18 06:34:13,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:13,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 06:34:13,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:13,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 06:34:13,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 06:34:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-18 06:34:13,444 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2020-07-18 06:34:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:14,276 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-18 06:34:14,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-18 06:34:14,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-18 06:34:14,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2020-07-18 06:34:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2020-07-18 06:34:14,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 38 transitions. [2020-07-18 06:34:14,335 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-18 06:34:14,337 INFO L225 Difference]: With dead ends: 41 [2020-07-18 06:34:14,337 INFO L226 Difference]: Without dead ends: 36 [2020-07-18 06:34:14,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2020-07-18 06:34:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-18 06:34:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-07-18 06:34:14,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:14,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2020-07-18 06:34:14,409 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2020-07-18 06:34:14,409 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2020-07-18 06:34:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:14,412 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-18 06:34:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-18 06:34:14,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:14,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:14,413 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2020-07-18 06:34:14,413 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2020-07-18 06:34:14,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:14,415 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-18 06:34:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-18 06:34:14,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:14,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:14,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:14,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-18 06:34:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-18 06:34:14,419 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 26 [2020-07-18 06:34:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:14,420 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-18 06:34:14,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 06:34:14,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2020-07-18 06:34:14,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-18 06:34:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 06:34:14,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:14,471 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:14,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 06:34:14,471 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:14,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1884066515, now seen corresponding path program 2 times [2020-07-18 06:34:14,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:14,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1731074479] [2020-07-18 06:34:14,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:14,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {1077#true} assume true; {1077#true} is VALID [2020-07-18 06:34:14,574 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1077#true} {1077#true} #44#return; {1077#true} is VALID [2020-07-18 06:34:14,575 INFO L263 TraceCheckUtils]: 0: Hoare triple {1077#true} call ULTIMATE.init(); {1077#true} is VALID [2020-07-18 06:34:14,575 INFO L280 TraceCheckUtils]: 1: Hoare triple {1077#true} assume true; {1077#true} is VALID [2020-07-18 06:34:14,575 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1077#true} {1077#true} #44#return; {1077#true} is VALID [2020-07-18 06:34:14,575 INFO L263 TraceCheckUtils]: 3: Hoare triple {1077#true} call #t~ret2 := main(); {1077#true} is VALID [2020-07-18 06:34:14,576 INFO L280 TraceCheckUtils]: 4: Hoare triple {1077#true} havoc ~i~0; {1077#true} is VALID [2020-07-18 06:34:14,576 INFO L280 TraceCheckUtils]: 5: Hoare triple {1077#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1077#true} is VALID [2020-07-18 06:34:14,576 INFO L280 TraceCheckUtils]: 6: Hoare triple {1077#true} havoc #t~nondet0; {1077#true} is VALID [2020-07-18 06:34:14,576 INFO L280 TraceCheckUtils]: 7: Hoare triple {1077#true} ~sn~0 := 0; {1077#true} is VALID [2020-07-18 06:34:14,577 INFO L280 TraceCheckUtils]: 8: Hoare triple {1077#true} ~i~0 := 1; {1081#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:14,577 INFO L280 TraceCheckUtils]: 9: Hoare triple {1081#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1081#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:14,579 INFO L280 TraceCheckUtils]: 10: Hoare triple {1081#(<= main_~i~0 1)} assume ~i~0 < 10; {1081#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:14,580 INFO L280 TraceCheckUtils]: 11: Hoare triple {1081#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1081#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:14,582 INFO L280 TraceCheckUtils]: 12: Hoare triple {1081#(<= main_~i~0 1)} #t~post1 := ~i~0; {1082#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:14,584 INFO L280 TraceCheckUtils]: 13: Hoare triple {1082#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1083#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:14,588 INFO L280 TraceCheckUtils]: 14: Hoare triple {1083#(<= main_~i~0 2)} havoc #t~post1; {1083#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:14,589 INFO L280 TraceCheckUtils]: 15: Hoare triple {1083#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1083#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:14,589 INFO L280 TraceCheckUtils]: 16: Hoare triple {1083#(<= main_~i~0 2)} assume ~i~0 < 10; {1083#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:14,590 INFO L280 TraceCheckUtils]: 17: Hoare triple {1083#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1083#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:14,591 INFO L280 TraceCheckUtils]: 18: Hoare triple {1083#(<= main_~i~0 2)} #t~post1 := ~i~0; {1084#(<= |main_#t~post1| 2)} is VALID [2020-07-18 06:34:14,592 INFO L280 TraceCheckUtils]: 19: Hoare triple {1084#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1085#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:14,593 INFO L280 TraceCheckUtils]: 20: Hoare triple {1085#(<= main_~i~0 3)} havoc #t~post1; {1085#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:14,594 INFO L280 TraceCheckUtils]: 21: Hoare triple {1085#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1085#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:14,595 INFO L280 TraceCheckUtils]: 22: Hoare triple {1085#(<= main_~i~0 3)} assume !(~i~0 < 10); {1078#false} is VALID [2020-07-18 06:34:14,596 INFO L280 TraceCheckUtils]: 23: Hoare triple {1078#false} #t~post1 := ~i~0; {1078#false} is VALID [2020-07-18 06:34:14,596 INFO L280 TraceCheckUtils]: 24: Hoare triple {1078#false} ~i~0 := 1 + #t~post1; {1078#false} is VALID [2020-07-18 06:34:14,596 INFO L280 TraceCheckUtils]: 25: Hoare triple {1078#false} havoc #t~post1; {1078#false} is VALID [2020-07-18 06:34:14,596 INFO L280 TraceCheckUtils]: 26: Hoare triple {1078#false} assume !(~i~0 <= ~n~0); {1078#false} is VALID [2020-07-18 06:34:14,596 INFO L263 TraceCheckUtils]: 27: Hoare triple {1078#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1078#false} is VALID [2020-07-18 06:34:14,597 INFO L280 TraceCheckUtils]: 28: Hoare triple {1078#false} ~cond := #in~cond; {1078#false} is VALID [2020-07-18 06:34:14,597 INFO L280 TraceCheckUtils]: 29: Hoare triple {1078#false} assume 0 == ~cond; {1078#false} is VALID [2020-07-18 06:34:14,597 INFO L280 TraceCheckUtils]: 30: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2020-07-18 06:34:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:14,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1731074479] [2020-07-18 06:34:14,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:14,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-18 06:34:14,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132812180] [2020-07-18 06:34:14,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-18 06:34:14,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:14,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 06:34:14,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:14,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 06:34:14,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:14,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 06:34:14,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-18 06:34:14,641 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 7 states. [2020-07-18 06:34:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:14,894 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-18 06:34:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-18 06:34:14,895 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-18 06:34:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:34:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-18 06:34:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 06:34:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-18 06:34:14,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-18 06:34:14,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:14,958 INFO L225 Difference]: With dead ends: 54 [2020-07-18 06:34:14,958 INFO L226 Difference]: Without dead ends: 43 [2020-07-18 06:34:14,959 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-18 06:34:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-18 06:34:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-07-18 06:34:15,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:15,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 40 states. [2020-07-18 06:34:15,058 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 40 states. [2020-07-18 06:34:15,058 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 40 states. [2020-07-18 06:34:15,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:15,060 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-18 06:34:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-18 06:34:15,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:15,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:15,062 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 43 states. [2020-07-18 06:34:15,062 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 43 states. [2020-07-18 06:34:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:15,064 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-18 06:34:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-18 06:34:15,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:15,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:15,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:15,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-18 06:34:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2020-07-18 06:34:15,068 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 31 [2020-07-18 06:34:15,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:15,069 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2020-07-18 06:34:15,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 06:34:15,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2020-07-18 06:34:15,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-18 06:34:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-18 06:34:15,129 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:15,129 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:15,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 06:34:15,130 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:15,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:15,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1557187861, now seen corresponding path program 3 times [2020-07-18 06:34:15,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:15,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2089887429] [2020-07-18 06:34:15,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:15,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:15,269 INFO L280 TraceCheckUtils]: 0: Hoare triple {1370#true} assume true; {1370#true} is VALID [2020-07-18 06:34:15,270 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1370#true} {1370#true} #44#return; {1370#true} is VALID [2020-07-18 06:34:15,270 INFO L263 TraceCheckUtils]: 0: Hoare triple {1370#true} call ULTIMATE.init(); {1370#true} is VALID [2020-07-18 06:34:15,270 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#true} assume true; {1370#true} is VALID [2020-07-18 06:34:15,270 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1370#true} {1370#true} #44#return; {1370#true} is VALID [2020-07-18 06:34:15,271 INFO L263 TraceCheckUtils]: 3: Hoare triple {1370#true} call #t~ret2 := main(); {1370#true} is VALID [2020-07-18 06:34:15,271 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#true} havoc ~i~0; {1370#true} is VALID [2020-07-18 06:34:15,271 INFO L280 TraceCheckUtils]: 5: Hoare triple {1370#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1370#true} is VALID [2020-07-18 06:34:15,271 INFO L280 TraceCheckUtils]: 6: Hoare triple {1370#true} havoc #t~nondet0; {1370#true} is VALID [2020-07-18 06:34:15,271 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#true} ~sn~0 := 0; {1370#true} is VALID [2020-07-18 06:34:15,273 INFO L280 TraceCheckUtils]: 8: Hoare triple {1370#true} ~i~0 := 1; {1374#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:15,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {1374#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1374#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:15,276 INFO L280 TraceCheckUtils]: 10: Hoare triple {1374#(<= main_~i~0 1)} assume ~i~0 < 10; {1374#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:15,277 INFO L280 TraceCheckUtils]: 11: Hoare triple {1374#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1374#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:15,277 INFO L280 TraceCheckUtils]: 12: Hoare triple {1374#(<= main_~i~0 1)} #t~post1 := ~i~0; {1375#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:15,278 INFO L280 TraceCheckUtils]: 13: Hoare triple {1375#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1376#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:15,279 INFO L280 TraceCheckUtils]: 14: Hoare triple {1376#(<= main_~i~0 2)} havoc #t~post1; {1376#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:15,286 INFO L280 TraceCheckUtils]: 15: Hoare triple {1376#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1376#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:15,286 INFO L280 TraceCheckUtils]: 16: Hoare triple {1376#(<= main_~i~0 2)} assume ~i~0 < 10; {1376#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:15,287 INFO L280 TraceCheckUtils]: 17: Hoare triple {1376#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1376#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:15,287 INFO L280 TraceCheckUtils]: 18: Hoare triple {1376#(<= main_~i~0 2)} #t~post1 := ~i~0; {1377#(<= |main_#t~post1| 2)} is VALID [2020-07-18 06:34:15,288 INFO L280 TraceCheckUtils]: 19: Hoare triple {1377#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1378#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:15,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {1378#(<= main_~i~0 3)} havoc #t~post1; {1378#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:15,290 INFO L280 TraceCheckUtils]: 21: Hoare triple {1378#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1378#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:15,291 INFO L280 TraceCheckUtils]: 22: Hoare triple {1378#(<= main_~i~0 3)} assume ~i~0 < 10; {1378#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:15,291 INFO L280 TraceCheckUtils]: 23: Hoare triple {1378#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1378#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:15,292 INFO L280 TraceCheckUtils]: 24: Hoare triple {1378#(<= main_~i~0 3)} #t~post1 := ~i~0; {1379#(<= |main_#t~post1| 3)} is VALID [2020-07-18 06:34:15,293 INFO L280 TraceCheckUtils]: 25: Hoare triple {1379#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {1380#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:15,293 INFO L280 TraceCheckUtils]: 26: Hoare triple {1380#(<= main_~i~0 4)} havoc #t~post1; {1380#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:15,294 INFO L280 TraceCheckUtils]: 27: Hoare triple {1380#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1380#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:15,295 INFO L280 TraceCheckUtils]: 28: Hoare triple {1380#(<= main_~i~0 4)} assume !(~i~0 < 10); {1371#false} is VALID [2020-07-18 06:34:15,295 INFO L280 TraceCheckUtils]: 29: Hoare triple {1371#false} #t~post1 := ~i~0; {1371#false} is VALID [2020-07-18 06:34:15,295 INFO L280 TraceCheckUtils]: 30: Hoare triple {1371#false} ~i~0 := 1 + #t~post1; {1371#false} is VALID [2020-07-18 06:34:15,296 INFO L280 TraceCheckUtils]: 31: Hoare triple {1371#false} havoc #t~post1; {1371#false} is VALID [2020-07-18 06:34:15,296 INFO L280 TraceCheckUtils]: 32: Hoare triple {1371#false} assume !(~i~0 <= ~n~0); {1371#false} is VALID [2020-07-18 06:34:15,297 INFO L263 TraceCheckUtils]: 33: Hoare triple {1371#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1371#false} is VALID [2020-07-18 06:34:15,297 INFO L280 TraceCheckUtils]: 34: Hoare triple {1371#false} ~cond := #in~cond; {1371#false} is VALID [2020-07-18 06:34:15,297 INFO L280 TraceCheckUtils]: 35: Hoare triple {1371#false} assume 0 == ~cond; {1371#false} is VALID [2020-07-18 06:34:15,298 INFO L280 TraceCheckUtils]: 36: Hoare triple {1371#false} assume !false; {1371#false} is VALID [2020-07-18 06:34:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:15,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2089887429] [2020-07-18 06:34:15,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:15,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-18 06:34:15,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313343038] [2020-07-18 06:34:15,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-07-18 06:34:15,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:15,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 06:34:15,339 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-18 06:34:15,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 06:34:15,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:15,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 06:34:15,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-18 06:34:15,341 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 9 states. [2020-07-18 06:34:15,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:15,678 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-18 06:34:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-18 06:34:15,679 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-07-18 06:34:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:15,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:34:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-18 06:34:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 06:34:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-18 06:34:15,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2020-07-18 06:34:15,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:15,751 INFO L225 Difference]: With dead ends: 60 [2020-07-18 06:34:15,752 INFO L226 Difference]: Without dead ends: 49 [2020-07-18 06:34:15,753 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-18 06:34:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-18 06:34:15,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-07-18 06:34:15,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:15,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2020-07-18 06:34:15,850 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2020-07-18 06:34:15,850 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2020-07-18 06:34:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:15,853 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-18 06:34:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-18 06:34:15,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:15,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:15,856 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2020-07-18 06:34:15,856 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2020-07-18 06:34:15,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:15,859 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-18 06:34:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-18 06:34:15,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:15,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:15,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:15,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-18 06:34:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-07-18 06:34:15,863 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 37 [2020-07-18 06:34:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:15,864 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-07-18 06:34:15,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 06:34:15,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 48 transitions. [2020-07-18 06:34:15,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-18 06:34:15,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-18 06:34:15,936 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:15,937 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:15,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 06:34:15,937 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:15,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2133811459, now seen corresponding path program 4 times [2020-07-18 06:34:15,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:15,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2022223943] [2020-07-18 06:34:15,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:16,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {1705#true} assume true; {1705#true} is VALID [2020-07-18 06:34:16,184 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1705#true} {1705#true} #44#return; {1705#true} is VALID [2020-07-18 06:34:16,184 INFO L263 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2020-07-18 06:34:16,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {1705#true} assume true; {1705#true} is VALID [2020-07-18 06:34:16,185 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1705#true} {1705#true} #44#return; {1705#true} is VALID [2020-07-18 06:34:16,186 INFO L263 TraceCheckUtils]: 3: Hoare triple {1705#true} call #t~ret2 := main(); {1705#true} is VALID [2020-07-18 06:34:16,186 INFO L280 TraceCheckUtils]: 4: Hoare triple {1705#true} havoc ~i~0; {1705#true} is VALID [2020-07-18 06:34:16,186 INFO L280 TraceCheckUtils]: 5: Hoare triple {1705#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1705#true} is VALID [2020-07-18 06:34:16,186 INFO L280 TraceCheckUtils]: 6: Hoare triple {1705#true} havoc #t~nondet0; {1705#true} is VALID [2020-07-18 06:34:16,187 INFO L280 TraceCheckUtils]: 7: Hoare triple {1705#true} ~sn~0 := 0; {1705#true} is VALID [2020-07-18 06:34:16,188 INFO L280 TraceCheckUtils]: 8: Hoare triple {1705#true} ~i~0 := 1; {1709#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:16,189 INFO L280 TraceCheckUtils]: 9: Hoare triple {1709#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1709#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:16,190 INFO L280 TraceCheckUtils]: 10: Hoare triple {1709#(<= main_~i~0 1)} assume ~i~0 < 10; {1709#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:16,190 INFO L280 TraceCheckUtils]: 11: Hoare triple {1709#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1709#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:16,191 INFO L280 TraceCheckUtils]: 12: Hoare triple {1709#(<= main_~i~0 1)} #t~post1 := ~i~0; {1710#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:16,192 INFO L280 TraceCheckUtils]: 13: Hoare triple {1710#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1711#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:16,193 INFO L280 TraceCheckUtils]: 14: Hoare triple {1711#(<= main_~i~0 2)} havoc #t~post1; {1711#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:16,194 INFO L280 TraceCheckUtils]: 15: Hoare triple {1711#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1711#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:16,194 INFO L280 TraceCheckUtils]: 16: Hoare triple {1711#(<= main_~i~0 2)} assume ~i~0 < 10; {1711#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:16,195 INFO L280 TraceCheckUtils]: 17: Hoare triple {1711#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1711#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:16,196 INFO L280 TraceCheckUtils]: 18: Hoare triple {1711#(<= main_~i~0 2)} #t~post1 := ~i~0; {1712#(<= |main_#t~post1| 2)} is VALID [2020-07-18 06:34:16,197 INFO L280 TraceCheckUtils]: 19: Hoare triple {1712#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1713#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:16,198 INFO L280 TraceCheckUtils]: 20: Hoare triple {1713#(<= main_~i~0 3)} havoc #t~post1; {1713#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:16,199 INFO L280 TraceCheckUtils]: 21: Hoare triple {1713#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1713#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:16,199 INFO L280 TraceCheckUtils]: 22: Hoare triple {1713#(<= main_~i~0 3)} assume ~i~0 < 10; {1713#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:16,200 INFO L280 TraceCheckUtils]: 23: Hoare triple {1713#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1713#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:16,200 INFO L280 TraceCheckUtils]: 24: Hoare triple {1713#(<= main_~i~0 3)} #t~post1 := ~i~0; {1714#(<= |main_#t~post1| 3)} is VALID [2020-07-18 06:34:16,202 INFO L280 TraceCheckUtils]: 25: Hoare triple {1714#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {1715#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:16,202 INFO L280 TraceCheckUtils]: 26: Hoare triple {1715#(<= main_~i~0 4)} havoc #t~post1; {1715#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:16,203 INFO L280 TraceCheckUtils]: 27: Hoare triple {1715#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1715#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:16,204 INFO L280 TraceCheckUtils]: 28: Hoare triple {1715#(<= main_~i~0 4)} assume ~i~0 < 10; {1715#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:16,205 INFO L280 TraceCheckUtils]: 29: Hoare triple {1715#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {1715#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:16,206 INFO L280 TraceCheckUtils]: 30: Hoare triple {1715#(<= main_~i~0 4)} #t~post1 := ~i~0; {1716#(<= |main_#t~post1| 4)} is VALID [2020-07-18 06:34:16,207 INFO L280 TraceCheckUtils]: 31: Hoare triple {1716#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {1717#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:16,208 INFO L280 TraceCheckUtils]: 32: Hoare triple {1717#(<= main_~i~0 5)} havoc #t~post1; {1717#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:16,208 INFO L280 TraceCheckUtils]: 33: Hoare triple {1717#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1717#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:16,209 INFO L280 TraceCheckUtils]: 34: Hoare triple {1717#(<= main_~i~0 5)} assume !(~i~0 < 10); {1706#false} is VALID [2020-07-18 06:34:16,209 INFO L280 TraceCheckUtils]: 35: Hoare triple {1706#false} #t~post1 := ~i~0; {1706#false} is VALID [2020-07-18 06:34:16,209 INFO L280 TraceCheckUtils]: 36: Hoare triple {1706#false} ~i~0 := 1 + #t~post1; {1706#false} is VALID [2020-07-18 06:34:16,210 INFO L280 TraceCheckUtils]: 37: Hoare triple {1706#false} havoc #t~post1; {1706#false} is VALID [2020-07-18 06:34:16,210 INFO L280 TraceCheckUtils]: 38: Hoare triple {1706#false} assume !(~i~0 <= ~n~0); {1706#false} is VALID [2020-07-18 06:34:16,210 INFO L263 TraceCheckUtils]: 39: Hoare triple {1706#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1706#false} is VALID [2020-07-18 06:34:16,210 INFO L280 TraceCheckUtils]: 40: Hoare triple {1706#false} ~cond := #in~cond; {1706#false} is VALID [2020-07-18 06:34:16,211 INFO L280 TraceCheckUtils]: 41: Hoare triple {1706#false} assume 0 == ~cond; {1706#false} is VALID [2020-07-18 06:34:16,211 INFO L280 TraceCheckUtils]: 42: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2020-07-18 06:34:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 17 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:16,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2022223943] [2020-07-18 06:34:16,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:16,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-18 06:34:16,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681252799] [2020-07-18 06:34:16,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2020-07-18 06:34:16,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:16,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 06:34:16,274 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-18 06:34:16,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 06:34:16,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 06:34:16,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-18 06:34:16,276 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 11 states. [2020-07-18 06:34:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:16,669 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-18 06:34:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-18 06:34:16,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2020-07-18 06:34:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2020-07-18 06:34:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 06:34:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2020-07-18 06:34:16,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 63 transitions. [2020-07-18 06:34:16,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:16,755 INFO L225 Difference]: With dead ends: 66 [2020-07-18 06:34:16,756 INFO L226 Difference]: Without dead ends: 55 [2020-07-18 06:34:16,757 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-18 06:34:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-18 06:34:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2020-07-18 06:34:16,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:16,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 52 states. [2020-07-18 06:34:16,884 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 52 states. [2020-07-18 06:34:16,885 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 52 states. [2020-07-18 06:34:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:16,890 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-18 06:34:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-18 06:34:16,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:16,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:16,891 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 55 states. [2020-07-18 06:34:16,891 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 55 states. [2020-07-18 06:34:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:16,894 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-18 06:34:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-18 06:34:16,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:16,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:16,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:16,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-18 06:34:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-18 06:34:16,898 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 43 [2020-07-18 06:34:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:16,898 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-18 06:34:16,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 06:34:16,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-18 06:34:16,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-18 06:34:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-18 06:34:16,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:16,975 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:16,975 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 06:34:16,975 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1351967461, now seen corresponding path program 5 times [2020-07-18 06:34:16,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:16,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [525930609] [2020-07-18 06:34:16,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:17,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {2082#true} assume true; {2082#true} is VALID [2020-07-18 06:34:17,180 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2082#true} {2082#true} #44#return; {2082#true} is VALID [2020-07-18 06:34:17,181 INFO L263 TraceCheckUtils]: 0: Hoare triple {2082#true} call ULTIMATE.init(); {2082#true} is VALID [2020-07-18 06:34:17,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {2082#true} assume true; {2082#true} is VALID [2020-07-18 06:34:17,181 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2082#true} {2082#true} #44#return; {2082#true} is VALID [2020-07-18 06:34:17,181 INFO L263 TraceCheckUtils]: 3: Hoare triple {2082#true} call #t~ret2 := main(); {2082#true} is VALID [2020-07-18 06:34:17,181 INFO L280 TraceCheckUtils]: 4: Hoare triple {2082#true} havoc ~i~0; {2082#true} is VALID [2020-07-18 06:34:17,182 INFO L280 TraceCheckUtils]: 5: Hoare triple {2082#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2082#true} is VALID [2020-07-18 06:34:17,182 INFO L280 TraceCheckUtils]: 6: Hoare triple {2082#true} havoc #t~nondet0; {2082#true} is VALID [2020-07-18 06:34:17,182 INFO L280 TraceCheckUtils]: 7: Hoare triple {2082#true} ~sn~0 := 0; {2082#true} is VALID [2020-07-18 06:34:17,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {2082#true} ~i~0 := 1; {2086#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:17,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {2086#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2086#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:17,184 INFO L280 TraceCheckUtils]: 10: Hoare triple {2086#(<= main_~i~0 1)} assume ~i~0 < 10; {2086#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:17,184 INFO L280 TraceCheckUtils]: 11: Hoare triple {2086#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2086#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:17,185 INFO L280 TraceCheckUtils]: 12: Hoare triple {2086#(<= main_~i~0 1)} #t~post1 := ~i~0; {2087#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:17,186 INFO L280 TraceCheckUtils]: 13: Hoare triple {2087#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {2088#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:17,186 INFO L280 TraceCheckUtils]: 14: Hoare triple {2088#(<= main_~i~0 2)} havoc #t~post1; {2088#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:17,187 INFO L280 TraceCheckUtils]: 15: Hoare triple {2088#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2088#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:17,187 INFO L280 TraceCheckUtils]: 16: Hoare triple {2088#(<= main_~i~0 2)} assume ~i~0 < 10; {2088#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:17,188 INFO L280 TraceCheckUtils]: 17: Hoare triple {2088#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2088#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:17,188 INFO L280 TraceCheckUtils]: 18: Hoare triple {2088#(<= main_~i~0 2)} #t~post1 := ~i~0; {2089#(<= |main_#t~post1| 2)} is VALID [2020-07-18 06:34:17,189 INFO L280 TraceCheckUtils]: 19: Hoare triple {2089#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {2090#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:17,189 INFO L280 TraceCheckUtils]: 20: Hoare triple {2090#(<= main_~i~0 3)} havoc #t~post1; {2090#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:17,190 INFO L280 TraceCheckUtils]: 21: Hoare triple {2090#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2090#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:17,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {2090#(<= main_~i~0 3)} assume ~i~0 < 10; {2090#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:17,192 INFO L280 TraceCheckUtils]: 23: Hoare triple {2090#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2090#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:17,192 INFO L280 TraceCheckUtils]: 24: Hoare triple {2090#(<= main_~i~0 3)} #t~post1 := ~i~0; {2091#(<= |main_#t~post1| 3)} is VALID [2020-07-18 06:34:17,194 INFO L280 TraceCheckUtils]: 25: Hoare triple {2091#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {2092#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:17,197 INFO L280 TraceCheckUtils]: 26: Hoare triple {2092#(<= main_~i~0 4)} havoc #t~post1; {2092#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:17,200 INFO L280 TraceCheckUtils]: 27: Hoare triple {2092#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2092#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:17,202 INFO L280 TraceCheckUtils]: 28: Hoare triple {2092#(<= main_~i~0 4)} assume ~i~0 < 10; {2092#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:17,203 INFO L280 TraceCheckUtils]: 29: Hoare triple {2092#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {2092#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:17,203 INFO L280 TraceCheckUtils]: 30: Hoare triple {2092#(<= main_~i~0 4)} #t~post1 := ~i~0; {2093#(<= |main_#t~post1| 4)} is VALID [2020-07-18 06:34:17,204 INFO L280 TraceCheckUtils]: 31: Hoare triple {2093#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {2094#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:17,204 INFO L280 TraceCheckUtils]: 32: Hoare triple {2094#(<= main_~i~0 5)} havoc #t~post1; {2094#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:17,205 INFO L280 TraceCheckUtils]: 33: Hoare triple {2094#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2094#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:17,205 INFO L280 TraceCheckUtils]: 34: Hoare triple {2094#(<= main_~i~0 5)} assume ~i~0 < 10; {2094#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:17,206 INFO L280 TraceCheckUtils]: 35: Hoare triple {2094#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {2094#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:17,206 INFO L280 TraceCheckUtils]: 36: Hoare triple {2094#(<= main_~i~0 5)} #t~post1 := ~i~0; {2095#(<= |main_#t~post1| 5)} is VALID [2020-07-18 06:34:17,207 INFO L280 TraceCheckUtils]: 37: Hoare triple {2095#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {2096#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:17,208 INFO L280 TraceCheckUtils]: 38: Hoare triple {2096#(<= main_~i~0 6)} havoc #t~post1; {2096#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:17,208 INFO L280 TraceCheckUtils]: 39: Hoare triple {2096#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2096#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:17,209 INFO L280 TraceCheckUtils]: 40: Hoare triple {2096#(<= main_~i~0 6)} assume !(~i~0 < 10); {2083#false} is VALID [2020-07-18 06:34:17,209 INFO L280 TraceCheckUtils]: 41: Hoare triple {2083#false} #t~post1 := ~i~0; {2083#false} is VALID [2020-07-18 06:34:17,209 INFO L280 TraceCheckUtils]: 42: Hoare triple {2083#false} ~i~0 := 1 + #t~post1; {2083#false} is VALID [2020-07-18 06:34:17,209 INFO L280 TraceCheckUtils]: 43: Hoare triple {2083#false} havoc #t~post1; {2083#false} is VALID [2020-07-18 06:34:17,209 INFO L280 TraceCheckUtils]: 44: Hoare triple {2083#false} assume !(~i~0 <= ~n~0); {2083#false} is VALID [2020-07-18 06:34:17,210 INFO L263 TraceCheckUtils]: 45: Hoare triple {2083#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2083#false} is VALID [2020-07-18 06:34:17,210 INFO L280 TraceCheckUtils]: 46: Hoare triple {2083#false} ~cond := #in~cond; {2083#false} is VALID [2020-07-18 06:34:17,210 INFO L280 TraceCheckUtils]: 47: Hoare triple {2083#false} assume 0 == ~cond; {2083#false} is VALID [2020-07-18 06:34:17,210 INFO L280 TraceCheckUtils]: 48: Hoare triple {2083#false} assume !false; {2083#false} is VALID [2020-07-18 06:34:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 21 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:17,213 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [525930609] [2020-07-18 06:34:17,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:17,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-18 06:34:17,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850915480] [2020-07-18 06:34:17,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2020-07-18 06:34:17,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:17,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 06:34:17,276 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-18 06:34:17,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-18 06:34:17,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:17,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-18 06:34:17,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-18 06:34:17,278 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 13 states. [2020-07-18 06:34:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:17,793 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-18 06:34:17,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-18 06:34:17,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2020-07-18 06:34:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2020-07-18 06:34:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-18 06:34:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2020-07-18 06:34:17,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 69 transitions. [2020-07-18 06:34:17,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:17,875 INFO L225 Difference]: With dead ends: 72 [2020-07-18 06:34:17,875 INFO L226 Difference]: Without dead ends: 61 [2020-07-18 06:34:17,876 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-18 06:34:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-18 06:34:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-07-18 06:34:18,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:18,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 58 states. [2020-07-18 06:34:18,009 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 58 states. [2020-07-18 06:34:18,009 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 58 states. [2020-07-18 06:34:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:18,012 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-18 06:34:18,012 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-18 06:34:18,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:18,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:18,013 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 61 states. [2020-07-18 06:34:18,013 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 61 states. [2020-07-18 06:34:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:18,023 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-18 06:34:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-18 06:34:18,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:18,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:18,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:18,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-18 06:34:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-07-18 06:34:18,030 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 49 [2020-07-18 06:34:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:18,030 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-07-18 06:34:18,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-18 06:34:18,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 60 transitions. [2020-07-18 06:34:18,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-18 06:34:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-18 06:34:18,129 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:18,129 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:18,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 06:34:18,129 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1927178035, now seen corresponding path program 6 times [2020-07-18 06:34:18,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:18,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281327592] [2020-07-18 06:34:18,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:18,361 INFO L280 TraceCheckUtils]: 0: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-18 06:34:18,361 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2501#true} {2501#true} #44#return; {2501#true} is VALID [2020-07-18 06:34:18,361 INFO L263 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2501#true} is VALID [2020-07-18 06:34:18,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-18 06:34:18,361 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2501#true} {2501#true} #44#return; {2501#true} is VALID [2020-07-18 06:34:18,362 INFO L263 TraceCheckUtils]: 3: Hoare triple {2501#true} call #t~ret2 := main(); {2501#true} is VALID [2020-07-18 06:34:18,362 INFO L280 TraceCheckUtils]: 4: Hoare triple {2501#true} havoc ~i~0; {2501#true} is VALID [2020-07-18 06:34:18,362 INFO L280 TraceCheckUtils]: 5: Hoare triple {2501#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2501#true} is VALID [2020-07-18 06:34:18,362 INFO L280 TraceCheckUtils]: 6: Hoare triple {2501#true} havoc #t~nondet0; {2501#true} is VALID [2020-07-18 06:34:18,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {2501#true} ~sn~0 := 0; {2501#true} is VALID [2020-07-18 06:34:18,363 INFO L280 TraceCheckUtils]: 8: Hoare triple {2501#true} ~i~0 := 1; {2505#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:18,363 INFO L280 TraceCheckUtils]: 9: Hoare triple {2505#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2505#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:18,363 INFO L280 TraceCheckUtils]: 10: Hoare triple {2505#(<= main_~i~0 1)} assume ~i~0 < 10; {2505#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:18,364 INFO L280 TraceCheckUtils]: 11: Hoare triple {2505#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2505#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:18,364 INFO L280 TraceCheckUtils]: 12: Hoare triple {2505#(<= main_~i~0 1)} #t~post1 := ~i~0; {2506#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:18,365 INFO L280 TraceCheckUtils]: 13: Hoare triple {2506#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {2507#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:18,367 INFO L280 TraceCheckUtils]: 14: Hoare triple {2507#(<= main_~i~0 2)} havoc #t~post1; {2507#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:18,371 INFO L280 TraceCheckUtils]: 15: Hoare triple {2507#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2507#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:18,371 INFO L280 TraceCheckUtils]: 16: Hoare triple {2507#(<= main_~i~0 2)} assume ~i~0 < 10; {2507#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:18,372 INFO L280 TraceCheckUtils]: 17: Hoare triple {2507#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2507#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:18,372 INFO L280 TraceCheckUtils]: 18: Hoare triple {2507#(<= main_~i~0 2)} #t~post1 := ~i~0; {2508#(<= |main_#t~post1| 2)} is VALID [2020-07-18 06:34:18,373 INFO L280 TraceCheckUtils]: 19: Hoare triple {2508#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {2509#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:18,374 INFO L280 TraceCheckUtils]: 20: Hoare triple {2509#(<= main_~i~0 3)} havoc #t~post1; {2509#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:18,374 INFO L280 TraceCheckUtils]: 21: Hoare triple {2509#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2509#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:18,381 INFO L280 TraceCheckUtils]: 22: Hoare triple {2509#(<= main_~i~0 3)} assume ~i~0 < 10; {2509#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:18,381 INFO L280 TraceCheckUtils]: 23: Hoare triple {2509#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2509#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:18,382 INFO L280 TraceCheckUtils]: 24: Hoare triple {2509#(<= main_~i~0 3)} #t~post1 := ~i~0; {2510#(<= |main_#t~post1| 3)} is VALID [2020-07-18 06:34:18,384 INFO L280 TraceCheckUtils]: 25: Hoare triple {2510#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {2511#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:18,386 INFO L280 TraceCheckUtils]: 26: Hoare triple {2511#(<= main_~i~0 4)} havoc #t~post1; {2511#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:18,388 INFO L280 TraceCheckUtils]: 27: Hoare triple {2511#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2511#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:18,389 INFO L280 TraceCheckUtils]: 28: Hoare triple {2511#(<= main_~i~0 4)} assume ~i~0 < 10; {2511#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:18,390 INFO L280 TraceCheckUtils]: 29: Hoare triple {2511#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {2511#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:18,390 INFO L280 TraceCheckUtils]: 30: Hoare triple {2511#(<= main_~i~0 4)} #t~post1 := ~i~0; {2512#(<= |main_#t~post1| 4)} is VALID [2020-07-18 06:34:18,393 INFO L280 TraceCheckUtils]: 31: Hoare triple {2512#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {2513#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:18,393 INFO L280 TraceCheckUtils]: 32: Hoare triple {2513#(<= main_~i~0 5)} havoc #t~post1; {2513#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:18,394 INFO L280 TraceCheckUtils]: 33: Hoare triple {2513#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2513#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:18,395 INFO L280 TraceCheckUtils]: 34: Hoare triple {2513#(<= main_~i~0 5)} assume ~i~0 < 10; {2513#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:18,395 INFO L280 TraceCheckUtils]: 35: Hoare triple {2513#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {2513#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:18,396 INFO L280 TraceCheckUtils]: 36: Hoare triple {2513#(<= main_~i~0 5)} #t~post1 := ~i~0; {2514#(<= |main_#t~post1| 5)} is VALID [2020-07-18 06:34:18,397 INFO L280 TraceCheckUtils]: 37: Hoare triple {2514#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {2515#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:18,397 INFO L280 TraceCheckUtils]: 38: Hoare triple {2515#(<= main_~i~0 6)} havoc #t~post1; {2515#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:18,398 INFO L280 TraceCheckUtils]: 39: Hoare triple {2515#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2515#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:18,399 INFO L280 TraceCheckUtils]: 40: Hoare triple {2515#(<= main_~i~0 6)} assume ~i~0 < 10; {2515#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:18,399 INFO L280 TraceCheckUtils]: 41: Hoare triple {2515#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {2515#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:18,400 INFO L280 TraceCheckUtils]: 42: Hoare triple {2515#(<= main_~i~0 6)} #t~post1 := ~i~0; {2516#(<= |main_#t~post1| 6)} is VALID [2020-07-18 06:34:18,401 INFO L280 TraceCheckUtils]: 43: Hoare triple {2516#(<= |main_#t~post1| 6)} ~i~0 := 1 + #t~post1; {2517#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:18,401 INFO L280 TraceCheckUtils]: 44: Hoare triple {2517#(<= main_~i~0 7)} havoc #t~post1; {2517#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:18,402 INFO L280 TraceCheckUtils]: 45: Hoare triple {2517#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2517#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:18,403 INFO L280 TraceCheckUtils]: 46: Hoare triple {2517#(<= main_~i~0 7)} assume !(~i~0 < 10); {2502#false} is VALID [2020-07-18 06:34:18,403 INFO L280 TraceCheckUtils]: 47: Hoare triple {2502#false} #t~post1 := ~i~0; {2502#false} is VALID [2020-07-18 06:34:18,403 INFO L280 TraceCheckUtils]: 48: Hoare triple {2502#false} ~i~0 := 1 + #t~post1; {2502#false} is VALID [2020-07-18 06:34:18,403 INFO L280 TraceCheckUtils]: 49: Hoare triple {2502#false} havoc #t~post1; {2502#false} is VALID [2020-07-18 06:34:18,403 INFO L280 TraceCheckUtils]: 50: Hoare triple {2502#false} assume !(~i~0 <= ~n~0); {2502#false} is VALID [2020-07-18 06:34:18,404 INFO L263 TraceCheckUtils]: 51: Hoare triple {2502#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2502#false} is VALID [2020-07-18 06:34:18,404 INFO L280 TraceCheckUtils]: 52: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-18 06:34:18,404 INFO L280 TraceCheckUtils]: 53: Hoare triple {2502#false} assume 0 == ~cond; {2502#false} is VALID [2020-07-18 06:34:18,404 INFO L280 TraceCheckUtils]: 54: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2020-07-18 06:34:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 25 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:18,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281327592] [2020-07-18 06:34:18,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:18,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-18 06:34:18,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169139292] [2020-07-18 06:34:18,412 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2020-07-18 06:34:18,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:18,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 06:34:18,465 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-18 06:34:18,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 06:34:18,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:18,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 06:34:18,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-18 06:34:18,470 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 15 states. [2020-07-18 06:34:19,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:19,101 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2020-07-18 06:34:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-18 06:34:19,101 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2020-07-18 06:34:19,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 06:34:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2020-07-18 06:34:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 06:34:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2020-07-18 06:34:19,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 75 transitions. [2020-07-18 06:34:19,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:19,191 INFO L225 Difference]: With dead ends: 78 [2020-07-18 06:34:19,192 INFO L226 Difference]: Without dead ends: 67 [2020-07-18 06:34:19,193 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-18 06:34:19,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-18 06:34:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2020-07-18 06:34:19,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:19,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 64 states. [2020-07-18 06:34:19,367 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 64 states. [2020-07-18 06:34:19,367 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 64 states. [2020-07-18 06:34:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:19,369 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-07-18 06:34:19,370 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2020-07-18 06:34:19,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:19,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:19,370 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 67 states. [2020-07-18 06:34:19,370 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 67 states. [2020-07-18 06:34:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:19,372 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-07-18 06:34:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2020-07-18 06:34:19,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:19,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:19,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:19,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-18 06:34:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-07-18 06:34:19,376 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 55 [2020-07-18 06:34:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:19,376 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-07-18 06:34:19,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 06:34:19,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 66 transitions. [2020-07-18 06:34:19,480 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-18 06:34:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-07-18 06:34:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-18 06:34:19,481 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:19,481 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:19,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 06:34:19,481 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:19,482 INFO L82 PathProgramCache]: Analyzing trace with hash -879247179, now seen corresponding path program 7 times [2020-07-18 06:34:19,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:19,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1541025301] [2020-07-18 06:34:19,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:19,784 INFO L280 TraceCheckUtils]: 0: Hoare triple {2962#true} assume true; {2962#true} is VALID [2020-07-18 06:34:19,784 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2962#true} {2962#true} #44#return; {2962#true} is VALID [2020-07-18 06:34:19,784 INFO L263 TraceCheckUtils]: 0: Hoare triple {2962#true} call ULTIMATE.init(); {2962#true} is VALID [2020-07-18 06:34:19,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {2962#true} assume true; {2962#true} is VALID [2020-07-18 06:34:19,785 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2962#true} {2962#true} #44#return; {2962#true} is VALID [2020-07-18 06:34:19,785 INFO L263 TraceCheckUtils]: 3: Hoare triple {2962#true} call #t~ret2 := main(); {2962#true} is VALID [2020-07-18 06:34:19,785 INFO L280 TraceCheckUtils]: 4: Hoare triple {2962#true} havoc ~i~0; {2962#true} is VALID [2020-07-18 06:34:19,785 INFO L280 TraceCheckUtils]: 5: Hoare triple {2962#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2962#true} is VALID [2020-07-18 06:34:19,786 INFO L280 TraceCheckUtils]: 6: Hoare triple {2962#true} havoc #t~nondet0; {2962#true} is VALID [2020-07-18 06:34:19,786 INFO L280 TraceCheckUtils]: 7: Hoare triple {2962#true} ~sn~0 := 0; {2962#true} is VALID [2020-07-18 06:34:19,787 INFO L280 TraceCheckUtils]: 8: Hoare triple {2962#true} ~i~0 := 1; {2966#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:19,787 INFO L280 TraceCheckUtils]: 9: Hoare triple {2966#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2966#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:19,788 INFO L280 TraceCheckUtils]: 10: Hoare triple {2966#(<= main_~i~0 1)} assume ~i~0 < 10; {2966#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:19,788 INFO L280 TraceCheckUtils]: 11: Hoare triple {2966#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2966#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:19,789 INFO L280 TraceCheckUtils]: 12: Hoare triple {2966#(<= main_~i~0 1)} #t~post1 := ~i~0; {2967#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:19,790 INFO L280 TraceCheckUtils]: 13: Hoare triple {2967#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {2968#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:19,791 INFO L280 TraceCheckUtils]: 14: Hoare triple {2968#(<= main_~i~0 2)} havoc #t~post1; {2968#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:19,791 INFO L280 TraceCheckUtils]: 15: Hoare triple {2968#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2968#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:19,792 INFO L280 TraceCheckUtils]: 16: Hoare triple {2968#(<= main_~i~0 2)} assume ~i~0 < 10; {2968#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:19,792 INFO L280 TraceCheckUtils]: 17: Hoare triple {2968#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2968#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:19,793 INFO L280 TraceCheckUtils]: 18: Hoare triple {2968#(<= main_~i~0 2)} #t~post1 := ~i~0; {2969#(<= |main_#t~post1| 2)} is VALID [2020-07-18 06:34:19,794 INFO L280 TraceCheckUtils]: 19: Hoare triple {2969#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {2970#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:19,795 INFO L280 TraceCheckUtils]: 20: Hoare triple {2970#(<= main_~i~0 3)} havoc #t~post1; {2970#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:19,795 INFO L280 TraceCheckUtils]: 21: Hoare triple {2970#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2970#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:19,796 INFO L280 TraceCheckUtils]: 22: Hoare triple {2970#(<= main_~i~0 3)} assume ~i~0 < 10; {2970#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:19,796 INFO L280 TraceCheckUtils]: 23: Hoare triple {2970#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2970#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:19,798 INFO L280 TraceCheckUtils]: 24: Hoare triple {2970#(<= main_~i~0 3)} #t~post1 := ~i~0; {2971#(<= |main_#t~post1| 3)} is VALID [2020-07-18 06:34:19,799 INFO L280 TraceCheckUtils]: 25: Hoare triple {2971#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {2972#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:19,799 INFO L280 TraceCheckUtils]: 26: Hoare triple {2972#(<= main_~i~0 4)} havoc #t~post1; {2972#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:19,800 INFO L280 TraceCheckUtils]: 27: Hoare triple {2972#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2972#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:19,800 INFO L280 TraceCheckUtils]: 28: Hoare triple {2972#(<= main_~i~0 4)} assume ~i~0 < 10; {2972#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:19,801 INFO L280 TraceCheckUtils]: 29: Hoare triple {2972#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {2972#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:19,802 INFO L280 TraceCheckUtils]: 30: Hoare triple {2972#(<= main_~i~0 4)} #t~post1 := ~i~0; {2973#(<= |main_#t~post1| 4)} is VALID [2020-07-18 06:34:19,803 INFO L280 TraceCheckUtils]: 31: Hoare triple {2973#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {2974#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:19,803 INFO L280 TraceCheckUtils]: 32: Hoare triple {2974#(<= main_~i~0 5)} havoc #t~post1; {2974#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:19,804 INFO L280 TraceCheckUtils]: 33: Hoare triple {2974#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2974#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:19,805 INFO L280 TraceCheckUtils]: 34: Hoare triple {2974#(<= main_~i~0 5)} assume ~i~0 < 10; {2974#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:19,805 INFO L280 TraceCheckUtils]: 35: Hoare triple {2974#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {2974#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:19,806 INFO L280 TraceCheckUtils]: 36: Hoare triple {2974#(<= main_~i~0 5)} #t~post1 := ~i~0; {2975#(<= |main_#t~post1| 5)} is VALID [2020-07-18 06:34:19,807 INFO L280 TraceCheckUtils]: 37: Hoare triple {2975#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {2976#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:19,808 INFO L280 TraceCheckUtils]: 38: Hoare triple {2976#(<= main_~i~0 6)} havoc #t~post1; {2976#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:19,808 INFO L280 TraceCheckUtils]: 39: Hoare triple {2976#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2976#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:19,809 INFO L280 TraceCheckUtils]: 40: Hoare triple {2976#(<= main_~i~0 6)} assume ~i~0 < 10; {2976#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:19,809 INFO L280 TraceCheckUtils]: 41: Hoare triple {2976#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {2976#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:19,812 INFO L280 TraceCheckUtils]: 42: Hoare triple {2976#(<= main_~i~0 6)} #t~post1 := ~i~0; {2977#(<= |main_#t~post1| 6)} is VALID [2020-07-18 06:34:19,813 INFO L280 TraceCheckUtils]: 43: Hoare triple {2977#(<= |main_#t~post1| 6)} ~i~0 := 1 + #t~post1; {2978#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:19,814 INFO L280 TraceCheckUtils]: 44: Hoare triple {2978#(<= main_~i~0 7)} havoc #t~post1; {2978#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:19,816 INFO L280 TraceCheckUtils]: 45: Hoare triple {2978#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2978#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:19,817 INFO L280 TraceCheckUtils]: 46: Hoare triple {2978#(<= main_~i~0 7)} assume ~i~0 < 10; {2978#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:19,818 INFO L280 TraceCheckUtils]: 47: Hoare triple {2978#(<= main_~i~0 7)} ~sn~0 := 2 + ~sn~0; {2978#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:19,821 INFO L280 TraceCheckUtils]: 48: Hoare triple {2978#(<= main_~i~0 7)} #t~post1 := ~i~0; {2979#(<= |main_#t~post1| 7)} is VALID [2020-07-18 06:34:19,823 INFO L280 TraceCheckUtils]: 49: Hoare triple {2979#(<= |main_#t~post1| 7)} ~i~0 := 1 + #t~post1; {2980#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:19,824 INFO L280 TraceCheckUtils]: 50: Hoare triple {2980#(<= main_~i~0 8)} havoc #t~post1; {2980#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:19,825 INFO L280 TraceCheckUtils]: 51: Hoare triple {2980#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {2980#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:19,826 INFO L280 TraceCheckUtils]: 52: Hoare triple {2980#(<= main_~i~0 8)} assume !(~i~0 < 10); {2963#false} is VALID [2020-07-18 06:34:19,826 INFO L280 TraceCheckUtils]: 53: Hoare triple {2963#false} #t~post1 := ~i~0; {2963#false} is VALID [2020-07-18 06:34:19,826 INFO L280 TraceCheckUtils]: 54: Hoare triple {2963#false} ~i~0 := 1 + #t~post1; {2963#false} is VALID [2020-07-18 06:34:19,827 INFO L280 TraceCheckUtils]: 55: Hoare triple {2963#false} havoc #t~post1; {2963#false} is VALID [2020-07-18 06:34:19,827 INFO L280 TraceCheckUtils]: 56: Hoare triple {2963#false} assume !(~i~0 <= ~n~0); {2963#false} is VALID [2020-07-18 06:34:19,827 INFO L263 TraceCheckUtils]: 57: Hoare triple {2963#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2963#false} is VALID [2020-07-18 06:34:19,827 INFO L280 TraceCheckUtils]: 58: Hoare triple {2963#false} ~cond := #in~cond; {2963#false} is VALID [2020-07-18 06:34:19,828 INFO L280 TraceCheckUtils]: 59: Hoare triple {2963#false} assume 0 == ~cond; {2963#false} is VALID [2020-07-18 06:34:19,828 INFO L280 TraceCheckUtils]: 60: Hoare triple {2963#false} assume !false; {2963#false} is VALID [2020-07-18 06:34:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:19,833 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1541025301] [2020-07-18 06:34:19,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:19,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-18 06:34:19,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727194336] [2020-07-18 06:34:19,834 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-07-18 06:34:19,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:19,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-18 06:34:19,913 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-18 06:34:19,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-18 06:34:19,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:19,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-18 06:34:19,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-18 06:34:19,915 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2020-07-18 06:34:20,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:20,563 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-18 06:34:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-18 06:34:20,563 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-07-18 06:34:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 06:34:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2020-07-18 06:34:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-18 06:34:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2020-07-18 06:34:20,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 81 transitions. [2020-07-18 06:34:20,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:20,666 INFO L225 Difference]: With dead ends: 84 [2020-07-18 06:34:20,666 INFO L226 Difference]: Without dead ends: 73 [2020-07-18 06:34:20,667 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-18 06:34:20,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-18 06:34:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-18 06:34:20,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:20,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 70 states. [2020-07-18 06:34:20,834 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 70 states. [2020-07-18 06:34:20,834 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 70 states. [2020-07-18 06:34:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:20,837 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-18 06:34:20,837 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-18 06:34:20,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:20,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:20,838 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 73 states. [2020-07-18 06:34:20,838 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 73 states. [2020-07-18 06:34:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:20,841 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-18 06:34:20,841 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-18 06:34:20,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:20,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:20,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:20,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-18 06:34:20,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-07-18 06:34:20,844 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 61 [2020-07-18 06:34:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:20,844 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-07-18 06:34:20,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-18 06:34:20,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 72 transitions. [2020-07-18 06:34:20,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:20,958 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-07-18 06:34:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 06:34:20,959 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:20,959 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:20,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 06:34:20,960 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash -583378275, now seen corresponding path program 8 times [2020-07-18 06:34:20,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:20,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464085324] [2020-07-18 06:34:20,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:34:21,256 INFO L280 TraceCheckUtils]: 0: Hoare triple {3465#true} assume true; {3465#true} is VALID [2020-07-18 06:34:21,257 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3465#true} {3465#true} #44#return; {3465#true} is VALID [2020-07-18 06:34:21,257 INFO L263 TraceCheckUtils]: 0: Hoare triple {3465#true} call ULTIMATE.init(); {3465#true} is VALID [2020-07-18 06:34:21,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {3465#true} assume true; {3465#true} is VALID [2020-07-18 06:34:21,257 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3465#true} {3465#true} #44#return; {3465#true} is VALID [2020-07-18 06:34:21,258 INFO L263 TraceCheckUtils]: 3: Hoare triple {3465#true} call #t~ret2 := main(); {3465#true} is VALID [2020-07-18 06:34:21,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {3465#true} havoc ~i~0; {3465#true} is VALID [2020-07-18 06:34:21,258 INFO L280 TraceCheckUtils]: 5: Hoare triple {3465#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {3465#true} is VALID [2020-07-18 06:34:21,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {3465#true} havoc #t~nondet0; {3465#true} is VALID [2020-07-18 06:34:21,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {3465#true} ~sn~0 := 0; {3465#true} is VALID [2020-07-18 06:34:21,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {3465#true} ~i~0 := 1; {3469#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:21,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {3469#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {3469#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:21,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {3469#(<= main_~i~0 1)} assume ~i~0 < 10; {3469#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:21,260 INFO L280 TraceCheckUtils]: 11: Hoare triple {3469#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {3469#(<= main_~i~0 1)} is VALID [2020-07-18 06:34:21,260 INFO L280 TraceCheckUtils]: 12: Hoare triple {3469#(<= main_~i~0 1)} #t~post1 := ~i~0; {3470#(<= |main_#t~post1| 1)} is VALID [2020-07-18 06:34:21,261 INFO L280 TraceCheckUtils]: 13: Hoare triple {3470#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {3471#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:21,261 INFO L280 TraceCheckUtils]: 14: Hoare triple {3471#(<= main_~i~0 2)} havoc #t~post1; {3471#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:21,262 INFO L280 TraceCheckUtils]: 15: Hoare triple {3471#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {3471#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:21,262 INFO L280 TraceCheckUtils]: 16: Hoare triple {3471#(<= main_~i~0 2)} assume ~i~0 < 10; {3471#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:21,263 INFO L280 TraceCheckUtils]: 17: Hoare triple {3471#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {3471#(<= main_~i~0 2)} is VALID [2020-07-18 06:34:21,263 INFO L280 TraceCheckUtils]: 18: Hoare triple {3471#(<= main_~i~0 2)} #t~post1 := ~i~0; {3472#(<= |main_#t~post1| 2)} is VALID [2020-07-18 06:34:21,264 INFO L280 TraceCheckUtils]: 19: Hoare triple {3472#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {3473#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:21,264 INFO L280 TraceCheckUtils]: 20: Hoare triple {3473#(<= main_~i~0 3)} havoc #t~post1; {3473#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:21,265 INFO L280 TraceCheckUtils]: 21: Hoare triple {3473#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {3473#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:21,265 INFO L280 TraceCheckUtils]: 22: Hoare triple {3473#(<= main_~i~0 3)} assume ~i~0 < 10; {3473#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:21,266 INFO L280 TraceCheckUtils]: 23: Hoare triple {3473#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {3473#(<= main_~i~0 3)} is VALID [2020-07-18 06:34:21,266 INFO L280 TraceCheckUtils]: 24: Hoare triple {3473#(<= main_~i~0 3)} #t~post1 := ~i~0; {3474#(<= |main_#t~post1| 3)} is VALID [2020-07-18 06:34:21,267 INFO L280 TraceCheckUtils]: 25: Hoare triple {3474#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {3475#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:21,267 INFO L280 TraceCheckUtils]: 26: Hoare triple {3475#(<= main_~i~0 4)} havoc #t~post1; {3475#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:21,267 INFO L280 TraceCheckUtils]: 27: Hoare triple {3475#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {3475#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:21,268 INFO L280 TraceCheckUtils]: 28: Hoare triple {3475#(<= main_~i~0 4)} assume ~i~0 < 10; {3475#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:21,268 INFO L280 TraceCheckUtils]: 29: Hoare triple {3475#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {3475#(<= main_~i~0 4)} is VALID [2020-07-18 06:34:21,269 INFO L280 TraceCheckUtils]: 30: Hoare triple {3475#(<= main_~i~0 4)} #t~post1 := ~i~0; {3476#(<= |main_#t~post1| 4)} is VALID [2020-07-18 06:34:21,269 INFO L280 TraceCheckUtils]: 31: Hoare triple {3476#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {3477#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:21,270 INFO L280 TraceCheckUtils]: 32: Hoare triple {3477#(<= main_~i~0 5)} havoc #t~post1; {3477#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:21,270 INFO L280 TraceCheckUtils]: 33: Hoare triple {3477#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {3477#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:21,271 INFO L280 TraceCheckUtils]: 34: Hoare triple {3477#(<= main_~i~0 5)} assume ~i~0 < 10; {3477#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:21,271 INFO L280 TraceCheckUtils]: 35: Hoare triple {3477#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {3477#(<= main_~i~0 5)} is VALID [2020-07-18 06:34:21,272 INFO L280 TraceCheckUtils]: 36: Hoare triple {3477#(<= main_~i~0 5)} #t~post1 := ~i~0; {3478#(<= |main_#t~post1| 5)} is VALID [2020-07-18 06:34:21,273 INFO L280 TraceCheckUtils]: 37: Hoare triple {3478#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {3479#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:21,274 INFO L280 TraceCheckUtils]: 38: Hoare triple {3479#(<= main_~i~0 6)} havoc #t~post1; {3479#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:21,274 INFO L280 TraceCheckUtils]: 39: Hoare triple {3479#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {3479#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:21,275 INFO L280 TraceCheckUtils]: 40: Hoare triple {3479#(<= main_~i~0 6)} assume ~i~0 < 10; {3479#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:21,275 INFO L280 TraceCheckUtils]: 41: Hoare triple {3479#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {3479#(<= main_~i~0 6)} is VALID [2020-07-18 06:34:21,275 INFO L280 TraceCheckUtils]: 42: Hoare triple {3479#(<= main_~i~0 6)} #t~post1 := ~i~0; {3480#(<= |main_#t~post1| 6)} is VALID [2020-07-18 06:34:21,276 INFO L280 TraceCheckUtils]: 43: Hoare triple {3480#(<= |main_#t~post1| 6)} ~i~0 := 1 + #t~post1; {3481#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:21,276 INFO L280 TraceCheckUtils]: 44: Hoare triple {3481#(<= main_~i~0 7)} havoc #t~post1; {3481#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:21,277 INFO L280 TraceCheckUtils]: 45: Hoare triple {3481#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {3481#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:21,277 INFO L280 TraceCheckUtils]: 46: Hoare triple {3481#(<= main_~i~0 7)} assume ~i~0 < 10; {3481#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:21,278 INFO L280 TraceCheckUtils]: 47: Hoare triple {3481#(<= main_~i~0 7)} ~sn~0 := 2 + ~sn~0; {3481#(<= main_~i~0 7)} is VALID [2020-07-18 06:34:21,278 INFO L280 TraceCheckUtils]: 48: Hoare triple {3481#(<= main_~i~0 7)} #t~post1 := ~i~0; {3482#(<= |main_#t~post1| 7)} is VALID [2020-07-18 06:34:21,279 INFO L280 TraceCheckUtils]: 49: Hoare triple {3482#(<= |main_#t~post1| 7)} ~i~0 := 1 + #t~post1; {3483#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:21,279 INFO L280 TraceCheckUtils]: 50: Hoare triple {3483#(<= main_~i~0 8)} havoc #t~post1; {3483#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:21,280 INFO L280 TraceCheckUtils]: 51: Hoare triple {3483#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {3483#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:21,280 INFO L280 TraceCheckUtils]: 52: Hoare triple {3483#(<= main_~i~0 8)} assume ~i~0 < 10; {3483#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:21,281 INFO L280 TraceCheckUtils]: 53: Hoare triple {3483#(<= main_~i~0 8)} ~sn~0 := 2 + ~sn~0; {3483#(<= main_~i~0 8)} is VALID [2020-07-18 06:34:21,281 INFO L280 TraceCheckUtils]: 54: Hoare triple {3483#(<= main_~i~0 8)} #t~post1 := ~i~0; {3484#(<= |main_#t~post1| 8)} is VALID [2020-07-18 06:34:21,282 INFO L280 TraceCheckUtils]: 55: Hoare triple {3484#(<= |main_#t~post1| 8)} ~i~0 := 1 + #t~post1; {3485#(<= main_~i~0 9)} is VALID [2020-07-18 06:34:21,282 INFO L280 TraceCheckUtils]: 56: Hoare triple {3485#(<= main_~i~0 9)} havoc #t~post1; {3485#(<= main_~i~0 9)} is VALID [2020-07-18 06:34:21,283 INFO L280 TraceCheckUtils]: 57: Hoare triple {3485#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {3485#(<= main_~i~0 9)} is VALID [2020-07-18 06:34:21,283 INFO L280 TraceCheckUtils]: 58: Hoare triple {3485#(<= main_~i~0 9)} assume !(~i~0 < 10); {3466#false} is VALID [2020-07-18 06:34:21,283 INFO L280 TraceCheckUtils]: 59: Hoare triple {3466#false} #t~post1 := ~i~0; {3466#false} is VALID [2020-07-18 06:34:21,283 INFO L280 TraceCheckUtils]: 60: Hoare triple {3466#false} ~i~0 := 1 + #t~post1; {3466#false} is VALID [2020-07-18 06:34:21,284 INFO L280 TraceCheckUtils]: 61: Hoare triple {3466#false} havoc #t~post1; {3466#false} is VALID [2020-07-18 06:34:21,284 INFO L280 TraceCheckUtils]: 62: Hoare triple {3466#false} assume !(~i~0 <= ~n~0); {3466#false} is VALID [2020-07-18 06:34:21,284 INFO L263 TraceCheckUtils]: 63: Hoare triple {3466#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3466#false} is VALID [2020-07-18 06:34:21,284 INFO L280 TraceCheckUtils]: 64: Hoare triple {3466#false} ~cond := #in~cond; {3466#false} is VALID [2020-07-18 06:34:21,284 INFO L280 TraceCheckUtils]: 65: Hoare triple {3466#false} assume 0 == ~cond; {3466#false} is VALID [2020-07-18 06:34:21,284 INFO L280 TraceCheckUtils]: 66: Hoare triple {3466#false} assume !false; {3466#false} is VALID [2020-07-18 06:34:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 33 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:34:21,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1464085324] [2020-07-18 06:34:21,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-18 06:34:21,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-07-18 06:34:21,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662542570] [2020-07-18 06:34:21,289 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2020-07-18 06:34:21,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:34:21,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-18 06:34:21,365 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:21,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-18 06:34:21,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:34:21,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-18 06:34:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-18 06:34:21,367 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2020-07-18 06:34:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:22,213 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2020-07-18 06:34:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-18 06:34:22,213 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2020-07-18 06:34:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:34:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-18 06:34:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 86 transitions. [2020-07-18 06:34:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-18 06:34:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 86 transitions. [2020-07-18 06:34:22,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 86 transitions. [2020-07-18 06:34:22,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:22,312 INFO L225 Difference]: With dead ends: 89 [2020-07-18 06:34:22,312 INFO L226 Difference]: Without dead ends: 78 [2020-07-18 06:34:22,313 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2020-07-18 06:34:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-18 06:34:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-18 06:34:22,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:34:22,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-18 06:34:22,508 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-18 06:34:22,508 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-18 06:34:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:22,510 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-07-18 06:34:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-07-18 06:34:22,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:22,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:22,511 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-18 06:34:22,511 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-18 06:34:22,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:34:22,513 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-07-18 06:34:22,513 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-07-18 06:34:22,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:34:22,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:34:22,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:34:22,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:34:22,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-18 06:34:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2020-07-18 06:34:22,516 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 67 [2020-07-18 06:34:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:34:22,517 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2020-07-18 06:34:22,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-18 06:34:22,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2020-07-18 06:34:22,649 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:34:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2020-07-18 06:34:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-18 06:34:22,651 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:34:22,651 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 06:34:22,651 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 06:34:22,652 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:34:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:34:22,652 INFO L82 PathProgramCache]: Analyzing trace with hash 929818245, now seen corresponding path program 9 times [2020-07-18 06:34:22,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:34:22,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1688178265] [2020-07-18 06:34:22,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:34:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:34:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:34:22,787 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 06:34:22,787 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 06:34:22,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 06:34:22,869 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 06:34:22,870 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:34:22,870 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:34:22,870 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 06:34:22,870 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-18 06:34:22,870 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 06:34:22,870 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:34:22,870 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:34:22,871 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-18 06:34:22,871 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:34:22,871 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 06:34:22,871 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 06:34:22,871 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-18 06:34:22,871 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 06:34:22,872 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-18 06:34:22,872 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-18 06:34:22,872 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-18 06:34:22,872 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 06:34:22,872 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:34:22,872 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 06:34:22,872 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 06:34:22,872 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 06:34:22,872 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-18 06:34:22,873 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 06:34:22,873 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-18 06:34:22,873 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-18 06:34:22,873 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-18 06:34:22,873 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-18 06:34:22,873 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-18 06:34:22,873 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-18 06:34:22,873 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-18 06:34:22,874 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-18 06:34:22,874 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-18 06:34:22,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:34:22 BoogieIcfgContainer [2020-07-18 06:34:22,879 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:34:22,889 INFO L168 Benchmark]: Toolchain (without parser) took 14191.80 ms. Allocated memory was 138.9 MB in the beginning and 328.7 MB in the end (delta: 189.8 MB). Free memory was 103.8 MB in the beginning and 112.4 MB in the end (delta: -8.6 MB). Peak memory consumption was 181.2 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,890 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 138.9 MB. Free memory was 121.2 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.81 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,892 INFO L168 Benchmark]: Boogie Preprocessor took 128.02 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 93.5 MB in the beginning and 183.9 MB in the end (delta: -90.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,892 INFO L168 Benchmark]: RCFGBuilder took 344.85 ms. Allocated memory is still 203.9 MB. Free memory was 183.0 MB in the beginning and 167.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,898 INFO L168 Benchmark]: TraceAbstraction took 13393.39 ms. Allocated memory was 203.9 MB in the beginning and 328.7 MB in the end (delta: 124.8 MB). Free memory was 167.7 MB in the beginning and 112.4 MB in the end (delta: 55.2 MB). Peak memory consumption was 180.0 MB. Max. memory is 7.1 GB. [2020-07-18 06:34:22,906 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.33 ms. Allocated memory is still 138.9 MB. Free memory was 121.2 MB in the beginning and 120.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 308.81 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.02 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 93.5 MB in the beginning and 183.9 MB in the end (delta: -90.4 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.85 ms. Allocated memory is still 203.9 MB. Free memory was 183.0 MB in the beginning and 167.7 MB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13393.39 ms. Allocated memory was 203.9 MB in the beginning and 328.7 MB in the end (delta: 124.8 MB). Free memory was 167.7 MB in the beginning and 112.4 MB in the end (delta: 55.2 MB). Peak memory consumption was 180.0 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, n=__VERIFIER_nondet_uint(), sn=0; VAL [__VERIFIER_nondet_uint()=10, n=10] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; VAL [n=0, n=10] [L13] i=1 VAL [i=1, n=0, n=10] [L13] COND TRUE i<=n VAL [i=1, n=10, n=0] [L14] COND TRUE i<10 VAL [i=1, n=0, n=10] [L15] sn = sn + (2) VAL [i=1, n=10, n=2] [L13] i++ VAL [i=2, n=10, n=2] [L13] COND TRUE i<=n VAL [i=2, n=10, n=2] [L14] COND TRUE i<10 VAL [i=2, n=2, n=10] [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=10, n=4] [L13] COND TRUE i<=n VAL [i=3, n=10, n=4] [L14] COND TRUE i<10 VAL [i=3, n=10, n=4] [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=10, n=6] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 VAL [i=4, n=6, n=10] [L15] sn = sn + (2) VAL [i=4, n=8, n=10] [L13] i++ VAL [i=5, n=10, n=8] [L13] COND TRUE i<=n VAL [i=5, n=8, n=10] [L14] COND TRUE i<10 VAL [i=5, n=8, n=10] [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 VAL [i=6, n=10, n=10] [L15] sn = sn + (2) VAL [i=6, n=10, n=12] [L13] i++ VAL [i=7, n=10, n=12] [L13] COND TRUE i<=n VAL [i=7, n=10, n=12] [L14] COND TRUE i<10 VAL [i=7, n=12, n=10] [L15] sn = sn + (2) VAL [i=7, n=14, n=10] [L13] i++ VAL [i=8, n=10, n=14] [L13] COND TRUE i<=n VAL [i=8, n=10, n=14] [L14] COND TRUE i<10 VAL [i=8, n=14, n=10] [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=10, n=16] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 VAL [i=9, n=16, n=10] [L15] sn = sn + (2) VAL [i=9, n=10, n=18] [L13] i++ VAL [i=10, n=10, n=18] [L13] COND TRUE i<=n VAL [i=10, n=10, n=18] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=10, n=18] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L17] CALL __VERIFIER_assert(sn==n*(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, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.1s, OverallIterations: 13, TraceHistogramMax: 10, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 209 SDtfs, 178 SDslu, 1145 SDs, 0 SdLazy, 704 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 30 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 50804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 153/737 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...