/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_bug02_sum01_bug02_base.case.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:27:55,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:27:55,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:27:55,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:27:55,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:27:55,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:27:55,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:27:55,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:27:55,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:27:55,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:27:55,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:27:55,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:27:55,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:27:55,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:27:55,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:27:55,600 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:27:55,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:27:55,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:27:55,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:27:55,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:27:55,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:27:55,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:27:55,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:27:55,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:27:55,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:27:55,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:27:55,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:27:55,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:27:55,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:27:55,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:27:55,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:27:55,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:27:55,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:27:55,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:27:55,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:27:55,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:27:55,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:27:55,630 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:27:55,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:27:55,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:27:55,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:27:55,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:27:55,660 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:27:55,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:27:55,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:27:55,666 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:27:55,666 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:27:55,666 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:27:55,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:27:55,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:27:55,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:27:55,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:27:55,670 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:27:55,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:27:55,671 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:27:55,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:27:55,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:27:55,671 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:27:55,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:27:55,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:27:55,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:27:55,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:27:55,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:27:55,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:27:55,677 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:27:55,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:27:55,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:27:55,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:27:55,980 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:27:55,980 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:27:55,981 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-11 02:27:56,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972e96bec/a11562d864e243549f9a25d7815950d6/FLAGfc2009939 [2020-07-11 02:27:56,481 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:27:56,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-11 02:27:56,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972e96bec/a11562d864e243549f9a25d7815950d6/FLAGfc2009939 [2020-07-11 02:27:56,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/972e96bec/a11562d864e243549f9a25d7815950d6 [2020-07-11 02:27:56,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:27:56,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:27:56,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:56,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:27:56,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:27:56,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:56" (1/1) ... [2020-07-11 02:27:56,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed40147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:56, skipping insertion in model container [2020-07-11 02:27:56,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:56" (1/1) ... [2020-07-11 02:27:56,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:27:56,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:27:57,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:57,113 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:27:57,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:57,151 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:27:57,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57 WrapperNode [2020-07-11 02:27:57,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:57,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:27:57,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:27:57,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:27:57,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57" (1/1) ... [2020-07-11 02:27:57,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57" (1/1) ... [2020-07-11 02:27:57,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57" (1/1) ... [2020-07-11 02:27:57,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57" (1/1) ... [2020-07-11 02:27:57,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57" (1/1) ... [2020-07-11 02:27:57,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57" (1/1) ... [2020-07-11 02:27:57,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57" (1/1) ... [2020-07-11 02:27:57,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:27:57,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:27:57,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:27:57,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:27:57,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:27:57,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:27:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:27:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:27:57,359 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:27:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:27:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:27:57,359 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-11 02:27:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:27:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:27:57,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:27:57,629 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:27:57,629 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-11 02:27:57,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:57 BoogieIcfgContainer [2020-07-11 02:27:57,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:27:57,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:27:57,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:27:57,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:27:57,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:27:56" (1/3) ... [2020-07-11 02:27:57,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a3d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:57, skipping insertion in model container [2020-07-11 02:27:57,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:57" (2/3) ... [2020-07-11 02:27:57,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@493a3d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:57, skipping insertion in model container [2020-07-11 02:27:57,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:57" (3/3) ... [2020-07-11 02:27:57,643 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2020-07-11 02:27:57,660 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:27:57,670 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:27:57,690 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:27:57,713 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:27:57,713 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:27:57,713 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:27:57,713 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:27:57,714 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:27:57,714 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:27:57,714 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:27:57,714 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:27:57,730 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-07-11 02:27:57,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-11 02:27:57,741 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:57,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:57,742 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:57,752 INFO L82 PathProgramCache]: Analyzing trace with hash -290415040, now seen corresponding path program 1 times [2020-07-11 02:27:57,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:57,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1187821531] [2020-07-11 02:27:57,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:57,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-11 02:27:57,915 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {30#true} {30#true} #45#return; {30#true} is VALID [2020-07-11 02:27:57,916 INFO L263 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2020-07-11 02:27:57,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#true} assume true; {30#true} is VALID [2020-07-11 02:27:57,917 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {30#true} {30#true} #45#return; {30#true} is VALID [2020-07-11 02:27:57,917 INFO L263 TraceCheckUtils]: 3: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2020-07-11 02:27:57,918 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#true} havoc ~i~0; {30#true} is VALID [2020-07-11 02:27:57,918 INFO L280 TraceCheckUtils]: 5: Hoare triple {30#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {30#true} is VALID [2020-07-11 02:27:57,919 INFO L280 TraceCheckUtils]: 6: Hoare triple {30#true} havoc #t~nondet0; {30#true} is VALID [2020-07-11 02:27:57,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {30#true} ~sn~0 := 0; {30#true} is VALID [2020-07-11 02:27:57,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {30#true} ~i~0 := 1; {30#true} is VALID [2020-07-11 02:27:57,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {30#true} assume !true; {31#false} is VALID [2020-07-11 02:27:57,922 INFO L263 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {31#false} is VALID [2020-07-11 02:27:57,923 INFO L280 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2020-07-11 02:27:57,923 INFO L280 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2020-07-11 02:27:57,923 INFO L280 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2020-07-11 02:27:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:57,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1187821531] [2020-07-11 02:27:57,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:57,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-11 02:27:57,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443077452] [2020-07-11 02:27:57,937 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-11 02:27:57,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:57,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-11 02:27:57,979 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-11 02:27:57,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-11 02:27:57,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:57,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-11 02:27:57,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:27:57,992 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2020-07-11 02:27:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,088 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-11 02:27:58,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-11 02:27:58,088 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-11 02:27:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:27:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2020-07-11 02:27:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-11 02:27:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2020-07-11 02:27:58,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 42 transitions. [2020-07-11 02:27:58,214 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-11 02:27:58,227 INFO L225 Difference]: With dead ends: 38 [2020-07-11 02:27:58,228 INFO L226 Difference]: Without dead ends: 21 [2020-07-11 02:27:58,232 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-11 02:27:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-11 02:27:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-11 02:27:58,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:58,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-11 02:27:58,282 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-11 02:27:58,282 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-11 02:27:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,286 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-11 02:27:58,287 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-11 02:27:58,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:58,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:58,288 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-11 02:27:58,288 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-11 02:27:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,292 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-11 02:27:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-11 02:27:58,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:58,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:58,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:58,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-11 02:27:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-11 02:27:58,298 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2020-07-11 02:27:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:58,299 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-11 02:27:58,299 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-11 02:27:58,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2020-07-11 02:27:58,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-11 02:27:58,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-11 02:27:58,337 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:58,337 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:58,338 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:27:58,338 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:58,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:58,338 INFO L82 PathProgramCache]: Analyzing trace with hash -304267855, now seen corresponding path program 1 times [2020-07-11 02:27:58,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:58,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [13553894] [2020-07-11 02:27:58,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:58,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#true} assume true; {196#true} is VALID [2020-07-11 02:27:58,452 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {196#true} {196#true} #45#return; {196#true} is VALID [2020-07-11 02:27:58,453 INFO L263 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2020-07-11 02:27:58,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {196#true} assume true; {196#true} is VALID [2020-07-11 02:27:58,453 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} #45#return; {196#true} is VALID [2020-07-11 02:27:58,454 INFO L263 TraceCheckUtils]: 3: Hoare triple {196#true} call #t~ret2 := main(); {196#true} is VALID [2020-07-11 02:27:58,454 INFO L280 TraceCheckUtils]: 4: Hoare triple {196#true} havoc ~i~0; {196#true} is VALID [2020-07-11 02:27:58,454 INFO L280 TraceCheckUtils]: 5: Hoare triple {196#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {196#true} is VALID [2020-07-11 02:27:58,455 INFO L280 TraceCheckUtils]: 6: Hoare triple {196#true} havoc #t~nondet0; {196#true} is VALID [2020-07-11 02:27:58,456 INFO L280 TraceCheckUtils]: 7: Hoare triple {196#true} ~sn~0 := 0; {200#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:58,457 INFO L280 TraceCheckUtils]: 8: Hoare triple {200#(= 0 main_~sn~0)} ~i~0 := 1; {200#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:58,458 INFO L280 TraceCheckUtils]: 9: Hoare triple {200#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {200#(= 0 main_~sn~0)} is VALID [2020-07-11 02:27:58,459 INFO L263 TraceCheckUtils]: 10: Hoare triple {200#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {201#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:58,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {201#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {202#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:58,462 INFO L280 TraceCheckUtils]: 12: Hoare triple {202#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {197#false} is VALID [2020-07-11 02:27:58,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {197#false} assume !false; {197#false} is VALID [2020-07-11 02:27:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:58,464 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [13553894] [2020-07-11 02:27:58,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:58,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:27:58,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801423007] [2020-07-11 02:27:58,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-11 02:27:58,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:58,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:27:58,491 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-11 02:27:58,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:27:58,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:58,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:27:58,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:27:58,493 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2020-07-11 02:27:58,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,630 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-11 02:27:58,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 02:27:58,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-11 02:27:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-11 02:27:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-11 02:27:58,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2020-07-11 02:27:58,688 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-11 02:27:58,689 INFO L225 Difference]: With dead ends: 28 [2020-07-11 02:27:58,690 INFO L226 Difference]: Without dead ends: 23 [2020-07-11 02:27:58,691 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-11 02:27:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-11 02:27:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-11 02:27:58,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:58,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-11 02:27:58,708 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-11 02:27:58,709 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-11 02:27:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,711 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-11 02:27:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 02:27:58,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:58,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:58,712 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-11 02:27:58,712 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-11 02:27:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:58,715 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-11 02:27:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-11 02:27:58,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:58,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:58,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:58,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-11 02:27:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-11 02:27:58,718 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2020-07-11 02:27:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:58,719 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-11 02:27:58,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:27:58,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2020-07-11 02:27:58,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-11 02:27:58,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-11 02:27:58,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:58,752 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-11 02:27:58,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:27:58,752 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash -887516915, now seen corresponding path program 1 times [2020-07-11 02:27:58,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:58,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [84261566] [2020-07-11 02:27:58,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:59,149 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2020-07-11 02:27:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:59,251 INFO L280 TraceCheckUtils]: 0: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-11 02:27:59,251 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {353#true} {353#true} #45#return; {353#true} is VALID [2020-07-11 02:27:59,251 INFO L263 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {353#true} is VALID [2020-07-11 02:27:59,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2020-07-11 02:27:59,252 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #45#return; {353#true} is VALID [2020-07-11 02:27:59,252 INFO L263 TraceCheckUtils]: 3: Hoare triple {353#true} call #t~ret2 := main(); {353#true} is VALID [2020-07-11 02:27:59,253 INFO L280 TraceCheckUtils]: 4: Hoare triple {353#true} havoc ~i~0; {353#true} is VALID [2020-07-11 02:27:59,253 INFO L280 TraceCheckUtils]: 5: Hoare triple {353#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {353#true} is VALID [2020-07-11 02:27:59,253 INFO L280 TraceCheckUtils]: 6: Hoare triple {353#true} havoc #t~nondet0; {353#true} is VALID [2020-07-11 02:27:59,254 INFO L280 TraceCheckUtils]: 7: Hoare triple {353#true} ~sn~0 := 0; {357#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:27:59,255 INFO L280 TraceCheckUtils]: 8: Hoare triple {357#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {358#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:59,256 INFO L280 TraceCheckUtils]: 9: Hoare triple {358#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {359#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:27:59,258 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {360#(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-11 02:27:59,259 INFO L280 TraceCheckUtils]: 11: Hoare triple {360#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} assume !(4 == ~i~0); {360#(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-11 02:27:59,260 INFO L280 TraceCheckUtils]: 12: Hoare triple {360#(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; {361#(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-11 02:27:59,261 INFO L280 TraceCheckUtils]: 13: Hoare triple {361#(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; {362#(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-11 02:27:59,262 INFO L280 TraceCheckUtils]: 14: Hoare triple {362#(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; {362#(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-11 02:27:59,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {362#(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); {363#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-11 02:27:59,265 INFO L263 TraceCheckUtils]: 16: Hoare triple {363#(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)); {364#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:27:59,265 INFO L280 TraceCheckUtils]: 17: Hoare triple {364#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {365#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:27:59,266 INFO L280 TraceCheckUtils]: 18: Hoare triple {365#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {354#false} is VALID [2020-07-11 02:27:59,267 INFO L280 TraceCheckUtils]: 19: Hoare triple {354#false} assume !false; {354#false} is VALID [2020-07-11 02:27:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:27:59,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [84261566] [2020-07-11 02:27:59,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:27:59,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-11 02:27:59,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410098107] [2020-07-11 02:27:59,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-11 02:27:59,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:59,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-11 02:27:59,295 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-11 02:27:59,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-11 02:27:59,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-11 02:27:59,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:27:59,296 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2020-07-11 02:27:59,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:59,902 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 02:27:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-11 02:27:59,903 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-11 02:27:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2020-07-11 02:27:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-11 02:27:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2020-07-11 02:27:59,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 37 transitions. [2020-07-11 02:27:59,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:59,961 INFO L225 Difference]: With dead ends: 35 [2020-07-11 02:27:59,961 INFO L226 Difference]: Without dead ends: 30 [2020-07-11 02:27:59,965 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-11 02:27:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-11 02:28:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-11 02:28:00,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:00,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-11 02:28:00,013 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-11 02:28:00,014 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-11 02:28:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,021 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-11 02:28:00,021 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-11 02:28:00,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:00,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:00,022 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-11 02:28:00,022 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-11 02:28:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,029 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-11 02:28:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-11 02:28:00,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:00,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:00,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:00,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 02:28:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-11 02:28:00,034 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 20 [2020-07-11 02:28:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:00,035 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-11 02:28:00,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-11 02:28:00,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-11 02:28:00,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-11 02:28:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-11 02:28:00,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:00,076 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, 1] [2020-07-11 02:28:00,077 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:28:00,077 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:00,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash -507920327, now seen corresponding path program 1 times [2020-07-11 02:28:00,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:00,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584053320] [2020-07-11 02:28:00,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:00,129 INFO L280 TraceCheckUtils]: 0: Hoare triple {564#true} assume true; {564#true} is VALID [2020-07-11 02:28:00,130 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {564#true} {564#true} #45#return; {564#true} is VALID [2020-07-11 02:28:00,130 INFO L263 TraceCheckUtils]: 0: Hoare triple {564#true} call ULTIMATE.init(); {564#true} is VALID [2020-07-11 02:28:00,130 INFO L280 TraceCheckUtils]: 1: Hoare triple {564#true} assume true; {564#true} is VALID [2020-07-11 02:28:00,131 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {564#true} {564#true} #45#return; {564#true} is VALID [2020-07-11 02:28:00,131 INFO L263 TraceCheckUtils]: 3: Hoare triple {564#true} call #t~ret2 := main(); {564#true} is VALID [2020-07-11 02:28:00,131 INFO L280 TraceCheckUtils]: 4: Hoare triple {564#true} havoc ~i~0; {564#true} is VALID [2020-07-11 02:28:00,132 INFO L280 TraceCheckUtils]: 5: Hoare triple {564#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {564#true} is VALID [2020-07-11 02:28:00,132 INFO L280 TraceCheckUtils]: 6: Hoare triple {564#true} havoc #t~nondet0; {564#true} is VALID [2020-07-11 02:28:00,132 INFO L280 TraceCheckUtils]: 7: Hoare triple {564#true} ~sn~0 := 0; {564#true} is VALID [2020-07-11 02:28:00,136 INFO L280 TraceCheckUtils]: 8: Hoare triple {564#true} ~i~0 := 1; {568#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:00,136 INFO L280 TraceCheckUtils]: 9: Hoare triple {568#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {568#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:00,137 INFO L280 TraceCheckUtils]: 10: Hoare triple {568#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {568#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:00,137 INFO L280 TraceCheckUtils]: 11: Hoare triple {568#(<= main_~i~0 1)} assume 4 == ~i~0; {565#false} is VALID [2020-07-11 02:28:00,138 INFO L280 TraceCheckUtils]: 12: Hoare triple {565#false} ~sn~0 := -10; {565#false} is VALID [2020-07-11 02:28:00,138 INFO L280 TraceCheckUtils]: 13: Hoare triple {565#false} #t~post1 := ~i~0; {565#false} is VALID [2020-07-11 02:28:00,138 INFO L280 TraceCheckUtils]: 14: Hoare triple {565#false} ~i~0 := 1 + #t~post1; {565#false} is VALID [2020-07-11 02:28:00,138 INFO L280 TraceCheckUtils]: 15: Hoare triple {565#false} havoc #t~post1; {565#false} is VALID [2020-07-11 02:28:00,139 INFO L280 TraceCheckUtils]: 16: Hoare triple {565#false} assume !(~i~0 <= ~n~0); {565#false} is VALID [2020-07-11 02:28:00,139 INFO L263 TraceCheckUtils]: 17: Hoare triple {565#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {565#false} is VALID [2020-07-11 02:28:00,140 INFO L280 TraceCheckUtils]: 18: Hoare triple {565#false} ~cond := #in~cond; {565#false} is VALID [2020-07-11 02:28:00,140 INFO L280 TraceCheckUtils]: 19: Hoare triple {565#false} assume 0 == ~cond; {565#false} is VALID [2020-07-11 02:28:00,140 INFO L280 TraceCheckUtils]: 20: Hoare triple {565#false} assume !false; {565#false} is VALID [2020-07-11 02:28:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:28:00,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1584053320] [2020-07-11 02:28:00,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:28:00,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:28:00,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507238917] [2020-07-11 02:28:00,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-11 02:28:00,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:00,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:28:00,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:00,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:28:00,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:28:00,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:28:00,171 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 3 states. [2020-07-11 02:28:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,278 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-11 02:28:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:28:00,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-11 02:28:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:28:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2020-07-11 02:28:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:28:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2020-07-11 02:28:00,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2020-07-11 02:28:00,323 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-11 02:28:00,324 INFO L225 Difference]: With dead ends: 40 [2020-07-11 02:28:00,324 INFO L226 Difference]: Without dead ends: 28 [2020-07-11 02:28:00,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:28:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-11 02:28:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-11 02:28:00,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:00,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-11 02:28:00,355 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 02:28:00,356 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 02:28:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,358 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-11 02:28:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 02:28:00,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:00,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:00,359 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-11 02:28:00,359 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-11 02:28:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:00,361 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-11 02:28:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 02:28:00,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:00,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:00,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:00,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:00,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-11 02:28:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-11 02:28:00,364 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2020-07-11 02:28:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:00,365 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-11 02:28:00,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:28:00,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-11 02:28:00,394 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-11 02:28:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-11 02:28:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-11 02:28:00,396 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:00,396 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-11 02:28:00,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:28:00,397 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1934159721, now seen corresponding path program 2 times [2020-07-11 02:28:00,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:00,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454316506] [2020-07-11 02:28:00,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:00,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {763#true} assume true; {763#true} is VALID [2020-07-11 02:28:00,822 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {763#true} {763#true} #45#return; {763#true} is VALID [2020-07-11 02:28:00,823 INFO L263 TraceCheckUtils]: 0: Hoare triple {763#true} call ULTIMATE.init(); {763#true} is VALID [2020-07-11 02:28:00,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {763#true} assume true; {763#true} is VALID [2020-07-11 02:28:00,823 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {763#true} {763#true} #45#return; {763#true} is VALID [2020-07-11 02:28:00,823 INFO L263 TraceCheckUtils]: 3: Hoare triple {763#true} call #t~ret2 := main(); {763#true} is VALID [2020-07-11 02:28:00,824 INFO L280 TraceCheckUtils]: 4: Hoare triple {763#true} havoc ~i~0; {763#true} is VALID [2020-07-11 02:28:00,824 INFO L280 TraceCheckUtils]: 5: Hoare triple {763#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {763#true} is VALID [2020-07-11 02:28:00,825 INFO L280 TraceCheckUtils]: 6: Hoare triple {763#true} havoc #t~nondet0; {763#true} is VALID [2020-07-11 02:28:00,826 INFO L280 TraceCheckUtils]: 7: Hoare triple {763#true} ~sn~0 := 0; {767#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-11 02:28:00,827 INFO L280 TraceCheckUtils]: 8: Hoare triple {767#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:28:00,828 INFO L280 TraceCheckUtils]: 9: Hoare triple {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:28:00,828 INFO L280 TraceCheckUtils]: 10: Hoare triple {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {769#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-11 02:28:00,829 INFO L280 TraceCheckUtils]: 11: Hoare triple {769#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} assume !(4 == ~i~0); {769#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-11 02:28:00,830 INFO L280 TraceCheckUtils]: 12: Hoare triple {769#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0; {770#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} is VALID [2020-07-11 02:28:00,832 INFO L280 TraceCheckUtils]: 13: Hoare triple {770#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} ~i~0 := 1 + #t~post1; {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:28:00,833 INFO L280 TraceCheckUtils]: 14: Hoare triple {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} havoc #t~post1; {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:28:00,834 INFO L280 TraceCheckUtils]: 15: Hoare triple {768#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {771#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-11 02:28:00,835 INFO L280 TraceCheckUtils]: 16: Hoare triple {771#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {772#(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-11 02:28:00,836 INFO L280 TraceCheckUtils]: 17: Hoare triple {772#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} assume !(4 == ~i~0); {772#(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-11 02:28:00,837 INFO L280 TraceCheckUtils]: 18: Hoare triple {772#(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; {773#(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-11 02:28:00,839 INFO L280 TraceCheckUtils]: 19: Hoare triple {773#(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; {774#(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-11 02:28:00,840 INFO L280 TraceCheckUtils]: 20: Hoare triple {774#(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; {774#(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-11 02:28:00,840 INFO L280 TraceCheckUtils]: 21: Hoare triple {774#(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); {775#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-11 02:28:00,842 INFO L263 TraceCheckUtils]: 22: Hoare triple {775#(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)); {776#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:28:00,842 INFO L280 TraceCheckUtils]: 23: Hoare triple {776#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {777#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:28:00,843 INFO L280 TraceCheckUtils]: 24: Hoare triple {777#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {764#false} is VALID [2020-07-11 02:28:00,843 INFO L280 TraceCheckUtils]: 25: Hoare triple {764#false} assume !false; {764#false} is VALID [2020-07-11 02:28:00,846 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-11 02:28:00,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454316506] [2020-07-11 02:28:00,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:00,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-11 02:28:00,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679279312] [2020-07-11 02:28:00,848 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-11 02:28:00,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:00,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-11 02:28:00,877 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-11 02:28:00,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-11 02:28:00,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-11 02:28:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-11 02:28:00,879 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2020-07-11 02:28:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:01,659 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-11 02:28:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-11 02:28:01,659 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-11 02:28:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:28:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2020-07-11 02:28:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-11 02:28:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2020-07-11 02:28:01,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 37 transitions. [2020-07-11 02:28:01,702 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:01,704 INFO L225 Difference]: With dead ends: 40 [2020-07-11 02:28:01,704 INFO L226 Difference]: Without dead ends: 35 [2020-07-11 02:28:01,705 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-11 02:28:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-11 02:28:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2020-07-11 02:28:01,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:01,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2020-07-11 02:28:01,741 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2020-07-11 02:28:01,741 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2020-07-11 02:28:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:01,744 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 02:28:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 02:28:01,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:01,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:01,745 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2020-07-11 02:28:01,745 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2020-07-11 02:28:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:01,747 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-11 02:28:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-11 02:28:01,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:01,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:01,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:01,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-11 02:28:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-11 02:28:01,750 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 26 [2020-07-11 02:28:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:01,750 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-11 02:28:01,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-11 02:28:01,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2020-07-11 02:28:01,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-11 02:28:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-11 02:28:01,783 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:01,783 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:01,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:28:01,783 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:01,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1064709469, now seen corresponding path program 1 times [2020-07-11 02:28:01,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:01,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1790412155] [2020-07-11 02:28:01,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:01,850 INFO L280 TraceCheckUtils]: 0: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-11 02:28:01,850 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1008#true} {1008#true} #45#return; {1008#true} is VALID [2020-07-11 02:28:01,851 INFO L263 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2020-07-11 02:28:01,851 INFO L280 TraceCheckUtils]: 1: Hoare triple {1008#true} assume true; {1008#true} is VALID [2020-07-11 02:28:01,851 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1008#true} {1008#true} #45#return; {1008#true} is VALID [2020-07-11 02:28:01,851 INFO L263 TraceCheckUtils]: 3: Hoare triple {1008#true} call #t~ret2 := main(); {1008#true} is VALID [2020-07-11 02:28:01,852 INFO L280 TraceCheckUtils]: 4: Hoare triple {1008#true} havoc ~i~0; {1008#true} is VALID [2020-07-11 02:28:01,852 INFO L280 TraceCheckUtils]: 5: Hoare triple {1008#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1008#true} is VALID [2020-07-11 02:28:01,852 INFO L280 TraceCheckUtils]: 6: Hoare triple {1008#true} havoc #t~nondet0; {1008#true} is VALID [2020-07-11 02:28:01,852 INFO L280 TraceCheckUtils]: 7: Hoare triple {1008#true} ~sn~0 := 0; {1008#true} is VALID [2020-07-11 02:28:01,856 INFO L280 TraceCheckUtils]: 8: Hoare triple {1008#true} ~i~0 := 1; {1012#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,857 INFO L280 TraceCheckUtils]: 9: Hoare triple {1012#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1012#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,858 INFO L280 TraceCheckUtils]: 10: Hoare triple {1012#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1012#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,858 INFO L280 TraceCheckUtils]: 11: Hoare triple {1012#(<= main_~i~0 1)} assume !(4 == ~i~0); {1012#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:01,859 INFO L280 TraceCheckUtils]: 12: Hoare triple {1012#(<= main_~i~0 1)} #t~post1 := ~i~0; {1013#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:28:01,860 INFO L280 TraceCheckUtils]: 13: Hoare triple {1013#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1014#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,875 INFO L280 TraceCheckUtils]: 14: Hoare triple {1014#(<= main_~i~0 2)} havoc #t~post1; {1014#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,877 INFO L280 TraceCheckUtils]: 15: Hoare triple {1014#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1014#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,878 INFO L280 TraceCheckUtils]: 16: Hoare triple {1014#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1014#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:01,879 INFO L280 TraceCheckUtils]: 17: Hoare triple {1014#(<= main_~i~0 2)} assume 4 == ~i~0; {1009#false} is VALID [2020-07-11 02:28:01,880 INFO L280 TraceCheckUtils]: 18: Hoare triple {1009#false} ~sn~0 := -10; {1009#false} is VALID [2020-07-11 02:28:01,880 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#false} #t~post1 := ~i~0; {1009#false} is VALID [2020-07-11 02:28:01,880 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#false} ~i~0 := 1 + #t~post1; {1009#false} is VALID [2020-07-11 02:28:01,880 INFO L280 TraceCheckUtils]: 21: Hoare triple {1009#false} havoc #t~post1; {1009#false} is VALID [2020-07-11 02:28:01,881 INFO L280 TraceCheckUtils]: 22: Hoare triple {1009#false} assume !(~i~0 <= ~n~0); {1009#false} is VALID [2020-07-11 02:28:01,881 INFO L263 TraceCheckUtils]: 23: Hoare triple {1009#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1009#false} is VALID [2020-07-11 02:28:01,882 INFO L280 TraceCheckUtils]: 24: Hoare triple {1009#false} ~cond := #in~cond; {1009#false} is VALID [2020-07-11 02:28:01,882 INFO L280 TraceCheckUtils]: 25: Hoare triple {1009#false} assume 0 == ~cond; {1009#false} is VALID [2020-07-11 02:28:01,883 INFO L280 TraceCheckUtils]: 26: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2020-07-11 02:28:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:28:01,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1790412155] [2020-07-11 02:28:01,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:01,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-11 02:28:01,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074101356] [2020-07-11 02:28:01,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-11 02:28:01,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:01,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:28:01,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:01,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:28:01,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:01,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:28:01,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:28:01,914 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2020-07-11 02:28:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:02,080 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-07-11 02:28:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:28:02,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-11 02:28:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:28:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-11 02:28:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:28:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2020-07-11 02:28:02,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2020-07-11 02:28:02,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:02,128 INFO L225 Difference]: With dead ends: 50 [2020-07-11 02:28:02,129 INFO L226 Difference]: Without dead ends: 38 [2020-07-11 02:28:02,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:28:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-11 02:28:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-11 02:28:02,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:02,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-11 02:28:02,183 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-11 02:28:02,183 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-11 02:28:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:02,185 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-11 02:28:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-11 02:28:02,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:02,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:02,186 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-11 02:28:02,186 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-11 02:28:02,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:02,188 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-11 02:28:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-11 02:28:02,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:02,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:02,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:02,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-11 02:28:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-11 02:28:02,191 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2020-07-11 02:28:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:02,191 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-11 02:28:02,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:28:02,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2020-07-11 02:28:02,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-11 02:28:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 02:28:02,238 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:02,238 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:02,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:28:02,239 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:02,239 INFO L82 PathProgramCache]: Analyzing trace with hash -674418815, now seen corresponding path program 2 times [2020-07-11 02:28:02,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:02,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [727443863] [2020-07-11 02:28:02,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:28:02,356 INFO L280 TraceCheckUtils]: 0: Hoare triple {1269#true} assume true; {1269#true} is VALID [2020-07-11 02:28:02,357 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1269#true} {1269#true} #45#return; {1269#true} is VALID [2020-07-11 02:28:02,357 INFO L263 TraceCheckUtils]: 0: Hoare triple {1269#true} call ULTIMATE.init(); {1269#true} is VALID [2020-07-11 02:28:02,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {1269#true} assume true; {1269#true} is VALID [2020-07-11 02:28:02,358 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1269#true} {1269#true} #45#return; {1269#true} is VALID [2020-07-11 02:28:02,358 INFO L263 TraceCheckUtils]: 3: Hoare triple {1269#true} call #t~ret2 := main(); {1269#true} is VALID [2020-07-11 02:28:02,359 INFO L280 TraceCheckUtils]: 4: Hoare triple {1269#true} havoc ~i~0; {1269#true} is VALID [2020-07-11 02:28:02,359 INFO L280 TraceCheckUtils]: 5: Hoare triple {1269#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1269#true} is VALID [2020-07-11 02:28:02,359 INFO L280 TraceCheckUtils]: 6: Hoare triple {1269#true} havoc #t~nondet0; {1269#true} is VALID [2020-07-11 02:28:02,360 INFO L280 TraceCheckUtils]: 7: Hoare triple {1269#true} ~sn~0 := 0; {1269#true} is VALID [2020-07-11 02:28:02,361 INFO L280 TraceCheckUtils]: 8: Hoare triple {1269#true} ~i~0 := 1; {1273#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:02,362 INFO L280 TraceCheckUtils]: 9: Hoare triple {1273#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1273#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:02,365 INFO L280 TraceCheckUtils]: 10: Hoare triple {1273#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1273#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:02,366 INFO L280 TraceCheckUtils]: 11: Hoare triple {1273#(<= main_~i~0 1)} assume !(4 == ~i~0); {1273#(<= main_~i~0 1)} is VALID [2020-07-11 02:28:02,367 INFO L280 TraceCheckUtils]: 12: Hoare triple {1273#(<= main_~i~0 1)} #t~post1 := ~i~0; {1274#(<= |main_#t~post1| 1)} is VALID [2020-07-11 02:28:02,368 INFO L280 TraceCheckUtils]: 13: Hoare triple {1274#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1275#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:02,369 INFO L280 TraceCheckUtils]: 14: Hoare triple {1275#(<= main_~i~0 2)} havoc #t~post1; {1275#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:02,370 INFO L280 TraceCheckUtils]: 15: Hoare triple {1275#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1275#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:02,370 INFO L280 TraceCheckUtils]: 16: Hoare triple {1275#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1275#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:02,371 INFO L280 TraceCheckUtils]: 17: Hoare triple {1275#(<= main_~i~0 2)} assume !(4 == ~i~0); {1275#(<= main_~i~0 2)} is VALID [2020-07-11 02:28:02,372 INFO L280 TraceCheckUtils]: 18: Hoare triple {1275#(<= main_~i~0 2)} #t~post1 := ~i~0; {1276#(<= |main_#t~post1| 2)} is VALID [2020-07-11 02:28:02,374 INFO L280 TraceCheckUtils]: 19: Hoare triple {1276#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1277#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:02,375 INFO L280 TraceCheckUtils]: 20: Hoare triple {1277#(<= main_~i~0 3)} havoc #t~post1; {1277#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:02,376 INFO L280 TraceCheckUtils]: 21: Hoare triple {1277#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1277#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:02,376 INFO L280 TraceCheckUtils]: 22: Hoare triple {1277#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1277#(<= main_~i~0 3)} is VALID [2020-07-11 02:28:02,377 INFO L280 TraceCheckUtils]: 23: Hoare triple {1277#(<= main_~i~0 3)} assume 4 == ~i~0; {1270#false} is VALID [2020-07-11 02:28:02,378 INFO L280 TraceCheckUtils]: 24: Hoare triple {1270#false} ~sn~0 := -10; {1270#false} is VALID [2020-07-11 02:28:02,378 INFO L280 TraceCheckUtils]: 25: Hoare triple {1270#false} #t~post1 := ~i~0; {1270#false} is VALID [2020-07-11 02:28:02,379 INFO L280 TraceCheckUtils]: 26: Hoare triple {1270#false} ~i~0 := 1 + #t~post1; {1270#false} is VALID [2020-07-11 02:28:02,379 INFO L280 TraceCheckUtils]: 27: Hoare triple {1270#false} havoc #t~post1; {1270#false} is VALID [2020-07-11 02:28:02,379 INFO L280 TraceCheckUtils]: 28: Hoare triple {1270#false} assume !(~i~0 <= ~n~0); {1270#false} is VALID [2020-07-11 02:28:02,380 INFO L263 TraceCheckUtils]: 29: Hoare triple {1270#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1270#false} is VALID [2020-07-11 02:28:02,380 INFO L280 TraceCheckUtils]: 30: Hoare triple {1270#false} ~cond := #in~cond; {1270#false} is VALID [2020-07-11 02:28:02,380 INFO L280 TraceCheckUtils]: 31: Hoare triple {1270#false} assume 0 == ~cond; {1270#false} is VALID [2020-07-11 02:28:02,380 INFO L280 TraceCheckUtils]: 32: Hoare triple {1270#false} assume !false; {1270#false} is VALID [2020-07-11 02:28:02,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:28:02,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [727443863] [2020-07-11 02:28:02,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-11 02:28:02,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-11 02:28:02,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338478205] [2020-07-11 02:28:02,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-11 02:28:02,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:28:02,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:28:02,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:02,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:28:02,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:28:02,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:28:02,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:28:02,428 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 7 states. [2020-07-11 02:28:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:02,729 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2020-07-11 02:28:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-11 02:28:02,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-11 02:28:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:28:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:28:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-11 02:28:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:28:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2020-07-11 02:28:02,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2020-07-11 02:28:02,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:02,792 INFO L225 Difference]: With dead ends: 56 [2020-07-11 02:28:02,793 INFO L226 Difference]: Without dead ends: 44 [2020-07-11 02:28:02,794 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-11 02:28:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-11 02:28:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-07-11 02:28:02,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:28:02,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2020-07-11 02:28:02,873 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2020-07-11 02:28:02,873 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2020-07-11 02:28:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:02,875 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-11 02:28:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-11 02:28:02,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:02,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:02,876 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2020-07-11 02:28:02,876 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2020-07-11 02:28:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:28:02,879 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2020-07-11 02:28:02,879 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-07-11 02:28:02,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:28:02,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:28:02,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:28:02,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:28:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-11 02:28:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-11 02:28:02,882 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 33 [2020-07-11 02:28:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:28:02,882 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-11 02:28:02,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:28:02,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2020-07-11 02:28:02,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:28:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-11 02:28:02,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-11 02:28:02,938 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:28:02,938 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:28:02,938 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:28:02,938 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:28:02,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:28:02,939 INFO L82 PathProgramCache]: Analyzing trace with hash -809826651, now seen corresponding path program 3 times [2020-07-11 02:28:02,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:28:02,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [430663727] [2020-07-11 02:28:02,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:28:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:28:03,020 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 02:28:03,021 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:28:03,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 02:28:03,061 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:28:03,061 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:03,061 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:28:03,061 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:28:03,061 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:28:03,062 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:28:03,062 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:03,062 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:28:03,062 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-11 02:28:03,062 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:28:03,062 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:28:03,062 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:28:03,062 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-11 02:28:03,063 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:03,063 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-11 02:28:03,063 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-11 02:28:03,063 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-11 02:28:03,063 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:28:03,063 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:28:03,063 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:28:03,063 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-11 02:28:03,064 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:28:03,065 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-11 02:28:03,065 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-11 02:28:03,065 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:28:03,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:28:03 BoogieIcfgContainer [2020-07-11 02:28:03,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:28:03,072 INFO L168 Benchmark]: Toolchain (without parser) took 6175.37 ms. Allocated memory was 145.2 MB in the beginning and 277.3 MB in the end (delta: 132.1 MB). Free memory was 102.4 MB in the beginning and 182.6 MB in the end (delta: -80.3 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:03,080 INFO L168 Benchmark]: CDTParser took 1.07 ms. Allocated memory is still 145.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:28:03,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.68 ms. Allocated memory is still 145.2 MB. Free memory was 102.2 MB in the beginning and 92.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:03,082 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 145.2 MB. Free memory was 92.5 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:03,084 INFO L168 Benchmark]: RCFGBuilder took 441.48 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 90.9 MB in the beginning and 167.7 MB in the end (delta: -76.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:03,085 INFO L168 Benchmark]: TraceAbstraction took 5433.30 ms. Allocated memory was 203.4 MB in the beginning and 277.3 MB in the end (delta: 73.9 MB). Free memory was 167.0 MB in the beginning and 182.6 MB in the end (delta: -15.6 MB). Peak memory consumption was 58.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:28:03,097 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 1.07 ms. Allocated memory is still 145.2 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.68 ms. Allocated memory is still 145.2 MB. Free memory was 102.2 MB in the beginning and 92.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 145.2 MB. Free memory was 92.5 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 441.48 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 90.9 MB in the beginning and 167.7 MB in the end (delta: -76.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5433.30 ms. Allocated memory was 203.4 MB in the beginning and 277.3 MB in the end (delta: 73.9 MB). Free memory was 167.0 MB in the beginning and 182.6 MB in the end (delta: -15.6 MB). Peak memory consumption was 58.3 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()=4, n=4] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; VAL [n=0, n=4] [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n VAL [i=1, n=4, n=0] [L14] sn = sn + (2) VAL [i=1, n=2, n=4] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=2, n=4] [L13] COND TRUE i<=n VAL [i=2, n=4, n=2] [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n VAL [i=3, n=4, n=4] [L14] sn = sn + (2) VAL [i=3, n=6, n=4] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=4, n=6] [L13] COND TRUE i<=n VAL [i=4, n=6, n=4] [L14] sn = sn + (2) VAL [i=4, n=4, n=8] [L15] COND TRUE i==4 VAL [i=4, n=8, n=4] [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [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, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 131 SDtfs, 32 SDslu, 379 SDs, 0 SdLazy, 310 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 12824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 16/39 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...