/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:13,979 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:13,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:13,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:13,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:13,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:14,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:14,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:14,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:14,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:14,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:14,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:14,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:14,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:14,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:14,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:14,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:14,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:14,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:14,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:14,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:14,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:14,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:14,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:14,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:14,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:14,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:14,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:14,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:14,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:14,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:14,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:14,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:14,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:14,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:14,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:14,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:14,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:14,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:14,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:14,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:14,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:29:14,047 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:14,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:14,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:14,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:14,048 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:14,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:14,049 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:14,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:14,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:14,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:14,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:14,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:14,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:14,050 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:14,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:14,051 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:14,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:14,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:14,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:14,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:14,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:14,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:14,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:14,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:14,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:14,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:14,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:14,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:14,053 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:14,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:14,346 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:14,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:14,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:14,369 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:14,369 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:14,370 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c [2020-07-10 15:29:14,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8371d03b/6f1718fcad04475f886c18ca6627b3a2/FLAG46ffb8cc7 [2020-07-10 15:29:14,931 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:14,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.v+cfa-reducer.c [2020-07-10 15:29:14,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8371d03b/6f1718fcad04475f886c18ca6627b3a2/FLAG46ffb8cc7 [2020-07-10 15:29:15,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8371d03b/6f1718fcad04475f886c18ca6627b3a2 [2020-07-10 15:29:15,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:15,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:15,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:15,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:15,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:15,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b60fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15, skipping insertion in model container [2020-07-10 15:29:15,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:15,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:15,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:15,590 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:15,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:15,626 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:15,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15 WrapperNode [2020-07-10 15:29:15,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:15,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:15,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:15,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:15,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ... [2020-07-10 15:29:15,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:15,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:15,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:15,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:15,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (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-10 15:29:15,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:15,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:15,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:15,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:16,059 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:16,059 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:29:16,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:16 BoogieIcfgContainer [2020-07-10 15:29:16,064 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:16,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:16,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:16,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:16,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:15" (1/3) ... [2020-07-10 15:29:16,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33014e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:16, skipping insertion in model container [2020-07-10 15:29:16,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (2/3) ... [2020-07-10 15:29:16,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33014e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:16, skipping insertion in model container [2020-07-10 15:29:16,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:16" (3/3) ... [2020-07-10 15:29:16,072 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+cfa-reducer.c [2020-07-10 15:29:16,091 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:16,107 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:16,139 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:16,166 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:16,166 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:16,166 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:16,166 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:16,167 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:16,167 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:16,167 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:16,167 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-07-10 15:29:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:29:16,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:16,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:16,188 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1330899215, now seen corresponding path program 1 times [2020-07-10 15:29:16,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:16,200 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364838325] [2020-07-10 15:29:16,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:16,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__return_65~0 := 0; {19#true} is VALID [2020-07-10 15:29:16,428 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} assume true; {19#true} is VALID [2020-07-10 15:29:16,428 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} #36#return; {19#true} is VALID [2020-07-10 15:29:16,432 INFO L263 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-10 15:29:16,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__return_65~0 := 0; {19#true} is VALID [2020-07-10 15:29:16,432 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2020-07-10 15:29:16,433 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #36#return; {19#true} is VALID [2020-07-10 15:29:16,433 INFO L263 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret1 := main(); {19#true} is VALID [2020-07-10 15:29:16,435 INFO L280 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:16,444 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:16,445 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {24#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:16,447 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID [2020-07-10 15:29:16,447 INFO L280 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0 == ~__VERIFIER_assert__cond~0; {20#false} is VALID [2020-07-10 15:29:16,448 INFO L280 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2020-07-10 15:29:16,449 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-10 15:29:16,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364838325] [2020-07-10 15:29:16,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:16,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:29:16,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176288380] [2020-07-10 15:29:16,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-10 15:29:16,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:16,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:29:16,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:16,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:29:16,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:16,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:29:16,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:29:16,510 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2020-07-10 15:29:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:16,670 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-10 15:29:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:29:16,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-10 15:29:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:29:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-07-10 15:29:16,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:29:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-07-10 15:29:16,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2020-07-10 15:29:16,745 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-10 15:29:16,757 INFO L225 Difference]: With dead ends: 26 [2020-07-10 15:29:16,757 INFO L226 Difference]: Without dead ends: 13 [2020-07-10 15:29:16,761 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-10 15:29:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-10 15:29:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-10 15:29:16,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:16,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:16,808 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:16,809 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:16,812 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:29:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:29:16,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:16,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:16,813 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:16,813 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:16,816 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:29:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:29:16,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:16,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:16,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:16,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:16,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-10 15:29:16,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-07-10 15:29:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:16,822 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-10 15:29:16,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:29:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:29:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:29:16,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:16,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:16,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:16,824 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:16,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:16,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1691859760, now seen corresponding path program 1 times [2020-07-10 15:29:16,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:16,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435823568] [2020-07-10 15:29:16,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:16,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__return_65~0 := 0; {107#true} is VALID [2020-07-10 15:29:16,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#true} assume true; {107#true} is VALID [2020-07-10 15:29:16,999 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {107#true} {107#true} #36#return; {107#true} is VALID [2020-07-10 15:29:17,002 INFO L263 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-10 15:29:17,003 INFO L280 TraceCheckUtils]: 1: Hoare triple {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__return_65~0 := 0; {107#true} is VALID [2020-07-10 15:29:17,003 INFO L280 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2020-07-10 15:29:17,004 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #36#return; {107#true} is VALID [2020-07-10 15:29:17,004 INFO L263 TraceCheckUtils]: 4: Hoare triple {107#true} call #t~ret1 := main(); {107#true} is VALID [2020-07-10 15:29:17,005 INFO L280 TraceCheckUtils]: 5: Hoare triple {107#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:17,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:17,009 INFO L280 TraceCheckUtils]: 7: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:17,011 INFO L280 TraceCheckUtils]: 8: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {113#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-10 15:29:17,013 INFO L280 TraceCheckUtils]: 9: Hoare triple {113#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {114#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-10 15:29:17,015 INFO L280 TraceCheckUtils]: 10: Hoare triple {114#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {108#false} is VALID [2020-07-10 15:29:17,015 INFO L280 TraceCheckUtils]: 11: Hoare triple {108#false} assume !false; {108#false} is VALID [2020-07-10 15:29:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:17,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435823568] [2020-07-10 15:29:17,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399580662] [2020-07-10 15:29:17,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:17,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:29:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:17,094 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:17,228 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:17,249 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:17,279 INFO L263 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {107#true} is VALID [2020-07-10 15:29:17,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#true} ~__return_main~0 := 0;~__return_65~0 := 0; {107#true} is VALID [2020-07-10 15:29:17,280 INFO L280 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID [2020-07-10 15:29:17,281 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #36#return; {107#true} is VALID [2020-07-10 15:29:17,281 INFO L263 TraceCheckUtils]: 4: Hoare triple {107#true} call #t~ret1 := main(); {107#true} is VALID [2020-07-10 15:29:17,282 INFO L280 TraceCheckUtils]: 5: Hoare triple {107#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:17,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:17,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {112#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:17,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {113#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-10 15:29:17,286 INFO L280 TraceCheckUtils]: 9: Hoare triple {113#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {146#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2020-07-10 15:29:17,287 INFO L280 TraceCheckUtils]: 10: Hoare triple {146#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {108#false} is VALID [2020-07-10 15:29:17,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {108#false} assume !false; {108#false} is VALID [2020-07-10 15:29:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:17,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:17,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:29:17,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003365844] [2020-07-10 15:29:17,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-10 15:29:17,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:17,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:29:17,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:17,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:29:17,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:17,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:29:17,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:29:17,314 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2020-07-10 15:29:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:17,456 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-10 15:29:17,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:29:17,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-07-10 15:29:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-10 15:29:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2020-07-10 15:29:17,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2020-07-10 15:29:17,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:17,486 INFO L225 Difference]: With dead ends: 17 [2020-07-10 15:29:17,486 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:29:17,487 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:29:17,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-10 15:29:17,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:17,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:17,504 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:17,504 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:17,506 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:17,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:17,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:17,507 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:17,507 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:17,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:17,509 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:17,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:17,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:17,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:17,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:17,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-10 15:29:17,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-07-10 15:29:17,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:17,512 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-10 15:29:17,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:29:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:17,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:29:17,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:17,513 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:17,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:29:17,726 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:17,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:17,727 INFO L82 PathProgramCache]: Analyzing trace with hash -908107473, now seen corresponding path program 2 times [2020-07-10 15:29:17,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:17,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163639147] [2020-07-10 15:29:17,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:17,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__return_65~0 := 0; {231#true} is VALID [2020-07-10 15:29:17,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2020-07-10 15:29:17,836 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #36#return; {231#true} is VALID [2020-07-10 15:29:17,837 INFO L263 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {240#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-10 15:29:17,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__return_65~0 := 0; {231#true} is VALID [2020-07-10 15:29:17,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2020-07-10 15:29:17,838 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #36#return; {231#true} is VALID [2020-07-10 15:29:17,839 INFO L263 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret1 := main(); {231#true} is VALID [2020-07-10 15:29:17,840 INFO L280 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {236#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:17,840 INFO L280 TraceCheckUtils]: 6: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {236#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:17,841 INFO L280 TraceCheckUtils]: 7: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {236#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:17,842 INFO L280 TraceCheckUtils]: 8: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {237#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-10 15:29:17,843 INFO L280 TraceCheckUtils]: 9: Hoare triple {237#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {238#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-10 15:29:17,845 INFO L280 TraceCheckUtils]: 10: Hoare triple {238#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {239#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-10 15:29:17,845 INFO L280 TraceCheckUtils]: 11: Hoare triple {239#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {232#false} is VALID [2020-07-10 15:29:17,846 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#false} assume !false; {232#false} is VALID [2020-07-10 15:29:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:17,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163639147] [2020-07-10 15:29:17,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850370970] [2020-07-10 15:29:17,848 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-10 15:29:17,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:29:17,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:17,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:29:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:17,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:17,981 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:17,995 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:18,034 INFO L263 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2020-07-10 15:29:18,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {231#true} ~__return_main~0 := 0;~__return_65~0 := 0; {231#true} is VALID [2020-07-10 15:29:18,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2020-07-10 15:29:18,035 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #36#return; {231#true} is VALID [2020-07-10 15:29:18,035 INFO L263 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret1 := main(); {231#true} is VALID [2020-07-10 15:29:18,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {236#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:18,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {236#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:18,038 INFO L280 TraceCheckUtils]: 7: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {236#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:18,039 INFO L280 TraceCheckUtils]: 8: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {237#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-10 15:29:18,041 INFO L280 TraceCheckUtils]: 9: Hoare triple {237#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {238#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-10 15:29:18,042 INFO L280 TraceCheckUtils]: 10: Hoare triple {238#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {274#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2020-07-10 15:29:18,043 INFO L280 TraceCheckUtils]: 11: Hoare triple {274#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {232#false} is VALID [2020-07-10 15:29:18,044 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#false} assume !false; {232#false} is VALID [2020-07-10 15:29:18,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:18,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:18,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-07-10 15:29:18,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869929403] [2020-07-10 15:29:18,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-10 15:29:18,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:18,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:29:18,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:18,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:29:18,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:29:18,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:18,071 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2020-07-10 15:29:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:18,343 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-07-10 15:29:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:18,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-10 15:29:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2020-07-10 15:29:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2020-07-10 15:29:18,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 18 transitions. [2020-07-10 15:29:18,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:18,374 INFO L225 Difference]: With dead ends: 18 [2020-07-10 15:29:18,375 INFO L226 Difference]: Without dead ends: 15 [2020-07-10 15:29:18,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:29:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-10 15:29:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-10 15:29:18,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:18,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:18,391 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:18,391 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:18,393 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:29:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:18,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:18,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:18,393 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:18,394 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:18,395 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:29:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:18,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:18,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:18,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:18,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:29:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-10 15:29:18,398 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2020-07-10 15:29:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:18,398 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-10 15:29:18,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:29:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:29:18,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:18,399 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:18,612 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:18,613 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:18,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1913376944, now seen corresponding path program 3 times [2020-07-10 15:29:18,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:18,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661114083] [2020-07-10 15:29:18,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:18,772 INFO L280 TraceCheckUtils]: 0: Hoare triple {377#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__return_65~0 := 0; {367#true} is VALID [2020-07-10 15:29:18,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 15:29:18,773 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} #36#return; {367#true} is VALID [2020-07-10 15:29:18,774 INFO L263 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {377#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} is VALID [2020-07-10 15:29:18,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {377#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|))} ~__return_main~0 := 0;~__return_65~0 := 0; {367#true} is VALID [2020-07-10 15:29:18,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 15:29:18,774 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #36#return; {367#true} is VALID [2020-07-10 15:29:18,774 INFO L263 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret1 := main(); {367#true} is VALID [2020-07-10 15:29:18,775 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {372#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:18,776 INFO L280 TraceCheckUtils]: 6: Hoare triple {372#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {372#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:18,776 INFO L280 TraceCheckUtils]: 7: Hoare triple {372#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {372#(<= (+ main_~main__x~0 50) 0)} is VALID [2020-07-10 15:29:18,777 INFO L280 TraceCheckUtils]: 8: Hoare triple {372#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {373#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID [2020-07-10 15:29:18,778 INFO L280 TraceCheckUtils]: 9: Hoare triple {373#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {374#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID [2020-07-10 15:29:18,780 INFO L280 TraceCheckUtils]: 10: Hoare triple {374#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {375#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID [2020-07-10 15:29:18,782 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {376#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-10 15:29:18,784 INFO L280 TraceCheckUtils]: 12: Hoare triple {376#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {368#false} is VALID [2020-07-10 15:29:18,784 INFO L280 TraceCheckUtils]: 13: Hoare triple {368#false} assume !false; {368#false} is VALID [2020-07-10 15:29:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:18,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661114083] [2020-07-10 15:29:18,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078123127] [2020-07-10 15:29:18,785 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:18,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-10 15:29:18,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:18,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:29:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:18,826 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:18,892 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:18,909 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:18,937 INFO L263 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {367#true} is VALID [2020-07-10 15:29:18,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} ~__return_main~0 := 0;~__return_65~0 := 0; {367#true} is VALID [2020-07-10 15:29:18,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2020-07-10 15:29:18,938 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #36#return; {367#true} is VALID [2020-07-10 15:29:18,939 INFO L263 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret1 := main(); {367#true} is VALID [2020-07-10 15:29:18,939 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {367#true} is VALID [2020-07-10 15:29:18,939 INFO L280 TraceCheckUtils]: 6: Hoare triple {367#true} assume !!(-1000 < ~main__y~0); {367#true} is VALID [2020-07-10 15:29:18,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {367#true} assume !!(~main__y~0 < 1000000); {367#true} is VALID [2020-07-10 15:29:18,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {367#true} is VALID [2020-07-10 15:29:18,940 INFO L280 TraceCheckUtils]: 9: Hoare triple {367#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {367#true} is VALID [2020-07-10 15:29:18,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {367#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {411#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID [2020-07-10 15:29:18,943 INFO L280 TraceCheckUtils]: 11: Hoare triple {411#(<= (+ main_~main__x~0 2) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {415#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2020-07-10 15:29:18,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {415#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {368#false} is VALID [2020-07-10 15:29:18,944 INFO L280 TraceCheckUtils]: 13: Hoare triple {368#false} assume !false; {368#false} is VALID [2020-07-10 15:29:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-10 15:29:18,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:29:18,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2020-07-10 15:29:18,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047972026] [2020-07-10 15:29:18,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:29:18,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:18,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:29:18,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:18,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:29:18,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:18,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:29:18,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:18,963 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states. [2020-07-10 15:29:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,022 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:29:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:29:19,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-10 15:29:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:29:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-10 15:29:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:29:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-10 15:29:19,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2020-07-10 15:29:19,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:19,042 INFO L225 Difference]: With dead ends: 15 [2020-07-10 15:29:19,042 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:19,043 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:29:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:19,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:19,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:19,044 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:19,044 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,045 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:19,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:19,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:19,045 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:19,045 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,046 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:19,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:19,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:19,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:19,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:19,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-10 15:29:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:19,047 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:19,047 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:29:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:19,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:19,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:19,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:19,325 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:19,325 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_65~0 |old(~__return_65~0)|)) [2020-07-10 15:29:19,325 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:19,325 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:19,326 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:19,326 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:19,326 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:19,326 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:29:19,326 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:29:19,326 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:29:19,326 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:29:19,327 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2020-07-10 15:29:19,327 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 58) the Hoare annotation is: (= |old(~__return_65~0)| ~__return_65~0) [2020-07-10 15:29:19,327 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 58) no Hoare annotation was computed. [2020-07-10 15:29:19,327 INFO L268 CegarLoopResult]: For program point L23(lines 23 56) no Hoare annotation was computed. [2020-07-10 15:29:19,327 INFO L268 CegarLoopResult]: For program point L17(lines 17 57) no Hoare annotation was computed. [2020-07-10 15:29:19,327 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-10 15:29:19,328 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 58) no Hoare annotation was computed. [2020-07-10 15:29:19,328 INFO L268 CegarLoopResult]: For program point L44(lines 44 53) no Hoare annotation was computed. [2020-07-10 15:29:19,328 INFO L264 CegarLoopResult]: At program point L35(lines 28 56) the Hoare annotation is: (let ((.cse0 (= |old(~__return_65~0)| ~__return_65~0))) (or (and (<= (+ main_~main__x~0 50) 0) .cse0) (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0))) [2020-07-10 15:29:19,333 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:29:19,334 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:19,334 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:19,334 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:29:19,334 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:19,335 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:29:19,335 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:29:19,335 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:19,335 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:19,336 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:19,336 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:19,336 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-10 15:29:19,336 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:19,336 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:29:19,336 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:29:19,336 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:19,338 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:29:19,338 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:29:19,338 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:29:19,338 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:29:19,339 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-10 15:29:19,339 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:19,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:19 BoogieIcfgContainer [2020-07-10 15:29:19,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:19,356 INFO L168 Benchmark]: Toolchain (without parser) took 3991.44 ms. Allocated memory was 143.1 MB in the beginning and 250.6 MB in the end (delta: 107.5 MB). Free memory was 100.7 MB in the beginning and 138.0 MB in the end (delta: -37.3 MB). Peak memory consumption was 70.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:19,357 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 143.1 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:29:19,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.18 ms. Allocated memory is still 143.1 MB. Free memory was 100.3 MB in the beginning and 90.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:19,359 INFO L168 Benchmark]: Boogie Preprocessor took 117.31 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 90.3 MB in the beginning and 179.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:19,359 INFO L168 Benchmark]: RCFGBuilder took 318.82 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 162.7 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:19,360 INFO L168 Benchmark]: TraceAbstraction took 3287.35 ms. Allocated memory was 200.3 MB in the beginning and 250.6 MB in the end (delta: 50.3 MB). Free memory was 162.7 MB in the beginning and 138.0 MB in the end (delta: 24.7 MB). Peak memory consumption was 75.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:19,364 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 143.1 MB. Free memory is still 119.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 262.18 ms. Allocated memory is still 143.1 MB. Free memory was 100.3 MB in the beginning and 90.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.31 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 90.3 MB in the beginning and 179.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 318.82 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 162.7 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3287.35 ms. Allocated memory was 200.3 MB in the beginning and 250.6 MB in the end (delta: 50.3 MB). Free memory was 162.7 MB in the beginning and 138.0 MB in the end (delta: 24.7 MB). Peak memory consumption was 75.0 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_65) == __return_65) || (main__x + 2 <= main__y && \old(__return_65) == __return_65) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 44 SDtfs, 32 SDslu, 69 SDs, 0 SdLazy, 87 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 31 HoareAnnotationTreeSize, 5 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 89 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 2840 SizeOfPredicates, 12 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 6/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...