/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:39:49,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:39:49,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:39:49,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:39:49,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:39:49,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:39:49,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:39:49,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:39:49,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:39:49,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:39:49,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:39:49,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:39:49,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:39:49,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:39:49,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:39:49,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:39:49,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:39:49,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:39:49,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:39:49,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:39:49,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:39:49,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:39:49,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:39:49,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:39:49,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:39:49,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:39:49,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:39:49,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:39:49,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:39:49,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:39:49,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:39:49,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:39:49,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:39:49,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:39:49,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:39:49,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:39:49,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:39:49,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:39:49,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:39:49,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:39:49,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:39:49,579 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 17:39:49,594 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:39:49,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:39:49,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:39:49,597 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:39:49,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:39:49,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:39:49,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:39:49,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:39:49,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:39:49,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:39:49,599 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:39:49,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:39:49,600 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:39:49,600 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:39:49,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:39:49,603 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:39:49,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:39:49,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:39:49,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:39:49,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:39:49,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:39:49,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:39:49,604 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:39:49,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:39:49,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:39:49,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:39:49,905 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:39:49,906 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:39:49,907 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2020-07-08 17:39:49,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9916128/e276ec9ad2a849cd8595bf16e23fe736/FLAG9ded95e2e [2020-07-08 17:39:50,431 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:39:50,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2020-07-08 17:39:50,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9916128/e276ec9ad2a849cd8595bf16e23fe736/FLAG9ded95e2e [2020-07-08 17:39:50,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9916128/e276ec9ad2a849cd8595bf16e23fe736 [2020-07-08 17:39:50,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:39:50,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:39:50,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:39:50,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:39:50,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:39:50,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:39:50" (1/1) ... [2020-07-08 17:39:50,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a04e931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:50, skipping insertion in model container [2020-07-08 17:39:50,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:39:50" (1/1) ... [2020-07-08 17:39:50,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:39:50,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:39:51,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:39:51,043 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:39:51,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:39:51,079 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:39:51,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51 WrapperNode [2020-07-08 17:39:51,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:39:51,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:39:51,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:39:51,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:39:51,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51" (1/1) ... [2020-07-08 17:39:51,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51" (1/1) ... [2020-07-08 17:39:51,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51" (1/1) ... [2020-07-08 17:39:51,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51" (1/1) ... [2020-07-08 17:39:51,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51" (1/1) ... [2020-07-08 17:39:51,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51" (1/1) ... [2020-07-08 17:39:51,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51" (1/1) ... [2020-07-08 17:39:51,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:39:51,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:39:51,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:39:51,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:39:51,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51" (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 17:39:51,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:39:51,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:39:51,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 17:39:51,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:39:51,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:39:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 17:39:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 17:39:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:39:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:39:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:39:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:39:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:39:51,595 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:39:51,596 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 17:39:51,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:39:51 BoogieIcfgContainer [2020-07-08 17:39:51,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:39:51,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:39:51,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:39:51,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:39:51,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:39:50" (1/3) ... [2020-07-08 17:39:51,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f27f6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:39:51, skipping insertion in model container [2020-07-08 17:39:51,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:39:51" (2/3) ... [2020-07-08 17:39:51,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f27f6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:39:51, skipping insertion in model container [2020-07-08 17:39:51,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:39:51" (3/3) ... [2020-07-08 17:39:51,609 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.p+cfa-reducer.c [2020-07-08 17:39:51,620 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:39:51,627 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:39:51,642 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:39:51,664 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:39:51,664 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:39:51,664 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:39:51,664 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:39:51,665 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:39:51,665 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:39:51,665 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:39:51,665 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:39:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-07-08 17:39:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 17:39:51,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:51,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:51,695 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:51,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:51,702 INFO L82 PathProgramCache]: Analyzing trace with hash 341466613, now seen corresponding path program 1 times [2020-07-08 17:39:51,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:51,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76059069] [2020-07-08 17:39:51,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:51,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {37#true} is VALID [2020-07-08 17:39:51,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {37#true} ~__return_144~0 := 0; {37#true} is VALID [2020-07-08 17:39:51,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 17:39:51,950 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #55#return; {37#true} is VALID [2020-07-08 17:39:51,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {44#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID [2020-07-08 17:39:51,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {37#true} is VALID [2020-07-08 17:39:51,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {37#true} ~__return_144~0 := 0; {37#true} is VALID [2020-07-08 17:39:51,954 INFO L280 TraceCheckUtils]: 3: Hoare triple {37#true} assume true; {37#true} is VALID [2020-07-08 17:39:51,955 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {37#true} {37#true} #55#return; {37#true} is VALID [2020-07-08 17:39:51,955 INFO L263 TraceCheckUtils]: 5: Hoare triple {37#true} call #t~ret1 := main(); {37#true} is VALID [2020-07-08 17:39:51,956 INFO L280 TraceCheckUtils]: 6: Hoare triple {37#true} havoc ~main__x~0; {37#true} is VALID [2020-07-08 17:39:51,956 INFO L280 TraceCheckUtils]: 7: Hoare triple {37#true} havoc ~main__y~0; {37#true} is VALID [2020-07-08 17:39:51,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {37#true} ~main__x~0 := -50; {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:51,963 INFO L280 TraceCheckUtils]: 9: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:51,965 INFO L280 TraceCheckUtils]: 10: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:51,966 INFO L280 TraceCheckUtils]: 11: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:51,967 INFO L280 TraceCheckUtils]: 12: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:51,969 INFO L280 TraceCheckUtils]: 13: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {43#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:51,970 INFO L280 TraceCheckUtils]: 14: Hoare triple {43#(<= (+ main_~main__x~0 50) 0)} assume !(~main__x~0 < 0); {38#false} is VALID [2020-07-08 17:39:51,971 INFO L280 TraceCheckUtils]: 15: Hoare triple {38#false} havoc ~__tmp_1~0; {38#false} is VALID [2020-07-08 17:39:51,971 INFO L280 TraceCheckUtils]: 16: Hoare triple {38#false} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {38#false} is VALID [2020-07-08 17:39:51,972 INFO L280 TraceCheckUtils]: 17: Hoare triple {38#false} havoc ~__VERIFIER_assert__cond~0; {38#false} is VALID [2020-07-08 17:39:51,972 INFO L280 TraceCheckUtils]: 18: Hoare triple {38#false} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {38#false} is VALID [2020-07-08 17:39:51,973 INFO L280 TraceCheckUtils]: 19: Hoare triple {38#false} assume 0 == ~__VERIFIER_assert__cond~0; {38#false} is VALID [2020-07-08 17:39:51,973 INFO L280 TraceCheckUtils]: 20: Hoare triple {38#false} assume !false; {38#false} is VALID [2020-07-08 17:39:51,977 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 17:39:51,978 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:51,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76059069] [2020-07-08 17:39:51,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:51,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 17:39:51,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750378251] [2020-07-08 17:39:51,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-07-08 17:39:51,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:52,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 17:39:52,052 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 17:39:52,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 17:39:52,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:52,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 17:39:52,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:39:52,066 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2020-07-08 17:39:52,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:52,375 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-08 17:39:52,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 17:39:52,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-07-08 17:39:52,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:39:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2020-07-08 17:39:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:39:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2020-07-08 17:39:52,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 55 transitions. [2020-07-08 17:39:52,498 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 17:39:52,511 INFO L225 Difference]: With dead ends: 51 [2020-07-08 17:39:52,511 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 17:39:52,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:39:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 17:39:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-07-08 17:39:52,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:52,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2020-07-08 17:39:52,621 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2020-07-08 17:39:52,622 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2020-07-08 17:39:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:52,626 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-08 17:39:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 17:39:52,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:52,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:52,627 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2020-07-08 17:39:52,627 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2020-07-08 17:39:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:52,631 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-08 17:39:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-08 17:39:52,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:52,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:52,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:52,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 17:39:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-08 17:39:52,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 21 [2020-07-08 17:39:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:52,638 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-08 17:39:52,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 17:39:52,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2020-07-08 17:39:52,679 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 17:39:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-08 17:39:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 17:39:52,680 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:52,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:52,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:39:52,681 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash 178703795, now seen corresponding path program 1 times [2020-07-08 17:39:52,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:52,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [975920217] [2020-07-08 17:39:52,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:52,879 INFO L280 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {257#true} is VALID [2020-07-08 17:39:52,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {257#true} ~__return_144~0 := 0; {257#true} is VALID [2020-07-08 17:39:52,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-08 17:39:52,880 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #55#return; {257#true} is VALID [2020-07-08 17:39:52,882 INFO L263 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {269#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID [2020-07-08 17:39:52,882 INFO L280 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {257#true} is VALID [2020-07-08 17:39:52,882 INFO L280 TraceCheckUtils]: 2: Hoare triple {257#true} ~__return_144~0 := 0; {257#true} is VALID [2020-07-08 17:39:52,883 INFO L280 TraceCheckUtils]: 3: Hoare triple {257#true} assume true; {257#true} is VALID [2020-07-08 17:39:52,883 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {257#true} {257#true} #55#return; {257#true} is VALID [2020-07-08 17:39:52,883 INFO L263 TraceCheckUtils]: 5: Hoare triple {257#true} call #t~ret1 := main(); {257#true} is VALID [2020-07-08 17:39:52,884 INFO L280 TraceCheckUtils]: 6: Hoare triple {257#true} havoc ~main__x~0; {257#true} is VALID [2020-07-08 17:39:52,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {257#true} havoc ~main__y~0; {257#true} is VALID [2020-07-08 17:39:52,885 INFO L280 TraceCheckUtils]: 8: Hoare triple {257#true} ~main__x~0 := -50; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:52,886 INFO L280 TraceCheckUtils]: 9: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:52,887 INFO L280 TraceCheckUtils]: 10: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:52,888 INFO L280 TraceCheckUtils]: 11: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:52,888 INFO L280 TraceCheckUtils]: 12: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:52,889 INFO L280 TraceCheckUtils]: 13: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:52,890 INFO L280 TraceCheckUtils]: 14: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {263#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:52,891 INFO L280 TraceCheckUtils]: 15: Hoare triple {263#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {264#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 17:39:52,892 INFO L280 TraceCheckUtils]: 16: Hoare triple {264#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {264#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 17:39:52,893 INFO L280 TraceCheckUtils]: 17: Hoare triple {264#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {265#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 17:39:52,894 INFO L280 TraceCheckUtils]: 18: Hoare triple {265#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0); {266#(<= 51 main_~main__y~0)} is VALID [2020-07-08 17:39:52,895 INFO L280 TraceCheckUtils]: 19: Hoare triple {266#(<= 51 main_~main__y~0)} havoc ~__tmp_1~0; {266#(<= 51 main_~main__y~0)} is VALID [2020-07-08 17:39:52,896 INFO L280 TraceCheckUtils]: 20: Hoare triple {266#(<= 51 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {267#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:52,897 INFO L280 TraceCheckUtils]: 21: Hoare triple {267#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {267#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:52,897 INFO L280 TraceCheckUtils]: 22: Hoare triple {267#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {268#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 17:39:52,898 INFO L280 TraceCheckUtils]: 23: Hoare triple {268#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {258#false} is VALID [2020-07-08 17:39:52,898 INFO L280 TraceCheckUtils]: 24: Hoare triple {258#false} assume !false; {258#false} is VALID [2020-07-08 17:39:52,901 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 17:39:52,901 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:52,901 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [975920217] [2020-07-08 17:39:52,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:52,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:39:52,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948006658] [2020-07-08 17:39:52,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 17:39:52,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:52,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:39:52,937 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 17:39:52,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:39:52,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:39:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:39:52,939 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2020-07-08 17:39:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:53,507 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-08 17:39:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 17:39:53,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-08 17:39:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:39:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-08 17:39:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:39:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2020-07-08 17:39:53,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2020-07-08 17:39:53,574 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 17:39:53,576 INFO L225 Difference]: With dead ends: 38 [2020-07-08 17:39:53,576 INFO L226 Difference]: Without dead ends: 31 [2020-07-08 17:39:53,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-07-08 17:39:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-08 17:39:53,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-08 17:39:53,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:53,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2020-07-08 17:39:53,637 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2020-07-08 17:39:53,638 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2020-07-08 17:39:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:53,641 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 17:39:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 17:39:53,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:53,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:53,644 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2020-07-08 17:39:53,644 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2020-07-08 17:39:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:53,649 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2020-07-08 17:39:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-07-08 17:39:53,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:53,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:53,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:53,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 17:39:53,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2020-07-08 17:39:53,656 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2020-07-08 17:39:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:53,657 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2020-07-08 17:39:53,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:39:53,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2020-07-08 17:39:53,694 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2020-07-08 17:39:53,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 17:39:53,695 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:53,696 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, 1, 1, 1, 1] [2020-07-08 17:39:53,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:39:53,696 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:53,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:53,697 INFO L82 PathProgramCache]: Analyzing trace with hash 563687025, now seen corresponding path program 2 times [2020-07-08 17:39:53,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:53,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1897566891] [2020-07-08 17:39:53,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:53,864 INFO L280 TraceCheckUtils]: 0: Hoare triple {496#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {482#true} is VALID [2020-07-08 17:39:53,864 INFO L280 TraceCheckUtils]: 1: Hoare triple {482#true} ~__return_144~0 := 0; {482#true} is VALID [2020-07-08 17:39:53,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#true} assume true; {482#true} is VALID [2020-07-08 17:39:53,865 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {482#true} {482#true} #55#return; {482#true} is VALID [2020-07-08 17:39:53,873 INFO L263 TraceCheckUtils]: 0: Hoare triple {482#true} call ULTIMATE.init(); {496#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID [2020-07-08 17:39:53,874 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {482#true} is VALID [2020-07-08 17:39:53,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {482#true} ~__return_144~0 := 0; {482#true} is VALID [2020-07-08 17:39:53,874 INFO L280 TraceCheckUtils]: 3: Hoare triple {482#true} assume true; {482#true} is VALID [2020-07-08 17:39:53,875 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {482#true} {482#true} #55#return; {482#true} is VALID [2020-07-08 17:39:53,875 INFO L263 TraceCheckUtils]: 5: Hoare triple {482#true} call #t~ret1 := main(); {482#true} is VALID [2020-07-08 17:39:53,875 INFO L280 TraceCheckUtils]: 6: Hoare triple {482#true} havoc ~main__x~0; {482#true} is VALID [2020-07-08 17:39:53,876 INFO L280 TraceCheckUtils]: 7: Hoare triple {482#true} havoc ~main__y~0; {482#true} is VALID [2020-07-08 17:39:53,879 INFO L280 TraceCheckUtils]: 8: Hoare triple {482#true} ~main__x~0 := -50; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:53,883 INFO L280 TraceCheckUtils]: 9: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:53,885 INFO L280 TraceCheckUtils]: 10: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:53,886 INFO L280 TraceCheckUtils]: 11: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:53,887 INFO L280 TraceCheckUtils]: 12: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:53,887 INFO L280 TraceCheckUtils]: 13: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:53,888 INFO L280 TraceCheckUtils]: 14: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {488#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:53,889 INFO L280 TraceCheckUtils]: 15: Hoare triple {488#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {489#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 17:39:53,890 INFO L280 TraceCheckUtils]: 16: Hoare triple {489#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {489#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 17:39:53,891 INFO L280 TraceCheckUtils]: 17: Hoare triple {489#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {490#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 17:39:53,891 INFO L280 TraceCheckUtils]: 18: Hoare triple {490#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0; {490#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 17:39:53,892 INFO L280 TraceCheckUtils]: 19: Hoare triple {490#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {491#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:53,893 INFO L280 TraceCheckUtils]: 20: Hoare triple {491#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {491#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:53,894 INFO L280 TraceCheckUtils]: 21: Hoare triple {491#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {492#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:53,895 INFO L280 TraceCheckUtils]: 22: Hoare triple {492#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0); {493#(<= 27 main_~main__y~0)} is VALID [2020-07-08 17:39:53,896 INFO L280 TraceCheckUtils]: 23: Hoare triple {493#(<= 27 main_~main__y~0)} havoc ~__tmp_1~0; {493#(<= 27 main_~main__y~0)} is VALID [2020-07-08 17:39:53,897 INFO L280 TraceCheckUtils]: 24: Hoare triple {493#(<= 27 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {494#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:53,897 INFO L280 TraceCheckUtils]: 25: Hoare triple {494#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {494#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:53,898 INFO L280 TraceCheckUtils]: 26: Hoare triple {494#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {495#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 17:39:53,899 INFO L280 TraceCheckUtils]: 27: Hoare triple {495#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {483#false} is VALID [2020-07-08 17:39:53,899 INFO L280 TraceCheckUtils]: 28: Hoare triple {483#false} assume !false; {483#false} is VALID [2020-07-08 17:39:53,903 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 17:39:53,903 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:53,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1897566891] [2020-07-08 17:39:53,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:53,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 17:39:53,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730440172] [2020-07-08 17:39:53,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-08 17:39:53,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:53,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 17:39:53,948 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 17:39:53,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 17:39:53,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 17:39:53,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-07-08 17:39:53,950 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 11 states. [2020-07-08 17:39:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:54,649 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 17:39:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 17:39:54,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-08 17:39:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:54,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:39:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2020-07-08 17:39:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:39:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2020-07-08 17:39:54,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2020-07-08 17:39:54,713 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 17:39:54,716 INFO L225 Difference]: With dead ends: 42 [2020-07-08 17:39:54,716 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 17:39:54,720 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2020-07-08 17:39:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 17:39:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-08 17:39:54,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:54,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-08 17:39:54,781 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-08 17:39:54,781 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-08 17:39:54,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:54,784 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 17:39:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 17:39:54,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:54,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:54,785 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-08 17:39:54,785 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-08 17:39:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:54,788 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 17:39:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 17:39:54,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:54,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:54,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:54,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-08 17:39:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-08 17:39:54,792 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 29 [2020-07-08 17:39:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:54,792 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-08 17:39:54,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 17:39:54,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2020-07-08 17:39:54,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:54,829 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-08 17:39:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 17:39:54,830 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:54,830 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:54,830 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:39:54,830 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:54,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:54,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1026490321, now seen corresponding path program 3 times [2020-07-08 17:39:54,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:54,832 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120524012] [2020-07-08 17:39:54,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:55,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {753#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {737#true} is VALID [2020-07-08 17:39:55,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {737#true} ~__return_144~0 := 0; {737#true} is VALID [2020-07-08 17:39:55,027 INFO L280 TraceCheckUtils]: 2: Hoare triple {737#true} assume true; {737#true} is VALID [2020-07-08 17:39:55,027 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {737#true} {737#true} #55#return; {737#true} is VALID [2020-07-08 17:39:55,028 INFO L263 TraceCheckUtils]: 0: Hoare triple {737#true} call ULTIMATE.init(); {753#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID [2020-07-08 17:39:55,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {753#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {737#true} is VALID [2020-07-08 17:39:55,029 INFO L280 TraceCheckUtils]: 2: Hoare triple {737#true} ~__return_144~0 := 0; {737#true} is VALID [2020-07-08 17:39:55,029 INFO L280 TraceCheckUtils]: 3: Hoare triple {737#true} assume true; {737#true} is VALID [2020-07-08 17:39:55,030 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {737#true} {737#true} #55#return; {737#true} is VALID [2020-07-08 17:39:55,030 INFO L263 TraceCheckUtils]: 5: Hoare triple {737#true} call #t~ret1 := main(); {737#true} is VALID [2020-07-08 17:39:55,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {737#true} havoc ~main__x~0; {737#true} is VALID [2020-07-08 17:39:55,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {737#true} havoc ~main__y~0; {737#true} is VALID [2020-07-08 17:39:55,031 INFO L280 TraceCheckUtils]: 8: Hoare triple {737#true} ~main__x~0 := -50; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:55,032 INFO L280 TraceCheckUtils]: 9: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:55,033 INFO L280 TraceCheckUtils]: 10: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:55,033 INFO L280 TraceCheckUtils]: 11: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:55,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:55,035 INFO L280 TraceCheckUtils]: 13: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:55,035 INFO L280 TraceCheckUtils]: 14: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {743#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:55,036 INFO L280 TraceCheckUtils]: 15: Hoare triple {743#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {744#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 17:39:55,037 INFO L280 TraceCheckUtils]: 16: Hoare triple {744#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {744#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 17:39:55,038 INFO L280 TraceCheckUtils]: 17: Hoare triple {744#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {745#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 17:39:55,038 INFO L280 TraceCheckUtils]: 18: Hoare triple {745#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0; {745#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 17:39:55,039 INFO L280 TraceCheckUtils]: 19: Hoare triple {745#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {746#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:55,040 INFO L280 TraceCheckUtils]: 20: Hoare triple {746#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {746#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:55,053 INFO L280 TraceCheckUtils]: 21: Hoare triple {746#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {747#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:55,054 INFO L280 TraceCheckUtils]: 22: Hoare triple {747#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume ~main__x~0 < 0; {747#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:55,055 INFO L280 TraceCheckUtils]: 23: Hoare triple {747#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main__x~0 := ~main__x~0 + ~main__y~0; {748#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-08 17:39:55,056 INFO L280 TraceCheckUtils]: 24: Hoare triple {748#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {748#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-08 17:39:55,057 INFO L280 TraceCheckUtils]: 25: Hoare triple {748#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {749#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-08 17:39:55,058 INFO L280 TraceCheckUtils]: 26: Hoare triple {749#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} assume !(~main__x~0 < 0); {750#(<= 19 main_~main__y~0)} is VALID [2020-07-08 17:39:55,059 INFO L280 TraceCheckUtils]: 27: Hoare triple {750#(<= 19 main_~main__y~0)} havoc ~__tmp_1~0; {750#(<= 19 main_~main__y~0)} is VALID [2020-07-08 17:39:55,060 INFO L280 TraceCheckUtils]: 28: Hoare triple {750#(<= 19 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {751#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:55,060 INFO L280 TraceCheckUtils]: 29: Hoare triple {751#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {751#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:55,061 INFO L280 TraceCheckUtils]: 30: Hoare triple {751#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {752#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 17:39:55,062 INFO L280 TraceCheckUtils]: 31: Hoare triple {752#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {738#false} is VALID [2020-07-08 17:39:55,062 INFO L280 TraceCheckUtils]: 32: Hoare triple {738#false} assume !false; {738#false} is VALID [2020-07-08 17:39:55,065 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 17:39:55,065 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:55,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120524012] [2020-07-08 17:39:55,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:55,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-08 17:39:55,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376913338] [2020-07-08 17:39:55,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-08 17:39:55,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:55,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 17:39:55,101 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 17:39:55,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 17:39:55,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:55,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 17:39:55,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-08 17:39:55,102 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 13 states. [2020-07-08 17:39:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:55,903 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2020-07-08 17:39:55,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 17:39:55,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2020-07-08 17:39:55,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:39:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2020-07-08 17:39:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:39:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2020-07-08 17:39:55,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 46 transitions. [2020-07-08 17:39:55,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:55,993 INFO L225 Difference]: With dead ends: 46 [2020-07-08 17:39:55,993 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 17:39:55,995 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2020-07-08 17:39:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 17:39:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2020-07-08 17:39:56,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:56,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2020-07-08 17:39:56,058 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2020-07-08 17:39:56,058 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2020-07-08 17:39:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:56,064 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-08 17:39:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-07-08 17:39:56,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:56,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:56,066 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2020-07-08 17:39:56,066 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2020-07-08 17:39:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:56,071 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-07-08 17:39:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-07-08 17:39:56,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:56,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:56,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:56,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-07-08 17:39:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-07-08 17:39:56,078 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 33 [2020-07-08 17:39:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:56,078 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-07-08 17:39:56,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 17:39:56,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2020-07-08 17:39:56,132 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 17:39:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-08 17:39:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 17:39:56,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:56,134 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:56,135 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:39:56,135 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:56,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:56,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2083373805, now seen corresponding path program 4 times [2020-07-08 17:39:56,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:56,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [118618829] [2020-07-08 17:39:56,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:56,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {1040#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {1022#true} is VALID [2020-07-08 17:39:56,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {1022#true} ~__return_144~0 := 0; {1022#true} is VALID [2020-07-08 17:39:56,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {1022#true} assume true; {1022#true} is VALID [2020-07-08 17:39:56,373 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1022#true} {1022#true} #55#return; {1022#true} is VALID [2020-07-08 17:39:56,375 INFO L263 TraceCheckUtils]: 0: Hoare triple {1022#true} call ULTIMATE.init(); {1040#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID [2020-07-08 17:39:56,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {1022#true} is VALID [2020-07-08 17:39:56,375 INFO L280 TraceCheckUtils]: 2: Hoare triple {1022#true} ~__return_144~0 := 0; {1022#true} is VALID [2020-07-08 17:39:56,375 INFO L280 TraceCheckUtils]: 3: Hoare triple {1022#true} assume true; {1022#true} is VALID [2020-07-08 17:39:56,376 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1022#true} {1022#true} #55#return; {1022#true} is VALID [2020-07-08 17:39:56,376 INFO L263 TraceCheckUtils]: 5: Hoare triple {1022#true} call #t~ret1 := main(); {1022#true} is VALID [2020-07-08 17:39:56,376 INFO L280 TraceCheckUtils]: 6: Hoare triple {1022#true} havoc ~main__x~0; {1022#true} is VALID [2020-07-08 17:39:56,376 INFO L280 TraceCheckUtils]: 7: Hoare triple {1022#true} havoc ~main__y~0; {1022#true} is VALID [2020-07-08 17:39:56,377 INFO L280 TraceCheckUtils]: 8: Hoare triple {1022#true} ~main__x~0 := -50; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:56,377 INFO L280 TraceCheckUtils]: 9: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:56,378 INFO L280 TraceCheckUtils]: 10: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} ~main__y~0 := #t~nondet0; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:56,378 INFO L280 TraceCheckUtils]: 11: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} havoc #t~nondet0; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:56,379 INFO L280 TraceCheckUtils]: 12: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:56,379 INFO L280 TraceCheckUtils]: 13: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:56,380 INFO L280 TraceCheckUtils]: 14: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0; {1028#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-08 17:39:56,380 INFO L280 TraceCheckUtils]: 15: Hoare triple {1028#(<= (+ main_~main__x~0 50) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {1029#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 17:39:56,381 INFO L280 TraceCheckUtils]: 16: Hoare triple {1029#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1029#(<= (+ main_~main__x~0 50) main_~main__y~0)} is VALID [2020-07-08 17:39:56,381 INFO L280 TraceCheckUtils]: 17: Hoare triple {1029#(<= (+ main_~main__x~0 50) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {1030#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 17:39:56,382 INFO L280 TraceCheckUtils]: 18: Hoare triple {1030#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0; {1030#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-08 17:39:56,383 INFO L280 TraceCheckUtils]: 19: Hoare triple {1030#(<= (+ main_~main__x~0 51) main_~main__y~0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {1031#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:56,383 INFO L280 TraceCheckUtils]: 20: Hoare triple {1031#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1031#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:56,384 INFO L280 TraceCheckUtils]: 21: Hoare triple {1031#(<= (+ main_~main__x~0 51) (* 2 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {1032#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:56,384 INFO L280 TraceCheckUtils]: 22: Hoare triple {1032#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume ~main__x~0 < 0; {1032#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-08 17:39:56,385 INFO L280 TraceCheckUtils]: 23: Hoare triple {1032#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} ~main__x~0 := ~main__x~0 + ~main__y~0; {1033#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-08 17:39:56,385 INFO L280 TraceCheckUtils]: 24: Hoare triple {1033#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1033#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} is VALID [2020-07-08 17:39:56,386 INFO L280 TraceCheckUtils]: 25: Hoare triple {1033#(<= (+ main_~main__x~0 53) (* 3 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {1034#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-08 17:39:56,386 INFO L280 TraceCheckUtils]: 26: Hoare triple {1034#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} assume ~main__x~0 < 0; {1034#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-08 17:39:56,387 INFO L280 TraceCheckUtils]: 27: Hoare triple {1034#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} ~main__x~0 := ~main__x~0 + ~main__y~0; {1035#(<= (+ main_~main__x~0 56) (* 4 main_~main__y~0))} is VALID [2020-07-08 17:39:56,387 INFO L280 TraceCheckUtils]: 28: Hoare triple {1035#(<= (+ main_~main__x~0 56) (* 4 main_~main__y~0))} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1035#(<= (+ main_~main__x~0 56) (* 4 main_~main__y~0))} is VALID [2020-07-08 17:39:56,388 INFO L280 TraceCheckUtils]: 29: Hoare triple {1035#(<= (+ main_~main__x~0 56) (* 4 main_~main__y~0))} ~main__y~0 := 1 + ~main__y~0; {1036#(<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))} is VALID [2020-07-08 17:39:56,389 INFO L280 TraceCheckUtils]: 30: Hoare triple {1036#(<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))} assume !(~main__x~0 < 0); {1037#(<= 15 main_~main__y~0)} is VALID [2020-07-08 17:39:56,389 INFO L280 TraceCheckUtils]: 31: Hoare triple {1037#(<= 15 main_~main__y~0)} havoc ~__tmp_1~0; {1037#(<= 15 main_~main__y~0)} is VALID [2020-07-08 17:39:56,390 INFO L280 TraceCheckUtils]: 32: Hoare triple {1037#(<= 15 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {1038#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:56,390 INFO L280 TraceCheckUtils]: 33: Hoare triple {1038#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {1038#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:56,390 INFO L280 TraceCheckUtils]: 34: Hoare triple {1038#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1039#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 17:39:56,391 INFO L280 TraceCheckUtils]: 35: Hoare triple {1039#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {1023#false} is VALID [2020-07-08 17:39:56,391 INFO L280 TraceCheckUtils]: 36: Hoare triple {1023#false} assume !false; {1023#false} is VALID [2020-07-08 17:39:56,394 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 17:39:56,394 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:56,395 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [118618829] [2020-07-08 17:39:56,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:56,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-08 17:39:56,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460864814] [2020-07-08 17:39:56,396 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2020-07-08 17:39:56,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:56,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 17:39:56,432 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 17:39:56,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 17:39:56,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 17:39:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-08 17:39:56,433 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 15 states. [2020-07-08 17:39:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:57,468 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2020-07-08 17:39:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 17:39:57,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2020-07-08 17:39:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 17:39:57,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 50 transitions. [2020-07-08 17:39:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 17:39:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 50 transitions. [2020-07-08 17:39:57,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 50 transitions. [2020-07-08 17:39:57,548 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 17:39:57,550 INFO L225 Difference]: With dead ends: 50 [2020-07-08 17:39:57,551 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 17:39:57,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2020-07-08 17:39:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 17:39:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-08 17:39:57,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:57,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-08 17:39:57,628 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-08 17:39:57,628 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-08 17:39:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:57,631 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-08 17:39:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-08 17:39:57,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:57,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:57,632 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-08 17:39:57,632 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-08 17:39:57,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:57,634 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-08 17:39:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-08 17:39:57,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:57,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:57,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:57,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-08 17:39:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2020-07-08 17:39:57,637 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 37 [2020-07-08 17:39:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:57,638 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2020-07-08 17:39:57,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 17:39:57,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2020-07-08 17:39:57,690 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 17:39:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-08 17:39:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 17:39:57,692 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:39:57,692 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:39:57,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:39:57,692 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:39:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:39:57,693 INFO L82 PathProgramCache]: Analyzing trace with hash -540084565, now seen corresponding path program 5 times [2020-07-08 17:39:57,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:39:57,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1995028262] [2020-07-08 17:39:57,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:39:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:39:57,884 INFO L280 TraceCheckUtils]: 0: Hoare triple {1349#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {1337#true} is VALID [2020-07-08 17:39:57,885 INFO L280 TraceCheckUtils]: 1: Hoare triple {1337#true} ~__return_144~0 := 0; {1337#true} is VALID [2020-07-08 17:39:57,885 INFO L280 TraceCheckUtils]: 2: Hoare triple {1337#true} assume true; {1337#true} is VALID [2020-07-08 17:39:57,886 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1337#true} {1337#true} #55#return; {1337#true} is VALID [2020-07-08 17:39:57,887 INFO L263 TraceCheckUtils]: 0: Hoare triple {1337#true} call ULTIMATE.init(); {1349#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID [2020-07-08 17:39:57,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {1349#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0; {1337#true} is VALID [2020-07-08 17:39:57,888 INFO L280 TraceCheckUtils]: 2: Hoare triple {1337#true} ~__return_144~0 := 0; {1337#true} is VALID [2020-07-08 17:39:57,888 INFO L280 TraceCheckUtils]: 3: Hoare triple {1337#true} assume true; {1337#true} is VALID [2020-07-08 17:39:57,888 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1337#true} {1337#true} #55#return; {1337#true} is VALID [2020-07-08 17:39:57,889 INFO L263 TraceCheckUtils]: 5: Hoare triple {1337#true} call #t~ret1 := main(); {1337#true} is VALID [2020-07-08 17:39:57,889 INFO L280 TraceCheckUtils]: 6: Hoare triple {1337#true} havoc ~main__x~0; {1337#true} is VALID [2020-07-08 17:39:57,889 INFO L280 TraceCheckUtils]: 7: Hoare triple {1337#true} havoc ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,889 INFO L280 TraceCheckUtils]: 8: Hoare triple {1337#true} ~main__x~0 := -50; {1337#true} is VALID [2020-07-08 17:39:57,890 INFO L280 TraceCheckUtils]: 9: Hoare triple {1337#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1337#true} is VALID [2020-07-08 17:39:57,890 INFO L280 TraceCheckUtils]: 10: Hoare triple {1337#true} ~main__y~0 := #t~nondet0; {1337#true} is VALID [2020-07-08 17:39:57,890 INFO L280 TraceCheckUtils]: 11: Hoare triple {1337#true} havoc #t~nondet0; {1337#true} is VALID [2020-07-08 17:39:57,891 INFO L280 TraceCheckUtils]: 12: Hoare triple {1337#true} assume !!(-1000 < ~main__y~0); {1337#true} is VALID [2020-07-08 17:39:57,891 INFO L280 TraceCheckUtils]: 13: Hoare triple {1337#true} assume !!(~main__y~0 < 1000000); {1337#true} is VALID [2020-07-08 17:39:57,891 INFO L280 TraceCheckUtils]: 14: Hoare triple {1337#true} assume ~main__x~0 < 0; {1337#true} is VALID [2020-07-08 17:39:57,892 INFO L280 TraceCheckUtils]: 15: Hoare triple {1337#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,892 INFO L280 TraceCheckUtils]: 16: Hoare triple {1337#true} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,895 INFO L280 TraceCheckUtils]: 17: Hoare triple {1337#true} ~main__y~0 := 1 + ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,899 INFO L280 TraceCheckUtils]: 18: Hoare triple {1337#true} assume ~main__x~0 < 0; {1337#true} is VALID [2020-07-08 17:39:57,900 INFO L280 TraceCheckUtils]: 19: Hoare triple {1337#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,902 INFO L280 TraceCheckUtils]: 20: Hoare triple {1337#true} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,903 INFO L280 TraceCheckUtils]: 21: Hoare triple {1337#true} ~main__y~0 := 1 + ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,903 INFO L280 TraceCheckUtils]: 22: Hoare triple {1337#true} assume ~main__x~0 < 0; {1337#true} is VALID [2020-07-08 17:39:57,904 INFO L280 TraceCheckUtils]: 23: Hoare triple {1337#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,904 INFO L280 TraceCheckUtils]: 24: Hoare triple {1337#true} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,904 INFO L280 TraceCheckUtils]: 25: Hoare triple {1337#true} ~main__y~0 := 1 + ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,905 INFO L280 TraceCheckUtils]: 26: Hoare triple {1337#true} assume ~main__x~0 < 0; {1337#true} is VALID [2020-07-08 17:39:57,907 INFO L280 TraceCheckUtils]: 27: Hoare triple {1337#true} ~main__x~0 := ~main__x~0 + ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,908 INFO L280 TraceCheckUtils]: 28: Hoare triple {1337#true} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,908 INFO L280 TraceCheckUtils]: 29: Hoare triple {1337#true} ~main__y~0 := 1 + ~main__y~0; {1337#true} is VALID [2020-07-08 17:39:57,913 INFO L280 TraceCheckUtils]: 30: Hoare triple {1337#true} assume ~main__x~0 < 0; {1343#(<= (+ main_~main__x~0 1) 0)} is VALID [2020-07-08 17:39:57,914 INFO L280 TraceCheckUtils]: 31: Hoare triple {1343#(<= (+ main_~main__x~0 1) 0)} ~main__x~0 := ~main__x~0 + ~main__y~0; {1344#(<= (+ main_~main__x~0 1) main_~main__y~0)} is VALID [2020-07-08 17:39:57,915 INFO L280 TraceCheckUtils]: 32: Hoare triple {1344#(<= (+ main_~main__x~0 1) main_~main__y~0)} ~main____CPAchecker_TMP_0~0 := ~main__y~0; {1344#(<= (+ main_~main__x~0 1) main_~main__y~0)} is VALID [2020-07-08 17:39:57,916 INFO L280 TraceCheckUtils]: 33: Hoare triple {1344#(<= (+ main_~main__x~0 1) main_~main__y~0)} ~main__y~0 := 1 + ~main__y~0; {1345#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2020-07-08 17:39:57,927 INFO L280 TraceCheckUtils]: 34: Hoare triple {1345#(<= (+ main_~main__x~0 2) main_~main__y~0)} assume !(~main__x~0 < 0); {1346#(<= 2 main_~main__y~0)} is VALID [2020-07-08 17:39:57,929 INFO L280 TraceCheckUtils]: 35: Hoare triple {1346#(<= 2 main_~main__y~0)} havoc ~__tmp_1~0; {1346#(<= 2 main_~main__y~0)} is VALID [2020-07-08 17:39:57,930 INFO L280 TraceCheckUtils]: 36: Hoare triple {1346#(<= 2 main_~main__y~0)} ~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0); {1347#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:57,930 INFO L280 TraceCheckUtils]: 37: Hoare triple {1347#(not (= 0 main_~__tmp_1~0))} havoc ~__VERIFIER_assert__cond~0; {1347#(not (= 0 main_~__tmp_1~0))} is VALID [2020-07-08 17:39:57,931 INFO L280 TraceCheckUtils]: 38: Hoare triple {1347#(not (= 0 main_~__tmp_1~0))} ~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1348#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-08 17:39:57,932 INFO L280 TraceCheckUtils]: 39: Hoare triple {1348#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {1338#false} is VALID [2020-07-08 17:39:57,932 INFO L280 TraceCheckUtils]: 40: Hoare triple {1338#false} assume !false; {1338#false} is VALID [2020-07-08 17:39:57,937 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 17:39:57,937 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:39:57,938 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1995028262] [2020-07-08 17:39:57,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:39:57,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-08 17:39:57,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278331366] [2020-07-08 17:39:57,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-07-08 17:39:57,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:39:57,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-08 17:39:57,999 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 17:39:58,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-08 17:39:58,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:39:58,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-08 17:39:58,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-08 17:39:58,001 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 9 states. [2020-07-08 17:39:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:58,430 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-07-08 17:39:58,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 17:39:58,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-07-08 17:39:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:39:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:39:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2020-07-08 17:39:58,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-08 17:39:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 27 transitions. [2020-07-08 17:39:58,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 27 transitions. [2020-07-08 17:39:58,471 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 17:39:58,471 INFO L225 Difference]: With dead ends: 42 [2020-07-08 17:39:58,471 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 17:39:58,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-07-08 17:39:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 17:39:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 17:39:58,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:39:58,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:58,473 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:58,473 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:58,474 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:39:58,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:58,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:58,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:58,475 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:58,475 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 17:39:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:39:58,475 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 17:39:58,475 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:58,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:58,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:39:58,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:39:58,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:39:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 17:39:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 17:39:58,477 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-08 17:39:58,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:39:58,477 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 17:39:58,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-08 17:39:58,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 17:39:58,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:39:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 17:39:58,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:39:58,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 17:39:58,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 17:39:59,078 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,079 INFO L271 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-07-08 17:39:59,079 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|)) [2020-07-08 17:39:59,079 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,079 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,079 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,079 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,079 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 17:39:59,080 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-08 17:39:59,080 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-08 17:39:59,080 INFO L268 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2020-07-08 17:39:59,080 INFO L268 CegarLoopResult]: For program point L5-3(lines 4 6) no Hoare annotation was computed. [2020-07-08 17:39:59,080 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-08 17:39:59,080 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (= |old(~__return_144~0)| ~__return_144~0) (<= (+ main_~main__x~0 1) main_~main__y~0)) [2020-07-08 17:39:59,080 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_144~0)| ~__return_144~0)) [2020-07-08 17:39:59,081 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 11 58) the Hoare annotation is: true [2020-07-08 17:39:59,081 INFO L264 CegarLoopResult]: At program point L23(lines 23 56) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_144~0)| ~__return_144~0)) [2020-07-08 17:39:59,081 INFO L271 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: true [2020-07-08 17:39:59,081 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_144~0)| ~__return_144~0)) [2020-07-08 17:39:59,081 INFO L264 CegarLoopResult]: At program point L17(lines 17 57) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_144~0)| ~__return_144~0)) [2020-07-08 17:39:59,081 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (= |old(~__return_144~0)| ~__return_144~0) [2020-07-08 17:39:59,082 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: false [2020-07-08 17:39:59,082 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 11 58) the Hoare annotation is: true [2020-07-08 17:39:59,082 INFO L264 CegarLoopResult]: At program point L44(lines 44 53) the Hoare annotation is: (let ((.cse0 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse1 (= |old(~__return_144~0)| ~__return_144~0)) (.cse2 (not (= 0 main_~__tmp_1~0)))) (or (and .cse0 (<= 15 main_~main__y~0) .cse1 .cse2 (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))) (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 .cse1 .cse2 (<= 2 main_~main__y~0)))) [2020-07-08 17:39:59,082 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (= |old(~__return_144~0)| ~__return_144~0)) (.cse1 (not (= 0 main_~__tmp_1~0)))) (or (and (<= 15 main_~main__y~0) .cse0 .cse1 (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))) (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 .cse1 (<= 2 main_~main__y~0)))) [2020-07-08 17:39:59,082 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (= |old(~__return_144~0)| ~__return_144~0))) (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 (<= 2 main_~main__y~0)) (and (<= 15 main_~main__y~0) .cse0 (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))))) [2020-07-08 17:39:59,082 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (= |old(~__return_144~0)| ~__return_144~0) (<= (+ main_~main__x~0 1) main_~main__y~0)) [2020-07-08 17:39:59,082 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (= |old(~__return_144~0)| ~__return_144~0))) (or (and (<= (+ main_~main__x~0 1) 0) (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0) (and (<= (+ main_~main__x~0 50) 0) .cse0))) [2020-07-08 17:39:59,082 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) the Hoare annotation is: false [2020-07-08 17:39:59,083 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 58) the Hoare annotation is: (= |old(~__return_144~0)| ~__return_144~0) [2020-07-08 17:39:59,083 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (= |old(~__return_144~0)| ~__return_144~0) [2020-07-08 17:39:59,083 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_144~0)| ~__return_144~0)) [2020-07-08 17:39:59,083 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_144~0)| ~__return_144~0)) [2020-07-08 17:39:59,083 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: false [2020-07-08 17:39:59,083 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (= |old(~__return_144~0)| ~__return_144~0) [2020-07-08 17:39:59,083 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= (+ main_~main__x~0 50) 0) (= |old(~__return_144~0)| ~__return_144~0)) [2020-07-08 17:39:59,083 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (let ((.cse0 (= |old(~__return_144~0)| ~__return_144~0)) (.cse1 (not (= 0 main_~__tmp_1~0)))) (or (and (<= 15 main_~main__y~0) .cse0 .cse1 (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))) (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 .cse1 (<= 2 main_~main__y~0)))) [2020-07-08 17:39:59,084 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (let ((.cse0 (= |old(~__return_144~0)| ~__return_144~0))) (or (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0 (<= 2 main_~main__y~0)) (and (<= 15 main_~main__y~0) .cse0 (<= (+ main_~main__x~0 60) (* 4 main_~main__y~0))))) [2020-07-08 17:39:59,084 INFO L264 CegarLoopResult]: At program point L35(lines 28 56) the Hoare annotation is: (let ((.cse0 (= |old(~__return_144~0)| ~__return_144~0))) (or (and (<= (+ main_~main__x~0 50) 0) .cse0) (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0))) [2020-07-08 17:39:59,088 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 17:39:59,089 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 17:39:59,089 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 17:39:59,089 WARN L170 areAnnotationChecker]: L5-1 has no Hoare annotation [2020-07-08 17:39:59,089 WARN L170 areAnnotationChecker]: L5-3 has no Hoare annotation [2020-07-08 17:39:59,101 INFO L163 areAnnotationChecker]: CFG has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 17:39:59,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 05:39:59 BoogieIcfgContainer [2020-07-08 17:39:59,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 17:39:59,118 INFO L168 Benchmark]: Toolchain (without parser) took 8282.65 ms. Allocated memory was 139.5 MB in the beginning and 306.2 MB in the end (delta: 166.7 MB). Free memory was 104.6 MB in the beginning and 261.5 MB in the end (delta: -156.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,119 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.33 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 94.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,120 INFO L168 Benchmark]: Boogie Preprocessor took 31.12 ms. Allocated memory is still 139.5 MB. Free memory was 94.4 MB in the beginning and 93.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,121 INFO L168 Benchmark]: RCFGBuilder took 488.23 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 92.8 MB in the beginning and 165.4 MB in the end (delta: -72.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,122 INFO L168 Benchmark]: TraceAbstraction took 7512.76 ms. Allocated memory was 205.0 MB in the beginning and 306.2 MB in the end (delta: 101.2 MB). Free memory was 165.4 MB in the beginning and 261.5 MB in the end (delta: -96.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. [2020-07-08 17:39:59,126 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.20 ms. Allocated memory is still 139.5 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.33 ms. Allocated memory is still 139.5 MB. Free memory was 104.2 MB in the beginning and 94.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.12 ms. Allocated memory is still 139.5 MB. Free memory was 94.4 MB in the beginning and 93.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 488.23 ms. Allocated memory was 139.5 MB in the beginning and 205.0 MB in the end (delta: 65.5 MB). Free memory was 92.8 MB in the beginning and 165.4 MB in the end (delta: -72.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7512.76 ms. Allocated memory was 205.0 MB in the beginning and 306.2 MB in the end (delta: 101.2 MB). Free memory was 165.4 MB in the beginning and 261.5 MB in the end (delta: -96.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (main__x + 50 <= 0 && \old(__return_144) == __return_144) || (main__x + 2 <= main__y && \old(__return_144) == __return_144) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.8s, OverallIterations: 6, TraceHistogramMax: 5, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 119 SDtfs, 259 SDslu, 209 SDs, 0 SdLazy, 851 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 34 LocationsWithAnnotation, 34 PreInvPairs, 84 NumberOfFragments, 323 HoareAnnotationTreeSize, 34 FomulaSimplifications, 1456 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 34 FomulaSimplificationsInter, 413 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 correct! Received shutdown request...