/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:36:53,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:36:53,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:36:53,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:36:53,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:36:53,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:36:53,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:36:53,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:36:53,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:36:53,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:36:53,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:36:53,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:36:53,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:36:53,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:36:53,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:36:53,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:36:53,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:36:53,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:36:53,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:36:53,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:36:53,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:36:53,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:36:53,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:36:53,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:36:53,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:36:53,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:36:53,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:36:53,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:36:53,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:36:53,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:36:53,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:36:53,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:36:53,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:36:53,508 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:36:53,509 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:36:53,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:36:53,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:36:53,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:36:53,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:36:53,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:36:53,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:36:53,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:36:53,521 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:36:53,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:36:53,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:36:53,523 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:36:53,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:36:53,523 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:36:53,523 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:36:53,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:36:53,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:36:53,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:36:53,524 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:36:53,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:36:53,525 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:36:53,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:36:53,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:36:53,525 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:36:53,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:36:53,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:36:53,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:36:53,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:36:53,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:36:53,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:36:53,527 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:36:53,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:36:53,809 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:36:53,812 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:36:53,814 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:36:53,814 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:36:53,815 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2020-07-08 23:36:53,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03db4ad1/801075d4aa6e4edf929dc7603969ce6d/FLAG81b4e5816 [2020-07-08 23:36:54,337 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:36:54,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2020-07-08 23:36:54,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03db4ad1/801075d4aa6e4edf929dc7603969ce6d/FLAG81b4e5816 [2020-07-08 23:36:54,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03db4ad1/801075d4aa6e4edf929dc7603969ce6d [2020-07-08 23:36:54,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:36:54,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:36:54,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:54,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:36:54,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:36:54,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:54" (1/1) ... [2020-07-08 23:36:54,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a30042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54, skipping insertion in model container [2020-07-08 23:36:54,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:54" (1/1) ... [2020-07-08 23:36:54,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:36:54,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:36:54,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:54,955 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:36:54,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:54,991 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:36:54,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54 WrapperNode [2020-07-08 23:36:54,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:54,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:36:54,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:36:54,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:36:55,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54" (1/1) ... [2020-07-08 23:36:55,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54" (1/1) ... [2020-07-08 23:36:55,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54" (1/1) ... [2020-07-08 23:36:55,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54" (1/1) ... [2020-07-08 23:36:55,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54" (1/1) ... [2020-07-08 23:36:55,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54" (1/1) ... [2020-07-08 23:36:55,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54" (1/1) ... [2020-07-08 23:36:55,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:36:55,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:36:55,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:36:55,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:36:55,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:36:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:36:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:36:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:36:55,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:36:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:36:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:36:55,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-08 23:36:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:36:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:36:55,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:36:55,386 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:36:55,386 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 23:36:55,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:55 BoogieIcfgContainer [2020-07-08 23:36:55,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:36:55,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:36:55,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:36:55,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:36:55,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:36:54" (1/3) ... [2020-07-08 23:36:55,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb64853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:55, skipping insertion in model container [2020-07-08 23:36:55,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:54" (2/3) ... [2020-07-08 23:36:55,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb64853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:55, skipping insertion in model container [2020-07-08 23:36:55,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:55" (3/3) ... [2020-07-08 23:36:55,400 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2020-07-08 23:36:55,417 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:36:55,425 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:36:55,442 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:36:55,467 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:36:55,468 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:36:55,468 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:36:55,468 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:36:55,470 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:36:55,471 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:36:55,471 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:36:55,471 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:36:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-08 23:36:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 23:36:55,527 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:55,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:55,530 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:55,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1882057920, now seen corresponding path program 1 times [2020-07-08 23:36:55,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:55,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1446711749] [2020-07-08 23:36:55,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:55,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-08 23:36:55,694 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-08 23:36:55,695 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-08 23:36:55,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-08 23:36:55,696 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #44#return; {29#true} is VALID [2020-07-08 23:36:55,697 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret2 := main(); {29#true} is VALID [2020-07-08 23:36:55,697 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} havoc ~i~0; {29#true} is VALID [2020-07-08 23:36:55,698 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {29#true} is VALID [2020-07-08 23:36:55,698 INFO L280 TraceCheckUtils]: 6: Hoare triple {29#true} havoc #t~nondet0; {29#true} is VALID [2020-07-08 23:36:55,698 INFO L280 TraceCheckUtils]: 7: Hoare triple {29#true} ~sn~0 := 0; {29#true} is VALID [2020-07-08 23:36:55,699 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#true} ~i~0 := 1; {29#true} is VALID [2020-07-08 23:36:55,700 INFO L280 TraceCheckUtils]: 9: Hoare triple {29#true} assume !true; {30#false} is VALID [2020-07-08 23:36:55,700 INFO L263 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {30#false} is VALID [2020-07-08 23:36:55,701 INFO L280 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2020-07-08 23:36:55,701 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2020-07-08 23:36:55,702 INFO L280 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-08 23:36:55,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:55,704 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1446711749] [2020-07-08 23:36:55,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:55,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 23:36:55,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814986489] [2020-07-08 23:36:55,713 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-08 23:36:55,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:55,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 23:36:55,748 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-08 23:36:55,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 23:36:55,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:55,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 23:36:55,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:36:55,761 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2020-07-08 23:36:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:55,844 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-08 23:36:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 23:36:55,845 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-08 23:36:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:55,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:36:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-08 23:36:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 23:36:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2020-07-08 23:36:55,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 41 transitions. [2020-07-08 23:36:55,950 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-08 23:36:55,962 INFO L225 Difference]: With dead ends: 37 [2020-07-08 23:36:55,962 INFO L226 Difference]: Without dead ends: 20 [2020-07-08 23:36:55,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 23:36:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-08 23:36:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-08 23:36:56,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:56,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-08 23:36:56,015 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-08 23:36:56,016 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-08 23:36:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:56,020 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-08 23:36:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 23:36:56,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:56,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:56,021 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-08 23:36:56,022 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-08 23:36:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:56,026 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-08 23:36:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 23:36:56,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:56,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:56,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:56,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 23:36:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-08 23:36:56,032 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2020-07-08 23:36:56,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:56,033 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-08 23:36:56,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 23:36:56,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2020-07-08 23:36:56,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-08 23:36:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 23:36:56,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:56,069 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:56,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:36:56,070 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:56,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1869128626, now seen corresponding path program 1 times [2020-07-08 23:36:56,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:56,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353665606] [2020-07-08 23:36:56,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:56,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-08 23:36:56,209 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-08 23:36:56,209 INFO L263 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2020-07-08 23:36:56,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2020-07-08 23:36:56,210 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #44#return; {189#true} is VALID [2020-07-08 23:36:56,210 INFO L263 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2020-07-08 23:36:56,210 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#true} havoc ~i~0; {189#true} is VALID [2020-07-08 23:36:56,211 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {189#true} is VALID [2020-07-08 23:36:56,211 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#true} havoc #t~nondet0; {189#true} is VALID [2020-07-08 23:36:56,212 INFO L280 TraceCheckUtils]: 7: Hoare triple {189#true} ~sn~0 := 0; {193#(= 0 main_~sn~0)} is VALID [2020-07-08 23:36:56,213 INFO L280 TraceCheckUtils]: 8: Hoare triple {193#(= 0 main_~sn~0)} ~i~0 := 1; {193#(= 0 main_~sn~0)} is VALID [2020-07-08 23:36:56,214 INFO L280 TraceCheckUtils]: 9: Hoare triple {193#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {193#(= 0 main_~sn~0)} is VALID [2020-07-08 23:36:56,215 INFO L263 TraceCheckUtils]: 10: Hoare triple {193#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:36:56,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {194#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {195#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:36:56,217 INFO L280 TraceCheckUtils]: 12: Hoare triple {195#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {190#false} is VALID [2020-07-08 23:36:56,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {190#false} assume !false; {190#false} is VALID [2020-07-08 23:36:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:56,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353665606] [2020-07-08 23:36:56,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:56,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:36:56,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612296231] [2020-07-08 23:36:56,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 23:36:56,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:56,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:36:56,243 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-08 23:36:56,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:36:56,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:36:56,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:36:56,245 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2020-07-08 23:36:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:56,390 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-08 23:36:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 23:36:56,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-08 23:36:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-08 23:36:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-08 23:36:56,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-08 23:36:56,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:56,451 INFO L225 Difference]: With dead ends: 31 [2020-07-08 23:36:56,451 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 23:36:56,452 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-08 23:36:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 23:36:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-08 23:36:56,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:56,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2020-07-08 23:36:56,474 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2020-07-08 23:36:56,474 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2020-07-08 23:36:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:56,476 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-08 23:36:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-08 23:36:56,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:56,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:56,477 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2020-07-08 23:36:56,477 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2020-07-08 23:36:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:56,480 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-08 23:36:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-07-08 23:36:56,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:56,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:56,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:56,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 23:36:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-08 23:36:56,484 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2020-07-08 23:36:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:56,484 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-08 23:36:56,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:36:56,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2020-07-08 23:36:56,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 23:36:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-08 23:36:56,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:56,520 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-08 23:36:56,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:36:56,521 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:56,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1535432394, now seen corresponding path program 1 times [2020-07-08 23:36:56,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:56,522 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [267550998] [2020-07-08 23:36:56,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:56,929 INFO L280 TraceCheckUtils]: 0: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-08 23:36:56,929 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-08 23:36:56,930 INFO L263 TraceCheckUtils]: 0: Hoare triple {364#true} call ULTIMATE.init(); {364#true} is VALID [2020-07-08 23:36:56,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {364#true} assume true; {364#true} is VALID [2020-07-08 23:36:56,930 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {364#true} {364#true} #44#return; {364#true} is VALID [2020-07-08 23:36:56,931 INFO L263 TraceCheckUtils]: 3: Hoare triple {364#true} call #t~ret2 := main(); {364#true} is VALID [2020-07-08 23:36:56,931 INFO L280 TraceCheckUtils]: 4: Hoare triple {364#true} havoc ~i~0; {364#true} is VALID [2020-07-08 23:36:56,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {364#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {364#true} is VALID [2020-07-08 23:36:56,932 INFO L280 TraceCheckUtils]: 6: Hoare triple {364#true} havoc #t~nondet0; {364#true} is VALID [2020-07-08 23:36:56,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#true} ~sn~0 := 0; {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-08 23:36:56,935 INFO L280 TraceCheckUtils]: 8: Hoare triple {368#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:56,937 INFO L280 TraceCheckUtils]: 9: Hoare triple {369#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:56,938 INFO L280 TraceCheckUtils]: 10: Hoare triple {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10; {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:56,939 INFO L280 TraceCheckUtils]: 11: Hoare triple {370#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {371#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-08 23:36:56,940 INFO L280 TraceCheckUtils]: 12: Hoare triple {371#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0; {372#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-08 23:36:56,942 INFO L280 TraceCheckUtils]: 13: Hoare triple {372#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-08 23:36:56,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-08 23:36:56,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {373#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {374#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-08 23:36:56,950 INFO L263 TraceCheckUtils]: 16: Hoare triple {374#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {375#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:36:56,951 INFO L280 TraceCheckUtils]: 17: Hoare triple {375#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {376#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:36:56,952 INFO L280 TraceCheckUtils]: 18: Hoare triple {376#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {365#false} is VALID [2020-07-08 23:36:56,953 INFO L280 TraceCheckUtils]: 19: Hoare triple {365#false} assume !false; {365#false} is VALID [2020-07-08 23:36:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:56,958 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [267550998] [2020-07-08 23:36:56,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:36:56,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:36:56,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939842449] [2020-07-08 23:36:56,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-08 23:36:56,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:56,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:36:56,987 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-08 23:36:56,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:36:56,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:56,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:36:56,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:36:56,988 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 11 states. [2020-07-08 23:36:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:57,544 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-07-08 23:36:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:36:57,544 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-07-08 23:36:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:36:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2020-07-08 23:36:57,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:36:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 50 transitions. [2020-07-08 23:36:57,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 50 transitions. [2020-07-08 23:36:57,608 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:57,610 INFO L225 Difference]: With dead ends: 50 [2020-07-08 23:36:57,610 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 23:36:57,611 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2020-07-08 23:36:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 23:36:57,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-07-08 23:36:57,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:57,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 27 states. [2020-07-08 23:36:57,641 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 27 states. [2020-07-08 23:36:57,641 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 27 states. [2020-07-08 23:36:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:57,644 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-08 23:36:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-08 23:36:57,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:57,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:57,645 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 31 states. [2020-07-08 23:36:57,645 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 31 states. [2020-07-08 23:36:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:57,648 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-08 23:36:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-08 23:36:57,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:57,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:57,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:57,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 23:36:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-08 23:36:57,651 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2020-07-08 23:36:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:57,652 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-08 23:36:57,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:36:57,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2020-07-08 23:36:57,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-08 23:36:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 23:36:57,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:57,690 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:57,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:36:57,691 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:57,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash -927596731, now seen corresponding path program 1 times [2020-07-08 23:36:57,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:57,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1354554970] [2020-07-08 23:36:57,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:57,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {605#true} assume true; {605#true} is VALID [2020-07-08 23:36:57,748 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {605#true} {605#true} #44#return; {605#true} is VALID [2020-07-08 23:36:57,748 INFO L263 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2020-07-08 23:36:57,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {605#true} assume true; {605#true} is VALID [2020-07-08 23:36:57,749 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {605#true} {605#true} #44#return; {605#true} is VALID [2020-07-08 23:36:57,749 INFO L263 TraceCheckUtils]: 3: Hoare triple {605#true} call #t~ret2 := main(); {605#true} is VALID [2020-07-08 23:36:57,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {605#true} havoc ~i~0; {605#true} is VALID [2020-07-08 23:36:57,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {605#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {605#true} is VALID [2020-07-08 23:36:57,750 INFO L280 TraceCheckUtils]: 6: Hoare triple {605#true} havoc #t~nondet0; {605#true} is VALID [2020-07-08 23:36:57,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {605#true} ~sn~0 := 0; {605#true} is VALID [2020-07-08 23:36:57,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {605#true} ~i~0 := 1; {609#(<= main_~i~0 1)} is VALID [2020-07-08 23:36:57,752 INFO L280 TraceCheckUtils]: 9: Hoare triple {609#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {609#(<= main_~i~0 1)} is VALID [2020-07-08 23:36:57,752 INFO L280 TraceCheckUtils]: 10: Hoare triple {609#(<= main_~i~0 1)} assume ~i~0 < 10; {609#(<= main_~i~0 1)} is VALID [2020-07-08 23:36:57,753 INFO L280 TraceCheckUtils]: 11: Hoare triple {609#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {609#(<= main_~i~0 1)} is VALID [2020-07-08 23:36:57,754 INFO L280 TraceCheckUtils]: 12: Hoare triple {609#(<= main_~i~0 1)} #t~post1 := ~i~0; {610#(<= |main_#t~post1| 1)} is VALID [2020-07-08 23:36:57,755 INFO L280 TraceCheckUtils]: 13: Hoare triple {610#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {611#(<= main_~i~0 2)} is VALID [2020-07-08 23:36:57,755 INFO L280 TraceCheckUtils]: 14: Hoare triple {611#(<= main_~i~0 2)} havoc #t~post1; {611#(<= main_~i~0 2)} is VALID [2020-07-08 23:36:57,756 INFO L280 TraceCheckUtils]: 15: Hoare triple {611#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {611#(<= main_~i~0 2)} is VALID [2020-07-08 23:36:57,757 INFO L280 TraceCheckUtils]: 16: Hoare triple {611#(<= main_~i~0 2)} assume !(~i~0 < 10); {606#false} is VALID [2020-07-08 23:36:57,757 INFO L280 TraceCheckUtils]: 17: Hoare triple {606#false} #t~post1 := ~i~0; {606#false} is VALID [2020-07-08 23:36:57,757 INFO L280 TraceCheckUtils]: 18: Hoare triple {606#false} ~i~0 := 1 + #t~post1; {606#false} is VALID [2020-07-08 23:36:57,758 INFO L280 TraceCheckUtils]: 19: Hoare triple {606#false} havoc #t~post1; {606#false} is VALID [2020-07-08 23:36:57,758 INFO L280 TraceCheckUtils]: 20: Hoare triple {606#false} assume !(~i~0 <= ~n~0); {606#false} is VALID [2020-07-08 23:36:57,758 INFO L263 TraceCheckUtils]: 21: Hoare triple {606#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {606#false} is VALID [2020-07-08 23:36:57,758 INFO L280 TraceCheckUtils]: 22: Hoare triple {606#false} ~cond := #in~cond; {606#false} is VALID [2020-07-08 23:36:57,759 INFO L280 TraceCheckUtils]: 23: Hoare triple {606#false} assume 0 == ~cond; {606#false} is VALID [2020-07-08 23:36:57,759 INFO L280 TraceCheckUtils]: 24: Hoare triple {606#false} assume !false; {606#false} is VALID [2020-07-08 23:36:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:57,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1354554970] [2020-07-08 23:36:57,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:36:57,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-07-08 23:36:57,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400429620] [2020-07-08 23:36:57,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-08 23:36:57,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:57,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:36:57,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:57,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:36:57,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:57,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:36:57,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:36:57,788 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2020-07-08 23:36:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:57,963 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2020-07-08 23:36:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:36:57,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-07-08 23:36:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-08 23:36:57,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2020-07-08 23:36:57,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2020-07-08 23:36:58,007 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:58,008 INFO L225 Difference]: With dead ends: 42 [2020-07-08 23:36:58,008 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 23:36:58,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:36:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 23:36:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-08 23:36:58,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:58,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-08 23:36:58,045 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-08 23:36:58,045 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-08 23:36:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:58,047 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-08 23:36:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-08 23:36:58,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:58,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:58,048 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-08 23:36:58,048 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-08 23:36:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:58,050 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-07-08 23:36:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2020-07-08 23:36:58,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:58,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:58,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:58,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 23:36:58,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-08 23:36:58,053 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2020-07-08 23:36:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:58,053 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-08 23:36:58,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:36:58,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2020-07-08 23:36:58,091 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-08 23:36:58,091 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-08 23:36:58,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 23:36:58,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:58,093 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-08 23:36:58,093 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:36:58,093 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:58,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:58,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1778100254, now seen corresponding path program 2 times [2020-07-08 23:36:58,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:58,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1554757015] [2020-07-08 23:36:58,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:58,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {820#true} assume true; {820#true} is VALID [2020-07-08 23:36:58,479 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {820#true} {820#true} #44#return; {820#true} is VALID [2020-07-08 23:36:58,479 INFO L263 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2020-07-08 23:36:58,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2020-07-08 23:36:58,480 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #44#return; {820#true} is VALID [2020-07-08 23:36:58,480 INFO L263 TraceCheckUtils]: 3: Hoare triple {820#true} call #t~ret2 := main(); {820#true} is VALID [2020-07-08 23:36:58,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {820#true} havoc ~i~0; {820#true} is VALID [2020-07-08 23:36:58,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {820#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {820#true} is VALID [2020-07-08 23:36:58,481 INFO L280 TraceCheckUtils]: 6: Hoare triple {820#true} havoc #t~nondet0; {820#true} is VALID [2020-07-08 23:36:58,484 INFO L280 TraceCheckUtils]: 7: Hoare triple {820#true} ~sn~0 := 0; {824#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2020-07-08 23:36:58,487 INFO L280 TraceCheckUtils]: 8: Hoare triple {824#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} ~i~0 := 1; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:58,487 INFO L280 TraceCheckUtils]: 9: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:58,488 INFO L280 TraceCheckUtils]: 10: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:58,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {826#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-08 23:36:58,490 INFO L280 TraceCheckUtils]: 12: Hoare triple {826#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0; {827#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} is VALID [2020-07-08 23:36:58,491 INFO L280 TraceCheckUtils]: 13: Hoare triple {827#(and (<= main_~sn~0 (* 2 |main_#t~post1|)) (<= (* 2 |main_#t~post1|) main_~sn~0))} ~i~0 := 1 + #t~post1; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:58,491 INFO L280 TraceCheckUtils]: 14: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} havoc #t~post1; {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:58,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {825#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:58,493 INFO L280 TraceCheckUtils]: 16: Hoare triple {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10; {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 23:36:58,494 INFO L280 TraceCheckUtils]: 17: Hoare triple {828#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} ~sn~0 := 2 + ~sn~0; {829#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-08 23:36:58,495 INFO L280 TraceCheckUtils]: 18: Hoare triple {829#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0; {830#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} is VALID [2020-07-08 23:36:58,496 INFO L280 TraceCheckUtils]: 19: Hoare triple {830#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 |main_#t~post1|) main_~sn~0)))} ~i~0 := 1 + #t~post1; {831#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-08 23:36:58,496 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} havoc #t~post1; {831#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-08 23:36:58,501 INFO L280 TraceCheckUtils]: 21: Hoare triple {831#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {832#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-08 23:36:58,502 INFO L263 TraceCheckUtils]: 22: Hoare triple {832#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {833#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:36:58,502 INFO L280 TraceCheckUtils]: 23: Hoare triple {833#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {834#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:36:58,503 INFO L280 TraceCheckUtils]: 24: Hoare triple {834#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {821#false} is VALID [2020-07-08 23:36:58,503 INFO L280 TraceCheckUtils]: 25: Hoare triple {821#false} assume !false; {821#false} is VALID [2020-07-08 23:36:58,505 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-08 23:36:58,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1554757015] [2020-07-08 23:36:58,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:36:58,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 23:36:58,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048487988] [2020-07-08 23:36:58,507 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-08 23:36:58,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:58,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 23:36:58,550 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-08 23:36:58,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 23:36:58,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 23:36:58,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:36:58,552 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2020-07-08 23:36:59,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:59,328 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-08 23:36:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 23:36:59,328 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-07-08 23:36:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:36:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2020-07-08 23:36:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:36:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 38 transitions. [2020-07-08 23:36:59,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 38 transitions. [2020-07-08 23:36:59,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:59,371 INFO L225 Difference]: With dead ends: 41 [2020-07-08 23:36:59,371 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 23:36:59,372 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-08 23:36:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 23:36:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-07-08 23:36:59,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:59,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2020-07-08 23:36:59,431 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2020-07-08 23:36:59,431 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2020-07-08 23:36:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:59,433 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-08 23:36:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-08 23:36:59,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:59,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:59,434 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2020-07-08 23:36:59,434 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2020-07-08 23:36:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:59,436 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2020-07-08 23:36:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-08 23:36:59,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:59,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:59,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:59,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 23:36:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2020-07-08 23:36:59,439 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 26 [2020-07-08 23:36:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:59,439 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2020-07-08 23:36:59,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 23:36:59,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 36 transitions. [2020-07-08 23:36:59,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-08 23:36:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:36:59,487 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:59,487 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:59,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 23:36:59,488 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1884066515, now seen corresponding path program 2 times [2020-07-08 23:36:59,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:59,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1171641582] [2020-07-08 23:36:59,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:59,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {1077#true} assume true; {1077#true} is VALID [2020-07-08 23:36:59,599 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1077#true} {1077#true} #44#return; {1077#true} is VALID [2020-07-08 23:36:59,599 INFO L263 TraceCheckUtils]: 0: Hoare triple {1077#true} call ULTIMATE.init(); {1077#true} is VALID [2020-07-08 23:36:59,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {1077#true} assume true; {1077#true} is VALID [2020-07-08 23:36:59,600 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1077#true} {1077#true} #44#return; {1077#true} is VALID [2020-07-08 23:36:59,600 INFO L263 TraceCheckUtils]: 3: Hoare triple {1077#true} call #t~ret2 := main(); {1077#true} is VALID [2020-07-08 23:36:59,600 INFO L280 TraceCheckUtils]: 4: Hoare triple {1077#true} havoc ~i~0; {1077#true} is VALID [2020-07-08 23:36:59,601 INFO L280 TraceCheckUtils]: 5: Hoare triple {1077#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1077#true} is VALID [2020-07-08 23:36:59,601 INFO L280 TraceCheckUtils]: 6: Hoare triple {1077#true} havoc #t~nondet0; {1077#true} is VALID [2020-07-08 23:36:59,601 INFO L280 TraceCheckUtils]: 7: Hoare triple {1077#true} ~sn~0 := 0; {1077#true} is VALID [2020-07-08 23:36:59,602 INFO L280 TraceCheckUtils]: 8: Hoare triple {1077#true} ~i~0 := 1; {1081#(<= main_~i~0 1)} is VALID [2020-07-08 23:36:59,602 INFO L280 TraceCheckUtils]: 9: Hoare triple {1081#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1081#(<= main_~i~0 1)} is VALID [2020-07-08 23:36:59,603 INFO L280 TraceCheckUtils]: 10: Hoare triple {1081#(<= main_~i~0 1)} assume ~i~0 < 10; {1081#(<= main_~i~0 1)} is VALID [2020-07-08 23:36:59,603 INFO L280 TraceCheckUtils]: 11: Hoare triple {1081#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1081#(<= main_~i~0 1)} is VALID [2020-07-08 23:36:59,604 INFO L280 TraceCheckUtils]: 12: Hoare triple {1081#(<= main_~i~0 1)} #t~post1 := ~i~0; {1082#(<= |main_#t~post1| 1)} is VALID [2020-07-08 23:36:59,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {1082#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1083#(<= main_~i~0 2)} is VALID [2020-07-08 23:36:59,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {1083#(<= main_~i~0 2)} havoc #t~post1; {1083#(<= main_~i~0 2)} is VALID [2020-07-08 23:36:59,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {1083#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1083#(<= main_~i~0 2)} is VALID [2020-07-08 23:36:59,607 INFO L280 TraceCheckUtils]: 16: Hoare triple {1083#(<= main_~i~0 2)} assume ~i~0 < 10; {1083#(<= main_~i~0 2)} is VALID [2020-07-08 23:36:59,607 INFO L280 TraceCheckUtils]: 17: Hoare triple {1083#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1083#(<= main_~i~0 2)} is VALID [2020-07-08 23:36:59,608 INFO L280 TraceCheckUtils]: 18: Hoare triple {1083#(<= main_~i~0 2)} #t~post1 := ~i~0; {1084#(<= |main_#t~post1| 2)} is VALID [2020-07-08 23:36:59,609 INFO L280 TraceCheckUtils]: 19: Hoare triple {1084#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1085#(<= main_~i~0 3)} is VALID [2020-07-08 23:36:59,610 INFO L280 TraceCheckUtils]: 20: Hoare triple {1085#(<= main_~i~0 3)} havoc #t~post1; {1085#(<= main_~i~0 3)} is VALID [2020-07-08 23:36:59,610 INFO L280 TraceCheckUtils]: 21: Hoare triple {1085#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1085#(<= main_~i~0 3)} is VALID [2020-07-08 23:36:59,611 INFO L280 TraceCheckUtils]: 22: Hoare triple {1085#(<= main_~i~0 3)} assume !(~i~0 < 10); {1078#false} is VALID [2020-07-08 23:36:59,611 INFO L280 TraceCheckUtils]: 23: Hoare triple {1078#false} #t~post1 := ~i~0; {1078#false} is VALID [2020-07-08 23:36:59,611 INFO L280 TraceCheckUtils]: 24: Hoare triple {1078#false} ~i~0 := 1 + #t~post1; {1078#false} is VALID [2020-07-08 23:36:59,612 INFO L280 TraceCheckUtils]: 25: Hoare triple {1078#false} havoc #t~post1; {1078#false} is VALID [2020-07-08 23:36:59,612 INFO L280 TraceCheckUtils]: 26: Hoare triple {1078#false} assume !(~i~0 <= ~n~0); {1078#false} is VALID [2020-07-08 23:36:59,612 INFO L263 TraceCheckUtils]: 27: Hoare triple {1078#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1078#false} is VALID [2020-07-08 23:36:59,612 INFO L280 TraceCheckUtils]: 28: Hoare triple {1078#false} ~cond := #in~cond; {1078#false} is VALID [2020-07-08 23:36:59,613 INFO L280 TraceCheckUtils]: 29: Hoare triple {1078#false} assume 0 == ~cond; {1078#false} is VALID [2020-07-08 23:36:59,613 INFO L280 TraceCheckUtils]: 30: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2020-07-08 23:36:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:59,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1171641582] [2020-07-08 23:36:59,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:36:59,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-08 23:36:59,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311031800] [2020-07-08 23:36:59,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-08 23:36:59,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:59,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 23:36:59,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:59,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 23:36:59,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:59,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 23:36:59,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-08 23:36:59,648 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 7 states. [2020-07-08 23:36:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:59,879 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-08 23:36:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 23:36:59,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-08 23:36:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:36:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-08 23:36:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 23:36:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2020-07-08 23:36:59,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2020-07-08 23:36:59,934 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:59,935 INFO L225 Difference]: With dead ends: 54 [2020-07-08 23:36:59,935 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 23:36:59,936 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:36:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 23:37:00,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-07-08 23:37:00,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:00,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 40 states. [2020-07-08 23:37:00,002 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 40 states. [2020-07-08 23:37:00,003 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 40 states. [2020-07-08 23:37:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:00,008 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-08 23:37:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-08 23:37:00,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:00,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:00,010 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 43 states. [2020-07-08 23:37:00,010 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 43 states. [2020-07-08 23:37:00,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:00,015 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-08 23:37:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-08 23:37:00,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:00,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:00,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:00,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-08 23:37:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2020-07-08 23:37:00,018 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 31 [2020-07-08 23:37:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:00,019 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2020-07-08 23:37:00,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 23:37:00,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 42 transitions. [2020-07-08 23:37:00,084 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-08 23:37:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-08 23:37:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 23:37:00,086 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:00,086 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:00,086 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 23:37:00,087 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:00,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1557187861, now seen corresponding path program 3 times [2020-07-08 23:37:00,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:00,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910563495] [2020-07-08 23:37:00,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:00,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {1370#true} assume true; {1370#true} is VALID [2020-07-08 23:37:00,195 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1370#true} {1370#true} #44#return; {1370#true} is VALID [2020-07-08 23:37:00,195 INFO L263 TraceCheckUtils]: 0: Hoare triple {1370#true} call ULTIMATE.init(); {1370#true} is VALID [2020-07-08 23:37:00,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#true} assume true; {1370#true} is VALID [2020-07-08 23:37:00,196 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1370#true} {1370#true} #44#return; {1370#true} is VALID [2020-07-08 23:37:00,196 INFO L263 TraceCheckUtils]: 3: Hoare triple {1370#true} call #t~ret2 := main(); {1370#true} is VALID [2020-07-08 23:37:00,196 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#true} havoc ~i~0; {1370#true} is VALID [2020-07-08 23:37:00,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {1370#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1370#true} is VALID [2020-07-08 23:37:00,197 INFO L280 TraceCheckUtils]: 6: Hoare triple {1370#true} havoc #t~nondet0; {1370#true} is VALID [2020-07-08 23:37:00,197 INFO L280 TraceCheckUtils]: 7: Hoare triple {1370#true} ~sn~0 := 0; {1370#true} is VALID [2020-07-08 23:37:00,197 INFO L280 TraceCheckUtils]: 8: Hoare triple {1370#true} ~i~0 := 1; {1374#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:00,198 INFO L280 TraceCheckUtils]: 9: Hoare triple {1374#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1374#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:00,198 INFO L280 TraceCheckUtils]: 10: Hoare triple {1374#(<= main_~i~0 1)} assume ~i~0 < 10; {1374#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:00,198 INFO L280 TraceCheckUtils]: 11: Hoare triple {1374#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1374#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:00,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {1374#(<= main_~i~0 1)} #t~post1 := ~i~0; {1375#(<= |main_#t~post1| 1)} is VALID [2020-07-08 23:37:00,206 INFO L280 TraceCheckUtils]: 13: Hoare triple {1375#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1376#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,206 INFO L280 TraceCheckUtils]: 14: Hoare triple {1376#(<= main_~i~0 2)} havoc #t~post1; {1376#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,207 INFO L280 TraceCheckUtils]: 15: Hoare triple {1376#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1376#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,207 INFO L280 TraceCheckUtils]: 16: Hoare triple {1376#(<= main_~i~0 2)} assume ~i~0 < 10; {1376#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,208 INFO L280 TraceCheckUtils]: 17: Hoare triple {1376#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1376#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,208 INFO L280 TraceCheckUtils]: 18: Hoare triple {1376#(<= main_~i~0 2)} #t~post1 := ~i~0; {1377#(<= |main_#t~post1| 2)} is VALID [2020-07-08 23:37:00,209 INFO L280 TraceCheckUtils]: 19: Hoare triple {1377#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1378#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,209 INFO L280 TraceCheckUtils]: 20: Hoare triple {1378#(<= main_~i~0 3)} havoc #t~post1; {1378#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,209 INFO L280 TraceCheckUtils]: 21: Hoare triple {1378#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1378#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,210 INFO L280 TraceCheckUtils]: 22: Hoare triple {1378#(<= main_~i~0 3)} assume ~i~0 < 10; {1378#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,210 INFO L280 TraceCheckUtils]: 23: Hoare triple {1378#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1378#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,211 INFO L280 TraceCheckUtils]: 24: Hoare triple {1378#(<= main_~i~0 3)} #t~post1 := ~i~0; {1379#(<= |main_#t~post1| 3)} is VALID [2020-07-08 23:37:00,212 INFO L280 TraceCheckUtils]: 25: Hoare triple {1379#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {1380#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:00,212 INFO L280 TraceCheckUtils]: 26: Hoare triple {1380#(<= main_~i~0 4)} havoc #t~post1; {1380#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:00,213 INFO L280 TraceCheckUtils]: 27: Hoare triple {1380#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1380#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:00,213 INFO L280 TraceCheckUtils]: 28: Hoare triple {1380#(<= main_~i~0 4)} assume !(~i~0 < 10); {1371#false} is VALID [2020-07-08 23:37:00,213 INFO L280 TraceCheckUtils]: 29: Hoare triple {1371#false} #t~post1 := ~i~0; {1371#false} is VALID [2020-07-08 23:37:00,213 INFO L280 TraceCheckUtils]: 30: Hoare triple {1371#false} ~i~0 := 1 + #t~post1; {1371#false} is VALID [2020-07-08 23:37:00,214 INFO L280 TraceCheckUtils]: 31: Hoare triple {1371#false} havoc #t~post1; {1371#false} is VALID [2020-07-08 23:37:00,214 INFO L280 TraceCheckUtils]: 32: Hoare triple {1371#false} assume !(~i~0 <= ~n~0); {1371#false} is VALID [2020-07-08 23:37:00,214 INFO L263 TraceCheckUtils]: 33: Hoare triple {1371#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1371#false} is VALID [2020-07-08 23:37:00,214 INFO L280 TraceCheckUtils]: 34: Hoare triple {1371#false} ~cond := #in~cond; {1371#false} is VALID [2020-07-08 23:37:00,215 INFO L280 TraceCheckUtils]: 35: Hoare triple {1371#false} assume 0 == ~cond; {1371#false} is VALID [2020-07-08 23:37:00,215 INFO L280 TraceCheckUtils]: 36: Hoare triple {1371#false} assume !false; {1371#false} is VALID [2020-07-08 23:37:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:00,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910563495] [2020-07-08 23:37:00,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:00,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-08 23:37:00,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042038048] [2020-07-08 23:37:00,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-07-08 23:37:00,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:00,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 23:37:00,260 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:00,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 23:37:00,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:00,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 23:37:00,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-08 23:37:00,262 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 9 states. [2020-07-08 23:37:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:00,562 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2020-07-08 23:37:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 23:37:00,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-07-08 23:37:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:37:00,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-08 23:37:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 23:37:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2020-07-08 23:37:00,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2020-07-08 23:37:00,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:00,624 INFO L225 Difference]: With dead ends: 60 [2020-07-08 23:37:00,624 INFO L226 Difference]: Without dead ends: 49 [2020-07-08 23:37:00,625 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:37:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-08 23:37:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2020-07-08 23:37:00,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:00,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2020-07-08 23:37:00,709 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2020-07-08 23:37:00,710 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2020-07-08 23:37:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:00,712 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-08 23:37:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-08 23:37:00,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:00,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:00,713 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2020-07-08 23:37:00,713 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2020-07-08 23:37:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:00,717 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-08 23:37:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-08 23:37:00,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:00,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:00,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:00,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-08 23:37:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-07-08 23:37:00,720 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 37 [2020-07-08 23:37:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:00,721 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-07-08 23:37:00,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 23:37:00,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 48 transitions. [2020-07-08 23:37:00,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-07-08 23:37:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-08 23:37:00,788 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:00,789 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:00,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 23:37:00,789 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:00,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2133811459, now seen corresponding path program 4 times [2020-07-08 23:37:00,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:00,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [232356633] [2020-07-08 23:37:00,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:00,922 INFO L280 TraceCheckUtils]: 0: Hoare triple {1705#true} assume true; {1705#true} is VALID [2020-07-08 23:37:00,923 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1705#true} {1705#true} #44#return; {1705#true} is VALID [2020-07-08 23:37:00,923 INFO L263 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2020-07-08 23:37:00,923 INFO L280 TraceCheckUtils]: 1: Hoare triple {1705#true} assume true; {1705#true} is VALID [2020-07-08 23:37:00,924 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1705#true} {1705#true} #44#return; {1705#true} is VALID [2020-07-08 23:37:00,924 INFO L263 TraceCheckUtils]: 3: Hoare triple {1705#true} call #t~ret2 := main(); {1705#true} is VALID [2020-07-08 23:37:00,924 INFO L280 TraceCheckUtils]: 4: Hoare triple {1705#true} havoc ~i~0; {1705#true} is VALID [2020-07-08 23:37:00,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {1705#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {1705#true} is VALID [2020-07-08 23:37:00,925 INFO L280 TraceCheckUtils]: 6: Hoare triple {1705#true} havoc #t~nondet0; {1705#true} is VALID [2020-07-08 23:37:00,925 INFO L280 TraceCheckUtils]: 7: Hoare triple {1705#true} ~sn~0 := 0; {1705#true} is VALID [2020-07-08 23:37:00,926 INFO L280 TraceCheckUtils]: 8: Hoare triple {1705#true} ~i~0 := 1; {1709#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:00,927 INFO L280 TraceCheckUtils]: 9: Hoare triple {1709#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1709#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:00,927 INFO L280 TraceCheckUtils]: 10: Hoare triple {1709#(<= main_~i~0 1)} assume ~i~0 < 10; {1709#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:00,928 INFO L280 TraceCheckUtils]: 11: Hoare triple {1709#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {1709#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:00,929 INFO L280 TraceCheckUtils]: 12: Hoare triple {1709#(<= main_~i~0 1)} #t~post1 := ~i~0; {1710#(<= |main_#t~post1| 1)} is VALID [2020-07-08 23:37:00,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {1710#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {1711#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,930 INFO L280 TraceCheckUtils]: 14: Hoare triple {1711#(<= main_~i~0 2)} havoc #t~post1; {1711#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,931 INFO L280 TraceCheckUtils]: 15: Hoare triple {1711#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1711#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,932 INFO L280 TraceCheckUtils]: 16: Hoare triple {1711#(<= main_~i~0 2)} assume ~i~0 < 10; {1711#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,933 INFO L280 TraceCheckUtils]: 17: Hoare triple {1711#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {1711#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:00,934 INFO L280 TraceCheckUtils]: 18: Hoare triple {1711#(<= main_~i~0 2)} #t~post1 := ~i~0; {1712#(<= |main_#t~post1| 2)} is VALID [2020-07-08 23:37:00,934 INFO L280 TraceCheckUtils]: 19: Hoare triple {1712#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {1713#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,935 INFO L280 TraceCheckUtils]: 20: Hoare triple {1713#(<= main_~i~0 3)} havoc #t~post1; {1713#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,936 INFO L280 TraceCheckUtils]: 21: Hoare triple {1713#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1713#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,936 INFO L280 TraceCheckUtils]: 22: Hoare triple {1713#(<= main_~i~0 3)} assume ~i~0 < 10; {1713#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,937 INFO L280 TraceCheckUtils]: 23: Hoare triple {1713#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {1713#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:00,937 INFO L280 TraceCheckUtils]: 24: Hoare triple {1713#(<= main_~i~0 3)} #t~post1 := ~i~0; {1714#(<= |main_#t~post1| 3)} is VALID [2020-07-08 23:37:00,938 INFO L280 TraceCheckUtils]: 25: Hoare triple {1714#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {1715#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:00,939 INFO L280 TraceCheckUtils]: 26: Hoare triple {1715#(<= main_~i~0 4)} havoc #t~post1; {1715#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:00,939 INFO L280 TraceCheckUtils]: 27: Hoare triple {1715#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1715#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:00,940 INFO L280 TraceCheckUtils]: 28: Hoare triple {1715#(<= main_~i~0 4)} assume ~i~0 < 10; {1715#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:00,941 INFO L280 TraceCheckUtils]: 29: Hoare triple {1715#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {1715#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:00,942 INFO L280 TraceCheckUtils]: 30: Hoare triple {1715#(<= main_~i~0 4)} #t~post1 := ~i~0; {1716#(<= |main_#t~post1| 4)} is VALID [2020-07-08 23:37:00,943 INFO L280 TraceCheckUtils]: 31: Hoare triple {1716#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {1717#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:00,943 INFO L280 TraceCheckUtils]: 32: Hoare triple {1717#(<= main_~i~0 5)} havoc #t~post1; {1717#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:00,944 INFO L280 TraceCheckUtils]: 33: Hoare triple {1717#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1717#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:00,944 INFO L280 TraceCheckUtils]: 34: Hoare triple {1717#(<= main_~i~0 5)} assume !(~i~0 < 10); {1706#false} is VALID [2020-07-08 23:37:00,945 INFO L280 TraceCheckUtils]: 35: Hoare triple {1706#false} #t~post1 := ~i~0; {1706#false} is VALID [2020-07-08 23:37:00,945 INFO L280 TraceCheckUtils]: 36: Hoare triple {1706#false} ~i~0 := 1 + #t~post1; {1706#false} is VALID [2020-07-08 23:37:00,945 INFO L280 TraceCheckUtils]: 37: Hoare triple {1706#false} havoc #t~post1; {1706#false} is VALID [2020-07-08 23:37:00,946 INFO L280 TraceCheckUtils]: 38: Hoare triple {1706#false} assume !(~i~0 <= ~n~0); {1706#false} is VALID [2020-07-08 23:37:00,946 INFO L263 TraceCheckUtils]: 39: Hoare triple {1706#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1706#false} is VALID [2020-07-08 23:37:00,946 INFO L280 TraceCheckUtils]: 40: Hoare triple {1706#false} ~cond := #in~cond; {1706#false} is VALID [2020-07-08 23:37:00,947 INFO L280 TraceCheckUtils]: 41: Hoare triple {1706#false} assume 0 == ~cond; {1706#false} is VALID [2020-07-08 23:37:00,947 INFO L280 TraceCheckUtils]: 42: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2020-07-08 23:37:00,950 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 17 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:00,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [232356633] [2020-07-08 23:37:00,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:00,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-08 23:37:00,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18686291] [2020-07-08 23:37:00,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2020-07-08 23:37:00,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:00,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 23:37:01,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:01,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 23:37:01,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 23:37:01,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:37:01,005 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 11 states. [2020-07-08 23:37:01,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:01,372 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2020-07-08 23:37:01,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 23:37:01,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2020-07-08 23:37:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:37:01,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2020-07-08 23:37:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 23:37:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 63 transitions. [2020-07-08 23:37:01,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 63 transitions. [2020-07-08 23:37:01,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:01,436 INFO L225 Difference]: With dead ends: 66 [2020-07-08 23:37:01,436 INFO L226 Difference]: Without dead ends: 55 [2020-07-08 23:37:01,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2020-07-08 23:37:01,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-08 23:37:01,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2020-07-08 23:37:01,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:01,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 52 states. [2020-07-08 23:37:01,542 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 52 states. [2020-07-08 23:37:01,542 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 52 states. [2020-07-08 23:37:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:01,545 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-08 23:37:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-08 23:37:01,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:01,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:01,546 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 55 states. [2020-07-08 23:37:01,546 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 55 states. [2020-07-08 23:37:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:01,548 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-07-08 23:37:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-08 23:37:01,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:01,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:01,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:01,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-08 23:37:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2020-07-08 23:37:01,550 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 43 [2020-07-08 23:37:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:01,551 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2020-07-08 23:37:01,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 23:37:01,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2020-07-08 23:37:01,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-08 23:37:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-08 23:37:01,621 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:01,621 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:01,621 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 23:37:01,622 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:01,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:01,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1351967461, now seen corresponding path program 5 times [2020-07-08 23:37:01,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:01,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2025963237] [2020-07-08 23:37:01,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:01,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {2082#true} assume true; {2082#true} is VALID [2020-07-08 23:37:01,781 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2082#true} {2082#true} #44#return; {2082#true} is VALID [2020-07-08 23:37:01,782 INFO L263 TraceCheckUtils]: 0: Hoare triple {2082#true} call ULTIMATE.init(); {2082#true} is VALID [2020-07-08 23:37:01,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {2082#true} assume true; {2082#true} is VALID [2020-07-08 23:37:01,782 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2082#true} {2082#true} #44#return; {2082#true} is VALID [2020-07-08 23:37:01,782 INFO L263 TraceCheckUtils]: 3: Hoare triple {2082#true} call #t~ret2 := main(); {2082#true} is VALID [2020-07-08 23:37:01,782 INFO L280 TraceCheckUtils]: 4: Hoare triple {2082#true} havoc ~i~0; {2082#true} is VALID [2020-07-08 23:37:01,783 INFO L280 TraceCheckUtils]: 5: Hoare triple {2082#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2082#true} is VALID [2020-07-08 23:37:01,783 INFO L280 TraceCheckUtils]: 6: Hoare triple {2082#true} havoc #t~nondet0; {2082#true} is VALID [2020-07-08 23:37:01,783 INFO L280 TraceCheckUtils]: 7: Hoare triple {2082#true} ~sn~0 := 0; {2082#true} is VALID [2020-07-08 23:37:01,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {2082#true} ~i~0 := 1; {2086#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:01,784 INFO L280 TraceCheckUtils]: 9: Hoare triple {2086#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2086#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:01,784 INFO L280 TraceCheckUtils]: 10: Hoare triple {2086#(<= main_~i~0 1)} assume ~i~0 < 10; {2086#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:01,785 INFO L280 TraceCheckUtils]: 11: Hoare triple {2086#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2086#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:01,785 INFO L280 TraceCheckUtils]: 12: Hoare triple {2086#(<= main_~i~0 1)} #t~post1 := ~i~0; {2087#(<= |main_#t~post1| 1)} is VALID [2020-07-08 23:37:01,786 INFO L280 TraceCheckUtils]: 13: Hoare triple {2087#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {2088#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:01,786 INFO L280 TraceCheckUtils]: 14: Hoare triple {2088#(<= main_~i~0 2)} havoc #t~post1; {2088#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:01,787 INFO L280 TraceCheckUtils]: 15: Hoare triple {2088#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2088#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:01,787 INFO L280 TraceCheckUtils]: 16: Hoare triple {2088#(<= main_~i~0 2)} assume ~i~0 < 10; {2088#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:01,787 INFO L280 TraceCheckUtils]: 17: Hoare triple {2088#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2088#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:01,788 INFO L280 TraceCheckUtils]: 18: Hoare triple {2088#(<= main_~i~0 2)} #t~post1 := ~i~0; {2089#(<= |main_#t~post1| 2)} is VALID [2020-07-08 23:37:01,788 INFO L280 TraceCheckUtils]: 19: Hoare triple {2089#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {2090#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:01,789 INFO L280 TraceCheckUtils]: 20: Hoare triple {2090#(<= main_~i~0 3)} havoc #t~post1; {2090#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:01,789 INFO L280 TraceCheckUtils]: 21: Hoare triple {2090#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2090#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:01,790 INFO L280 TraceCheckUtils]: 22: Hoare triple {2090#(<= main_~i~0 3)} assume ~i~0 < 10; {2090#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:01,790 INFO L280 TraceCheckUtils]: 23: Hoare triple {2090#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2090#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:01,791 INFO L280 TraceCheckUtils]: 24: Hoare triple {2090#(<= main_~i~0 3)} #t~post1 := ~i~0; {2091#(<= |main_#t~post1| 3)} is VALID [2020-07-08 23:37:01,793 INFO L280 TraceCheckUtils]: 25: Hoare triple {2091#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {2092#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:01,795 INFO L280 TraceCheckUtils]: 26: Hoare triple {2092#(<= main_~i~0 4)} havoc #t~post1; {2092#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:01,796 INFO L280 TraceCheckUtils]: 27: Hoare triple {2092#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2092#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:01,798 INFO L280 TraceCheckUtils]: 28: Hoare triple {2092#(<= main_~i~0 4)} assume ~i~0 < 10; {2092#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:01,798 INFO L280 TraceCheckUtils]: 29: Hoare triple {2092#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {2092#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:01,799 INFO L280 TraceCheckUtils]: 30: Hoare triple {2092#(<= main_~i~0 4)} #t~post1 := ~i~0; {2093#(<= |main_#t~post1| 4)} is VALID [2020-07-08 23:37:01,799 INFO L280 TraceCheckUtils]: 31: Hoare triple {2093#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {2094#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:01,800 INFO L280 TraceCheckUtils]: 32: Hoare triple {2094#(<= main_~i~0 5)} havoc #t~post1; {2094#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:01,800 INFO L280 TraceCheckUtils]: 33: Hoare triple {2094#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2094#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:01,800 INFO L280 TraceCheckUtils]: 34: Hoare triple {2094#(<= main_~i~0 5)} assume ~i~0 < 10; {2094#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:01,801 INFO L280 TraceCheckUtils]: 35: Hoare triple {2094#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {2094#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:01,801 INFO L280 TraceCheckUtils]: 36: Hoare triple {2094#(<= main_~i~0 5)} #t~post1 := ~i~0; {2095#(<= |main_#t~post1| 5)} is VALID [2020-07-08 23:37:01,802 INFO L280 TraceCheckUtils]: 37: Hoare triple {2095#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {2096#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:01,802 INFO L280 TraceCheckUtils]: 38: Hoare triple {2096#(<= main_~i~0 6)} havoc #t~post1; {2096#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:01,803 INFO L280 TraceCheckUtils]: 39: Hoare triple {2096#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2096#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:01,803 INFO L280 TraceCheckUtils]: 40: Hoare triple {2096#(<= main_~i~0 6)} assume !(~i~0 < 10); {2083#false} is VALID [2020-07-08 23:37:01,803 INFO L280 TraceCheckUtils]: 41: Hoare triple {2083#false} #t~post1 := ~i~0; {2083#false} is VALID [2020-07-08 23:37:01,803 INFO L280 TraceCheckUtils]: 42: Hoare triple {2083#false} ~i~0 := 1 + #t~post1; {2083#false} is VALID [2020-07-08 23:37:01,803 INFO L280 TraceCheckUtils]: 43: Hoare triple {2083#false} havoc #t~post1; {2083#false} is VALID [2020-07-08 23:37:01,804 INFO L280 TraceCheckUtils]: 44: Hoare triple {2083#false} assume !(~i~0 <= ~n~0); {2083#false} is VALID [2020-07-08 23:37:01,804 INFO L263 TraceCheckUtils]: 45: Hoare triple {2083#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2083#false} is VALID [2020-07-08 23:37:01,804 INFO L280 TraceCheckUtils]: 46: Hoare triple {2083#false} ~cond := #in~cond; {2083#false} is VALID [2020-07-08 23:37:01,804 INFO L280 TraceCheckUtils]: 47: Hoare triple {2083#false} assume 0 == ~cond; {2083#false} is VALID [2020-07-08 23:37:01,804 INFO L280 TraceCheckUtils]: 48: Hoare triple {2083#false} assume !false; {2083#false} is VALID [2020-07-08 23:37:01,806 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 21 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:01,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2025963237] [2020-07-08 23:37:01,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:01,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-08 23:37:01,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867721356] [2020-07-08 23:37:01,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2020-07-08 23:37:01,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:01,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 23:37:01,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:01,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 23:37:01,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 23:37:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-08 23:37:01,865 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 13 states. [2020-07-08 23:37:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:02,318 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2020-07-08 23:37:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 23:37:02,318 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2020-07-08 23:37:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:02,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:37:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2020-07-08 23:37:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 23:37:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2020-07-08 23:37:02,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 69 transitions. [2020-07-08 23:37:02,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:02,389 INFO L225 Difference]: With dead ends: 72 [2020-07-08 23:37:02,389 INFO L226 Difference]: Without dead ends: 61 [2020-07-08 23:37:02,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2020-07-08 23:37:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-08 23:37:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-07-08 23:37:02,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:02,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 58 states. [2020-07-08 23:37:02,506 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 58 states. [2020-07-08 23:37:02,506 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 58 states. [2020-07-08 23:37:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:02,508 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-08 23:37:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-08 23:37:02,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:02,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:02,509 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 61 states. [2020-07-08 23:37:02,509 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 61 states. [2020-07-08 23:37:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:02,511 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-08 23:37:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-08 23:37:02,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:02,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:02,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:02,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-08 23:37:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-07-08 23:37:02,514 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 49 [2020-07-08 23:37:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:02,515 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-07-08 23:37:02,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 23:37:02,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 60 transitions. [2020-07-08 23:37:02,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-08 23:37:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-07-08 23:37:02,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:02,588 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:02,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 23:37:02,588 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:02,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:02,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1927178035, now seen corresponding path program 6 times [2020-07-08 23:37:02,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:02,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1840181025] [2020-07-08 23:37:02,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:02,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-08 23:37:02,773 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2501#true} {2501#true} #44#return; {2501#true} is VALID [2020-07-08 23:37:02,774 INFO L263 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2501#true} is VALID [2020-07-08 23:37:02,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-08 23:37:02,774 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2501#true} {2501#true} #44#return; {2501#true} is VALID [2020-07-08 23:37:02,774 INFO L263 TraceCheckUtils]: 3: Hoare triple {2501#true} call #t~ret2 := main(); {2501#true} is VALID [2020-07-08 23:37:02,774 INFO L280 TraceCheckUtils]: 4: Hoare triple {2501#true} havoc ~i~0; {2501#true} is VALID [2020-07-08 23:37:02,774 INFO L280 TraceCheckUtils]: 5: Hoare triple {2501#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2501#true} is VALID [2020-07-08 23:37:02,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {2501#true} havoc #t~nondet0; {2501#true} is VALID [2020-07-08 23:37:02,775 INFO L280 TraceCheckUtils]: 7: Hoare triple {2501#true} ~sn~0 := 0; {2501#true} is VALID [2020-07-08 23:37:02,775 INFO L280 TraceCheckUtils]: 8: Hoare triple {2501#true} ~i~0 := 1; {2505#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:02,776 INFO L280 TraceCheckUtils]: 9: Hoare triple {2505#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2505#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:02,776 INFO L280 TraceCheckUtils]: 10: Hoare triple {2505#(<= main_~i~0 1)} assume ~i~0 < 10; {2505#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:02,780 INFO L280 TraceCheckUtils]: 11: Hoare triple {2505#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2505#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:02,784 INFO L280 TraceCheckUtils]: 12: Hoare triple {2505#(<= main_~i~0 1)} #t~post1 := ~i~0; {2506#(<= |main_#t~post1| 1)} is VALID [2020-07-08 23:37:02,784 INFO L280 TraceCheckUtils]: 13: Hoare triple {2506#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {2507#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:02,785 INFO L280 TraceCheckUtils]: 14: Hoare triple {2507#(<= main_~i~0 2)} havoc #t~post1; {2507#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:02,785 INFO L280 TraceCheckUtils]: 15: Hoare triple {2507#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2507#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:02,785 INFO L280 TraceCheckUtils]: 16: Hoare triple {2507#(<= main_~i~0 2)} assume ~i~0 < 10; {2507#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:02,786 INFO L280 TraceCheckUtils]: 17: Hoare triple {2507#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2507#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:02,786 INFO L280 TraceCheckUtils]: 18: Hoare triple {2507#(<= main_~i~0 2)} #t~post1 := ~i~0; {2508#(<= |main_#t~post1| 2)} is VALID [2020-07-08 23:37:02,787 INFO L280 TraceCheckUtils]: 19: Hoare triple {2508#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {2509#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:02,787 INFO L280 TraceCheckUtils]: 20: Hoare triple {2509#(<= main_~i~0 3)} havoc #t~post1; {2509#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:02,788 INFO L280 TraceCheckUtils]: 21: Hoare triple {2509#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2509#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:02,788 INFO L280 TraceCheckUtils]: 22: Hoare triple {2509#(<= main_~i~0 3)} assume ~i~0 < 10; {2509#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:02,788 INFO L280 TraceCheckUtils]: 23: Hoare triple {2509#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2509#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:02,789 INFO L280 TraceCheckUtils]: 24: Hoare triple {2509#(<= main_~i~0 3)} #t~post1 := ~i~0; {2510#(<= |main_#t~post1| 3)} is VALID [2020-07-08 23:37:02,789 INFO L280 TraceCheckUtils]: 25: Hoare triple {2510#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {2511#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:02,791 INFO L280 TraceCheckUtils]: 26: Hoare triple {2511#(<= main_~i~0 4)} havoc #t~post1; {2511#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:02,792 INFO L280 TraceCheckUtils]: 27: Hoare triple {2511#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2511#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:02,793 INFO L280 TraceCheckUtils]: 28: Hoare triple {2511#(<= main_~i~0 4)} assume ~i~0 < 10; {2511#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:02,793 INFO L280 TraceCheckUtils]: 29: Hoare triple {2511#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {2511#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:02,794 INFO L280 TraceCheckUtils]: 30: Hoare triple {2511#(<= main_~i~0 4)} #t~post1 := ~i~0; {2512#(<= |main_#t~post1| 4)} is VALID [2020-07-08 23:37:02,795 INFO L280 TraceCheckUtils]: 31: Hoare triple {2512#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {2513#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:02,795 INFO L280 TraceCheckUtils]: 32: Hoare triple {2513#(<= main_~i~0 5)} havoc #t~post1; {2513#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:02,796 INFO L280 TraceCheckUtils]: 33: Hoare triple {2513#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2513#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:02,796 INFO L280 TraceCheckUtils]: 34: Hoare triple {2513#(<= main_~i~0 5)} assume ~i~0 < 10; {2513#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:02,797 INFO L280 TraceCheckUtils]: 35: Hoare triple {2513#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {2513#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:02,797 INFO L280 TraceCheckUtils]: 36: Hoare triple {2513#(<= main_~i~0 5)} #t~post1 := ~i~0; {2514#(<= |main_#t~post1| 5)} is VALID [2020-07-08 23:37:02,798 INFO L280 TraceCheckUtils]: 37: Hoare triple {2514#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {2515#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:02,799 INFO L280 TraceCheckUtils]: 38: Hoare triple {2515#(<= main_~i~0 6)} havoc #t~post1; {2515#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:02,799 INFO L280 TraceCheckUtils]: 39: Hoare triple {2515#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2515#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:02,800 INFO L280 TraceCheckUtils]: 40: Hoare triple {2515#(<= main_~i~0 6)} assume ~i~0 < 10; {2515#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:02,800 INFO L280 TraceCheckUtils]: 41: Hoare triple {2515#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {2515#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:02,801 INFO L280 TraceCheckUtils]: 42: Hoare triple {2515#(<= main_~i~0 6)} #t~post1 := ~i~0; {2516#(<= |main_#t~post1| 6)} is VALID [2020-07-08 23:37:02,801 INFO L280 TraceCheckUtils]: 43: Hoare triple {2516#(<= |main_#t~post1| 6)} ~i~0 := 1 + #t~post1; {2517#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:02,802 INFO L280 TraceCheckUtils]: 44: Hoare triple {2517#(<= main_~i~0 7)} havoc #t~post1; {2517#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:02,802 INFO L280 TraceCheckUtils]: 45: Hoare triple {2517#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2517#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:02,803 INFO L280 TraceCheckUtils]: 46: Hoare triple {2517#(<= main_~i~0 7)} assume !(~i~0 < 10); {2502#false} is VALID [2020-07-08 23:37:02,803 INFO L280 TraceCheckUtils]: 47: Hoare triple {2502#false} #t~post1 := ~i~0; {2502#false} is VALID [2020-07-08 23:37:02,803 INFO L280 TraceCheckUtils]: 48: Hoare triple {2502#false} ~i~0 := 1 + #t~post1; {2502#false} is VALID [2020-07-08 23:37:02,803 INFO L280 TraceCheckUtils]: 49: Hoare triple {2502#false} havoc #t~post1; {2502#false} is VALID [2020-07-08 23:37:02,803 INFO L280 TraceCheckUtils]: 50: Hoare triple {2502#false} assume !(~i~0 <= ~n~0); {2502#false} is VALID [2020-07-08 23:37:02,803 INFO L263 TraceCheckUtils]: 51: Hoare triple {2502#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2502#false} is VALID [2020-07-08 23:37:02,803 INFO L280 TraceCheckUtils]: 52: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-08 23:37:02,804 INFO L280 TraceCheckUtils]: 53: Hoare triple {2502#false} assume 0 == ~cond; {2502#false} is VALID [2020-07-08 23:37:02,804 INFO L280 TraceCheckUtils]: 54: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2020-07-08 23:37:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 25 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:02,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1840181025] [2020-07-08 23:37:02,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:02,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-08 23:37:02,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783715618] [2020-07-08 23:37:02,807 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2020-07-08 23:37:02,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:02,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 23:37:02,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:02,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 23:37:02,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:02,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 23:37:02,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-08 23:37:02,870 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 15 states. [2020-07-08 23:37:03,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:03,432 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2020-07-08 23:37:03,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-08 23:37:03,433 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2020-07-08 23:37:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:37:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2020-07-08 23:37:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 23:37:03,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 75 transitions. [2020-07-08 23:37:03,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 75 transitions. [2020-07-08 23:37:03,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:03,520 INFO L225 Difference]: With dead ends: 78 [2020-07-08 23:37:03,521 INFO L226 Difference]: Without dead ends: 67 [2020-07-08 23:37:03,522 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2020-07-08 23:37:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-08 23:37:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2020-07-08 23:37:03,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:03,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 64 states. [2020-07-08 23:37:03,682 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 64 states. [2020-07-08 23:37:03,682 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 64 states. [2020-07-08 23:37:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:03,684 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-07-08 23:37:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2020-07-08 23:37:03,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:03,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:03,684 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 67 states. [2020-07-08 23:37:03,684 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 67 states. [2020-07-08 23:37:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:03,685 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2020-07-08 23:37:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2020-07-08 23:37:03,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:03,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:03,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:03,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-08 23:37:03,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-07-08 23:37:03,687 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 55 [2020-07-08 23:37:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:03,688 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-07-08 23:37:03,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 23:37:03,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 66 transitions. [2020-07-08 23:37:03,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-07-08 23:37:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-08 23:37:03,792 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:03,792 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:03,792 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 23:37:03,792 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:03,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:03,793 INFO L82 PathProgramCache]: Analyzing trace with hash -879247179, now seen corresponding path program 7 times [2020-07-08 23:37:03,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:03,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [571579730] [2020-07-08 23:37:03,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:04,035 INFO L280 TraceCheckUtils]: 0: Hoare triple {2962#true} assume true; {2962#true} is VALID [2020-07-08 23:37:04,035 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2962#true} {2962#true} #44#return; {2962#true} is VALID [2020-07-08 23:37:04,035 INFO L263 TraceCheckUtils]: 0: Hoare triple {2962#true} call ULTIMATE.init(); {2962#true} is VALID [2020-07-08 23:37:04,036 INFO L280 TraceCheckUtils]: 1: Hoare triple {2962#true} assume true; {2962#true} is VALID [2020-07-08 23:37:04,036 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2962#true} {2962#true} #44#return; {2962#true} is VALID [2020-07-08 23:37:04,036 INFO L263 TraceCheckUtils]: 3: Hoare triple {2962#true} call #t~ret2 := main(); {2962#true} is VALID [2020-07-08 23:37:04,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {2962#true} havoc ~i~0; {2962#true} is VALID [2020-07-08 23:37:04,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {2962#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {2962#true} is VALID [2020-07-08 23:37:04,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {2962#true} havoc #t~nondet0; {2962#true} is VALID [2020-07-08 23:37:04,037 INFO L280 TraceCheckUtils]: 7: Hoare triple {2962#true} ~sn~0 := 0; {2962#true} is VALID [2020-07-08 23:37:04,037 INFO L280 TraceCheckUtils]: 8: Hoare triple {2962#true} ~i~0 := 1; {2966#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:04,038 INFO L280 TraceCheckUtils]: 9: Hoare triple {2966#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {2966#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:04,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {2966#(<= main_~i~0 1)} assume ~i~0 < 10; {2966#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:04,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {2966#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {2966#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:04,039 INFO L280 TraceCheckUtils]: 12: Hoare triple {2966#(<= main_~i~0 1)} #t~post1 := ~i~0; {2967#(<= |main_#t~post1| 1)} is VALID [2020-07-08 23:37:04,039 INFO L280 TraceCheckUtils]: 13: Hoare triple {2967#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {2968#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:04,040 INFO L280 TraceCheckUtils]: 14: Hoare triple {2968#(<= main_~i~0 2)} havoc #t~post1; {2968#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:04,040 INFO L280 TraceCheckUtils]: 15: Hoare triple {2968#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {2968#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:04,041 INFO L280 TraceCheckUtils]: 16: Hoare triple {2968#(<= main_~i~0 2)} assume ~i~0 < 10; {2968#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:04,041 INFO L280 TraceCheckUtils]: 17: Hoare triple {2968#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {2968#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:04,042 INFO L280 TraceCheckUtils]: 18: Hoare triple {2968#(<= main_~i~0 2)} #t~post1 := ~i~0; {2969#(<= |main_#t~post1| 2)} is VALID [2020-07-08 23:37:04,042 INFO L280 TraceCheckUtils]: 19: Hoare triple {2969#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {2970#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:04,043 INFO L280 TraceCheckUtils]: 20: Hoare triple {2970#(<= main_~i~0 3)} havoc #t~post1; {2970#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:04,043 INFO L280 TraceCheckUtils]: 21: Hoare triple {2970#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {2970#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:04,044 INFO L280 TraceCheckUtils]: 22: Hoare triple {2970#(<= main_~i~0 3)} assume ~i~0 < 10; {2970#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:04,044 INFO L280 TraceCheckUtils]: 23: Hoare triple {2970#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {2970#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:04,045 INFO L280 TraceCheckUtils]: 24: Hoare triple {2970#(<= main_~i~0 3)} #t~post1 := ~i~0; {2971#(<= |main_#t~post1| 3)} is VALID [2020-07-08 23:37:04,046 INFO L280 TraceCheckUtils]: 25: Hoare triple {2971#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {2972#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:04,046 INFO L280 TraceCheckUtils]: 26: Hoare triple {2972#(<= main_~i~0 4)} havoc #t~post1; {2972#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:04,055 INFO L280 TraceCheckUtils]: 27: Hoare triple {2972#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {2972#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:04,056 INFO L280 TraceCheckUtils]: 28: Hoare triple {2972#(<= main_~i~0 4)} assume ~i~0 < 10; {2972#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:04,056 INFO L280 TraceCheckUtils]: 29: Hoare triple {2972#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {2972#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:04,057 INFO L280 TraceCheckUtils]: 30: Hoare triple {2972#(<= main_~i~0 4)} #t~post1 := ~i~0; {2973#(<= |main_#t~post1| 4)} is VALID [2020-07-08 23:37:04,057 INFO L280 TraceCheckUtils]: 31: Hoare triple {2973#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {2974#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:04,058 INFO L280 TraceCheckUtils]: 32: Hoare triple {2974#(<= main_~i~0 5)} havoc #t~post1; {2974#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:04,058 INFO L280 TraceCheckUtils]: 33: Hoare triple {2974#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {2974#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:04,058 INFO L280 TraceCheckUtils]: 34: Hoare triple {2974#(<= main_~i~0 5)} assume ~i~0 < 10; {2974#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:04,059 INFO L280 TraceCheckUtils]: 35: Hoare triple {2974#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {2974#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:04,059 INFO L280 TraceCheckUtils]: 36: Hoare triple {2974#(<= main_~i~0 5)} #t~post1 := ~i~0; {2975#(<= |main_#t~post1| 5)} is VALID [2020-07-08 23:37:04,060 INFO L280 TraceCheckUtils]: 37: Hoare triple {2975#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {2976#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:04,060 INFO L280 TraceCheckUtils]: 38: Hoare triple {2976#(<= main_~i~0 6)} havoc #t~post1; {2976#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:04,061 INFO L280 TraceCheckUtils]: 39: Hoare triple {2976#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {2976#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:04,061 INFO L280 TraceCheckUtils]: 40: Hoare triple {2976#(<= main_~i~0 6)} assume ~i~0 < 10; {2976#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:04,061 INFO L280 TraceCheckUtils]: 41: Hoare triple {2976#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {2976#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:04,062 INFO L280 TraceCheckUtils]: 42: Hoare triple {2976#(<= main_~i~0 6)} #t~post1 := ~i~0; {2977#(<= |main_#t~post1| 6)} is VALID [2020-07-08 23:37:04,062 INFO L280 TraceCheckUtils]: 43: Hoare triple {2977#(<= |main_#t~post1| 6)} ~i~0 := 1 + #t~post1; {2978#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:04,063 INFO L280 TraceCheckUtils]: 44: Hoare triple {2978#(<= main_~i~0 7)} havoc #t~post1; {2978#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:04,064 INFO L280 TraceCheckUtils]: 45: Hoare triple {2978#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {2978#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:04,064 INFO L280 TraceCheckUtils]: 46: Hoare triple {2978#(<= main_~i~0 7)} assume ~i~0 < 10; {2978#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:04,065 INFO L280 TraceCheckUtils]: 47: Hoare triple {2978#(<= main_~i~0 7)} ~sn~0 := 2 + ~sn~0; {2978#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:04,068 INFO L280 TraceCheckUtils]: 48: Hoare triple {2978#(<= main_~i~0 7)} #t~post1 := ~i~0; {2979#(<= |main_#t~post1| 7)} is VALID [2020-07-08 23:37:04,068 INFO L280 TraceCheckUtils]: 49: Hoare triple {2979#(<= |main_#t~post1| 7)} ~i~0 := 1 + #t~post1; {2980#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:04,069 INFO L280 TraceCheckUtils]: 50: Hoare triple {2980#(<= main_~i~0 8)} havoc #t~post1; {2980#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:04,069 INFO L280 TraceCheckUtils]: 51: Hoare triple {2980#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {2980#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:04,070 INFO L280 TraceCheckUtils]: 52: Hoare triple {2980#(<= main_~i~0 8)} assume !(~i~0 < 10); {2963#false} is VALID [2020-07-08 23:37:04,070 INFO L280 TraceCheckUtils]: 53: Hoare triple {2963#false} #t~post1 := ~i~0; {2963#false} is VALID [2020-07-08 23:37:04,070 INFO L280 TraceCheckUtils]: 54: Hoare triple {2963#false} ~i~0 := 1 + #t~post1; {2963#false} is VALID [2020-07-08 23:37:04,070 INFO L280 TraceCheckUtils]: 55: Hoare triple {2963#false} havoc #t~post1; {2963#false} is VALID [2020-07-08 23:37:04,070 INFO L280 TraceCheckUtils]: 56: Hoare triple {2963#false} assume !(~i~0 <= ~n~0); {2963#false} is VALID [2020-07-08 23:37:04,071 INFO L263 TraceCheckUtils]: 57: Hoare triple {2963#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {2963#false} is VALID [2020-07-08 23:37:04,071 INFO L280 TraceCheckUtils]: 58: Hoare triple {2963#false} ~cond := #in~cond; {2963#false} is VALID [2020-07-08 23:37:04,071 INFO L280 TraceCheckUtils]: 59: Hoare triple {2963#false} assume 0 == ~cond; {2963#false} is VALID [2020-07-08 23:37:04,071 INFO L280 TraceCheckUtils]: 60: Hoare triple {2963#false} assume !false; {2963#false} is VALID [2020-07-08 23:37:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:04,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [571579730] [2020-07-08 23:37:04,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:04,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-08 23:37:04,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853214694] [2020-07-08 23:37:04,075 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-07-08 23:37:04,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:04,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 23:37:04,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:04,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 23:37:04,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 23:37:04,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-07-08 23:37:04,136 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2020-07-08 23:37:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:04,703 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-08 23:37:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-08 23:37:04,703 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2020-07-08 23:37:04,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 23:37:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2020-07-08 23:37:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 23:37:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 81 transitions. [2020-07-08 23:37:04,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 81 transitions. [2020-07-08 23:37:04,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:04,779 INFO L225 Difference]: With dead ends: 84 [2020-07-08 23:37:04,780 INFO L226 Difference]: Without dead ends: 73 [2020-07-08 23:37:04,781 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2020-07-08 23:37:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-08 23:37:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-08 23:37:04,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:04,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 70 states. [2020-07-08 23:37:04,937 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 70 states. [2020-07-08 23:37:04,938 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 70 states. [2020-07-08 23:37:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:04,940 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-08 23:37:04,940 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-08 23:37:04,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:04,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:04,941 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 73 states. [2020-07-08 23:37:04,941 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 73 states. [2020-07-08 23:37:04,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:04,942 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2020-07-08 23:37:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2020-07-08 23:37:04,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:04,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:04,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:04,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-08 23:37:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2020-07-08 23:37:04,945 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 61 [2020-07-08 23:37:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:04,945 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2020-07-08 23:37:04,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 23:37:04,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 72 transitions. [2020-07-08 23:37:05,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2020-07-08 23:37:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-08 23:37:05,058 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:05,058 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:05,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 23:37:05,058 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:05,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash -583378275, now seen corresponding path program 8 times [2020-07-08 23:37:05,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:05,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1734568807] [2020-07-08 23:37:05,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:37:05,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {3465#true} assume true; {3465#true} is VALID [2020-07-08 23:37:05,373 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3465#true} {3465#true} #44#return; {3465#true} is VALID [2020-07-08 23:37:05,374 INFO L263 TraceCheckUtils]: 0: Hoare triple {3465#true} call ULTIMATE.init(); {3465#true} is VALID [2020-07-08 23:37:05,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {3465#true} assume true; {3465#true} is VALID [2020-07-08 23:37:05,374 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3465#true} {3465#true} #44#return; {3465#true} is VALID [2020-07-08 23:37:05,374 INFO L263 TraceCheckUtils]: 3: Hoare triple {3465#true} call #t~ret2 := main(); {3465#true} is VALID [2020-07-08 23:37:05,374 INFO L280 TraceCheckUtils]: 4: Hoare triple {3465#true} havoc ~i~0; {3465#true} is VALID [2020-07-08 23:37:05,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {3465#true} ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); {3465#true} is VALID [2020-07-08 23:37:05,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {3465#true} havoc #t~nondet0; {3465#true} is VALID [2020-07-08 23:37:05,375 INFO L280 TraceCheckUtils]: 7: Hoare triple {3465#true} ~sn~0 := 0; {3465#true} is VALID [2020-07-08 23:37:05,375 INFO L280 TraceCheckUtils]: 8: Hoare triple {3465#true} ~i~0 := 1; {3469#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:05,376 INFO L280 TraceCheckUtils]: 9: Hoare triple {3469#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {3469#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:05,376 INFO L280 TraceCheckUtils]: 10: Hoare triple {3469#(<= main_~i~0 1)} assume ~i~0 < 10; {3469#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:05,376 INFO L280 TraceCheckUtils]: 11: Hoare triple {3469#(<= main_~i~0 1)} ~sn~0 := 2 + ~sn~0; {3469#(<= main_~i~0 1)} is VALID [2020-07-08 23:37:05,377 INFO L280 TraceCheckUtils]: 12: Hoare triple {3469#(<= main_~i~0 1)} #t~post1 := ~i~0; {3470#(<= |main_#t~post1| 1)} is VALID [2020-07-08 23:37:05,377 INFO L280 TraceCheckUtils]: 13: Hoare triple {3470#(<= |main_#t~post1| 1)} ~i~0 := 1 + #t~post1; {3471#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:05,378 INFO L280 TraceCheckUtils]: 14: Hoare triple {3471#(<= main_~i~0 2)} havoc #t~post1; {3471#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:05,378 INFO L280 TraceCheckUtils]: 15: Hoare triple {3471#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {3471#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:05,378 INFO L280 TraceCheckUtils]: 16: Hoare triple {3471#(<= main_~i~0 2)} assume ~i~0 < 10; {3471#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:05,379 INFO L280 TraceCheckUtils]: 17: Hoare triple {3471#(<= main_~i~0 2)} ~sn~0 := 2 + ~sn~0; {3471#(<= main_~i~0 2)} is VALID [2020-07-08 23:37:05,379 INFO L280 TraceCheckUtils]: 18: Hoare triple {3471#(<= main_~i~0 2)} #t~post1 := ~i~0; {3472#(<= |main_#t~post1| 2)} is VALID [2020-07-08 23:37:05,380 INFO L280 TraceCheckUtils]: 19: Hoare triple {3472#(<= |main_#t~post1| 2)} ~i~0 := 1 + #t~post1; {3473#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:05,380 INFO L280 TraceCheckUtils]: 20: Hoare triple {3473#(<= main_~i~0 3)} havoc #t~post1; {3473#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:05,380 INFO L280 TraceCheckUtils]: 21: Hoare triple {3473#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {3473#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:05,381 INFO L280 TraceCheckUtils]: 22: Hoare triple {3473#(<= main_~i~0 3)} assume ~i~0 < 10; {3473#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:05,381 INFO L280 TraceCheckUtils]: 23: Hoare triple {3473#(<= main_~i~0 3)} ~sn~0 := 2 + ~sn~0; {3473#(<= main_~i~0 3)} is VALID [2020-07-08 23:37:05,382 INFO L280 TraceCheckUtils]: 24: Hoare triple {3473#(<= main_~i~0 3)} #t~post1 := ~i~0; {3474#(<= |main_#t~post1| 3)} is VALID [2020-07-08 23:37:05,382 INFO L280 TraceCheckUtils]: 25: Hoare triple {3474#(<= |main_#t~post1| 3)} ~i~0 := 1 + #t~post1; {3475#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:05,382 INFO L280 TraceCheckUtils]: 26: Hoare triple {3475#(<= main_~i~0 4)} havoc #t~post1; {3475#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:05,383 INFO L280 TraceCheckUtils]: 27: Hoare triple {3475#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {3475#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:05,383 INFO L280 TraceCheckUtils]: 28: Hoare triple {3475#(<= main_~i~0 4)} assume ~i~0 < 10; {3475#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:05,384 INFO L280 TraceCheckUtils]: 29: Hoare triple {3475#(<= main_~i~0 4)} ~sn~0 := 2 + ~sn~0; {3475#(<= main_~i~0 4)} is VALID [2020-07-08 23:37:05,384 INFO L280 TraceCheckUtils]: 30: Hoare triple {3475#(<= main_~i~0 4)} #t~post1 := ~i~0; {3476#(<= |main_#t~post1| 4)} is VALID [2020-07-08 23:37:05,385 INFO L280 TraceCheckUtils]: 31: Hoare triple {3476#(<= |main_#t~post1| 4)} ~i~0 := 1 + #t~post1; {3477#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:05,385 INFO L280 TraceCheckUtils]: 32: Hoare triple {3477#(<= main_~i~0 5)} havoc #t~post1; {3477#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:05,385 INFO L280 TraceCheckUtils]: 33: Hoare triple {3477#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {3477#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:05,386 INFO L280 TraceCheckUtils]: 34: Hoare triple {3477#(<= main_~i~0 5)} assume ~i~0 < 10; {3477#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:05,386 INFO L280 TraceCheckUtils]: 35: Hoare triple {3477#(<= main_~i~0 5)} ~sn~0 := 2 + ~sn~0; {3477#(<= main_~i~0 5)} is VALID [2020-07-08 23:37:05,386 INFO L280 TraceCheckUtils]: 36: Hoare triple {3477#(<= main_~i~0 5)} #t~post1 := ~i~0; {3478#(<= |main_#t~post1| 5)} is VALID [2020-07-08 23:37:05,387 INFO L280 TraceCheckUtils]: 37: Hoare triple {3478#(<= |main_#t~post1| 5)} ~i~0 := 1 + #t~post1; {3479#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:05,387 INFO L280 TraceCheckUtils]: 38: Hoare triple {3479#(<= main_~i~0 6)} havoc #t~post1; {3479#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:05,388 INFO L280 TraceCheckUtils]: 39: Hoare triple {3479#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {3479#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:05,388 INFO L280 TraceCheckUtils]: 40: Hoare triple {3479#(<= main_~i~0 6)} assume ~i~0 < 10; {3479#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:05,388 INFO L280 TraceCheckUtils]: 41: Hoare triple {3479#(<= main_~i~0 6)} ~sn~0 := 2 + ~sn~0; {3479#(<= main_~i~0 6)} is VALID [2020-07-08 23:37:05,389 INFO L280 TraceCheckUtils]: 42: Hoare triple {3479#(<= main_~i~0 6)} #t~post1 := ~i~0; {3480#(<= |main_#t~post1| 6)} is VALID [2020-07-08 23:37:05,389 INFO L280 TraceCheckUtils]: 43: Hoare triple {3480#(<= |main_#t~post1| 6)} ~i~0 := 1 + #t~post1; {3481#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:05,390 INFO L280 TraceCheckUtils]: 44: Hoare triple {3481#(<= main_~i~0 7)} havoc #t~post1; {3481#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:05,390 INFO L280 TraceCheckUtils]: 45: Hoare triple {3481#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {3481#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:05,390 INFO L280 TraceCheckUtils]: 46: Hoare triple {3481#(<= main_~i~0 7)} assume ~i~0 < 10; {3481#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:05,391 INFO L280 TraceCheckUtils]: 47: Hoare triple {3481#(<= main_~i~0 7)} ~sn~0 := 2 + ~sn~0; {3481#(<= main_~i~0 7)} is VALID [2020-07-08 23:37:05,391 INFO L280 TraceCheckUtils]: 48: Hoare triple {3481#(<= main_~i~0 7)} #t~post1 := ~i~0; {3482#(<= |main_#t~post1| 7)} is VALID [2020-07-08 23:37:05,392 INFO L280 TraceCheckUtils]: 49: Hoare triple {3482#(<= |main_#t~post1| 7)} ~i~0 := 1 + #t~post1; {3483#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:05,392 INFO L280 TraceCheckUtils]: 50: Hoare triple {3483#(<= main_~i~0 8)} havoc #t~post1; {3483#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:05,392 INFO L280 TraceCheckUtils]: 51: Hoare triple {3483#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {3483#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:05,393 INFO L280 TraceCheckUtils]: 52: Hoare triple {3483#(<= main_~i~0 8)} assume ~i~0 < 10; {3483#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:05,393 INFO L280 TraceCheckUtils]: 53: Hoare triple {3483#(<= main_~i~0 8)} ~sn~0 := 2 + ~sn~0; {3483#(<= main_~i~0 8)} is VALID [2020-07-08 23:37:05,393 INFO L280 TraceCheckUtils]: 54: Hoare triple {3483#(<= main_~i~0 8)} #t~post1 := ~i~0; {3484#(<= |main_#t~post1| 8)} is VALID [2020-07-08 23:37:05,394 INFO L280 TraceCheckUtils]: 55: Hoare triple {3484#(<= |main_#t~post1| 8)} ~i~0 := 1 + #t~post1; {3485#(<= main_~i~0 9)} is VALID [2020-07-08 23:37:05,394 INFO L280 TraceCheckUtils]: 56: Hoare triple {3485#(<= main_~i~0 9)} havoc #t~post1; {3485#(<= main_~i~0 9)} is VALID [2020-07-08 23:37:05,395 INFO L280 TraceCheckUtils]: 57: Hoare triple {3485#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {3485#(<= main_~i~0 9)} is VALID [2020-07-08 23:37:05,395 INFO L280 TraceCheckUtils]: 58: Hoare triple {3485#(<= main_~i~0 9)} assume !(~i~0 < 10); {3466#false} is VALID [2020-07-08 23:37:05,395 INFO L280 TraceCheckUtils]: 59: Hoare triple {3466#false} #t~post1 := ~i~0; {3466#false} is VALID [2020-07-08 23:37:05,395 INFO L280 TraceCheckUtils]: 60: Hoare triple {3466#false} ~i~0 := 1 + #t~post1; {3466#false} is VALID [2020-07-08 23:37:05,396 INFO L280 TraceCheckUtils]: 61: Hoare triple {3466#false} havoc #t~post1; {3466#false} is VALID [2020-07-08 23:37:05,396 INFO L280 TraceCheckUtils]: 62: Hoare triple {3466#false} assume !(~i~0 <= ~n~0); {3466#false} is VALID [2020-07-08 23:37:05,396 INFO L263 TraceCheckUtils]: 63: Hoare triple {3466#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {3466#false} is VALID [2020-07-08 23:37:05,396 INFO L280 TraceCheckUtils]: 64: Hoare triple {3466#false} ~cond := #in~cond; {3466#false} is VALID [2020-07-08 23:37:05,396 INFO L280 TraceCheckUtils]: 65: Hoare triple {3466#false} assume 0 == ~cond; {3466#false} is VALID [2020-07-08 23:37:05,396 INFO L280 TraceCheckUtils]: 66: Hoare triple {3466#false} assume !false; {3466#false} is VALID [2020-07-08 23:37:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 33 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:37:05,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1734568807] [2020-07-08 23:37:05,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:37:05,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-07-08 23:37:05,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450885519] [2020-07-08 23:37:05,400 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2020-07-08 23:37:05,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:37:05,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-08 23:37:05,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:05,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-08 23:37:05,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:37:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-08 23:37:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2020-07-08 23:37:05,470 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2020-07-08 23:37:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:06,247 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2020-07-08 23:37:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-07-08 23:37:06,247 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2020-07-08 23:37:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:37:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 23:37:06,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 86 transitions. [2020-07-08 23:37:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-08 23:37:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 86 transitions. [2020-07-08 23:37:06,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 86 transitions. [2020-07-08 23:37:06,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:06,349 INFO L225 Difference]: With dead ends: 89 [2020-07-08 23:37:06,350 INFO L226 Difference]: Without dead ends: 78 [2020-07-08 23:37:06,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2020-07-08 23:37:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-08 23:37:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-07-08 23:37:06,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:37:06,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 76 states. [2020-07-08 23:37:06,519 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 76 states. [2020-07-08 23:37:06,519 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 76 states. [2020-07-08 23:37:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:06,521 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-07-08 23:37:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-07-08 23:37:06,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:06,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:06,522 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 78 states. [2020-07-08 23:37:06,522 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 78 states. [2020-07-08 23:37:06,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:37:06,523 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2020-07-08 23:37:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-07-08 23:37:06,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:37:06,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:37:06,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:37:06,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:37:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-08 23:37:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2020-07-08 23:37:06,526 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 67 [2020-07-08 23:37:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:37:06,526 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2020-07-08 23:37:06,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-08 23:37:06,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 76 states and 78 transitions. [2020-07-08 23:37:06,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:37:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2020-07-08 23:37:06,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-07-08 23:37:06,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:37:06,643 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:37:06,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-08 23:37:06,644 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:37:06,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:37:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash 929818245, now seen corresponding path program 9 times [2020-07-08 23:37:06,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:37:06,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2143167026] [2020-07-08 23:37:06,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:37:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:37:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:37:06,733 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:37:06,733 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:37:06,734 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-08 23:37:06,765 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:37:06,765 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:37:06,765 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:37:06,765 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:37:06,765 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:37:06,765 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:37:06,765 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:37:06,766 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:37:06,766 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-08 23:37:06,766 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:37:06,766 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 23:37:06,766 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:37:06,766 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2020-07-08 23:37:06,766 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 23:37:06,766 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 23:37:06,766 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: L13-6 has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-08 23:37:06,767 WARN L170 areAnnotationChecker]: L13-7 has no Hoare annotation [2020-07-08 23:37:06,768 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 23:37:06,768 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 23:37:06,768 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-08 23:37:06,768 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:37:06,768 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-08 23:37:06,768 WARN L170 areAnnotationChecker]: L13-5 has no Hoare annotation [2020-07-08 23:37:06,768 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:37:06,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:37:06 BoogieIcfgContainer [2020-07-08 23:37:06,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:37:06,774 INFO L168 Benchmark]: Toolchain (without parser) took 12054.13 ms. Allocated memory was 145.2 MB in the beginning and 341.3 MB in the end (delta: 196.1 MB). Free memory was 104.1 MB in the beginning and 228.7 MB in the end (delta: -124.6 MB). Peak memory consumption was 71.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:06,775 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 23:37:06,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.28 ms. Allocated memory is still 145.2 MB. Free memory was 103.7 MB in the beginning and 93.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:06,776 INFO L168 Benchmark]: Boogie Preprocessor took 29.03 ms. Allocated memory is still 145.2 MB. Free memory was 93.8 MB in the beginning and 92.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:06,777 INFO L168 Benchmark]: RCFGBuilder took 368.22 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 92.3 MB in the beginning and 165.8 MB in the end (delta: -73.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:06,777 INFO L168 Benchmark]: TraceAbstraction took 11379.49 ms. Allocated memory was 201.9 MB in the beginning and 341.3 MB in the end (delta: 139.5 MB). Free memory was 165.1 MB in the beginning and 228.7 MB in the end (delta: -63.7 MB). Peak memory consumption was 75.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:37:06,780 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 268.28 ms. Allocated memory is still 145.2 MB. Free memory was 103.7 MB in the beginning and 93.8 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.03 ms. Allocated memory is still 145.2 MB. Free memory was 93.8 MB in the beginning and 92.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.22 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 92.3 MB in the beginning and 165.8 MB in the end (delta: -73.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11379.49 ms. Allocated memory was 201.9 MB in the beginning and 341.3 MB in the end (delta: 139.5 MB). Free memory was 165.1 MB in the beginning and 228.7 MB in the end (delta: -63.7 MB). Peak memory consumption was 75.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; VAL [__VERIFIER_nondet_uint()=10, n=10] [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; VAL [n=0, n=10] [L13] i=1 VAL [i=1, n=0, n=10] [L13] COND TRUE i<=n VAL [i=1, n=10, n=0] [L14] COND TRUE i<10 VAL [i=1, n=10, n=0] [L15] sn = sn + (2) VAL [i=1, n=10, n=2] [L13] i++ VAL [i=2, n=10, n=2] [L13] COND TRUE i<=n VAL [i=2, n=10, n=2] [L14] COND TRUE i<10 VAL [i=2, n=2, n=10] [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=10, n=4] [L13] COND TRUE i<=n VAL [i=3, n=4, n=10] [L14] COND TRUE i<10 VAL [i=3, n=4, n=10] [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=6, n=10] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 VAL [i=4, n=10, n=6] [L15] sn = sn + (2) VAL [i=4, n=8, n=10] [L13] i++ VAL [i=5, n=10, n=8] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 VAL [i=5, n=8, n=10] [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 VAL [i=6, n=10, n=10] [L15] sn = sn + (2) VAL [i=6, n=12, n=10] [L13] i++ VAL [i=7, n=12, n=10] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 VAL [i=7, n=12, n=10] [L15] sn = sn + (2) VAL [i=7, n=14, n=10] [L13] i++ VAL [i=8, n=14, n=10] [L13] COND TRUE i<=n VAL [i=8, n=14, n=10] [L14] COND TRUE i<10 VAL [i=8, n=14, n=10] [L15] sn = sn + (2) VAL [i=8, n=16, n=10] [L13] i++ VAL [i=9, n=10, n=16] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 VAL [i=9, n=10, n=16] [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=10, n=18] [L13] COND TRUE i<=n VAL [i=10, n=10, n=18] [L14] COND FALSE !(i<10) VAL [i=10, n=18, n=10] [L13] i++ VAL [i=11, n=10, n=18] [L13] COND FALSE !(i<=n) VAL [i=11, n=18, n=10] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.2s, OverallIterations: 13, TraceHistogramMax: 10, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 209 SDtfs, 178 SDslu, 1145 SDs, 0 SdLazy, 704 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 30 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 50804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 153/737 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...