/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/recursive/EvenOdd01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:13:58,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:13:58,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:13:59,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:13:59,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:13:59,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:13:59,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:13:59,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:13:59,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:13:59,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:13:59,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:13:59,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:13:59,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:13:59,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:13:59,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:13:59,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:13:59,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:13:59,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:13:59,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:13:59,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:13:59,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:13:59,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:13:59,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:13:59,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:13:59,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:13:59,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:13:59,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:13:59,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:13:59,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:13:59,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:13:59,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:13:59,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:13:59,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:13:59,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:13:59,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:13:59,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:13:59,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:13:59,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:13:59,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:13:59,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:13:59,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:13:59,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:13:59,046 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:13:59,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:13:59,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:13:59,048 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:13:59,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:13:59,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:13:59,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:13:59,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:13:59,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:13:59,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:13:59,050 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:13:59,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:13:59,050 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:13:59,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:13:59,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:13:59,051 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:13:59,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:13:59,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:13:59,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:13:59,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:13:59,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:13:59,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:13:59,052 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:13:59,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:13:59,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:13:59,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:13:59,375 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:13:59,376 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:13:59,376 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/EvenOdd01-1.c [2020-07-18 00:13:59,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ca66b97/498693e899514f5bad049eeba86b028c/FLAG606bbf50f [2020-07-18 00:13:59,832 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:13:59,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/EvenOdd01-1.c [2020-07-18 00:13:59,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ca66b97/498693e899514f5bad049eeba86b028c/FLAG606bbf50f [2020-07-18 00:14:00,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79ca66b97/498693e899514f5bad049eeba86b028c [2020-07-18 00:14:00,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:00,206 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:00,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:00,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:00,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:00,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:00" (1/1) ... [2020-07-18 00:14:00,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65238a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00, skipping insertion in model container [2020-07-18 00:14:00,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:00" (1/1) ... [2020-07-18 00:14:00,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:00,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:00,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:00,413 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:00,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:00,449 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:00,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00 WrapperNode [2020-07-18 00:14:00,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:00,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:00,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:00,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:00,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00" (1/1) ... [2020-07-18 00:14:00,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00" (1/1) ... [2020-07-18 00:14:00,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00" (1/1) ... [2020-07-18 00:14:00,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00" (1/1) ... [2020-07-18 00:14:00,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00" (1/1) ... [2020-07-18 00:14:00,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00" (1/1) ... [2020-07-18 00:14:00,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00" (1/1) ... [2020-07-18 00:14:00,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:00,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:00,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:00,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:00,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:00,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:00,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:00,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2020-07-18 00:14:00,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2020-07-18 00:14:00,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2020-07-18 00:14:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2020-07-18 00:14:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:00,940 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:00,940 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:00,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:00 BoogieIcfgContainer [2020-07-18 00:14:00,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:00,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:00,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:00,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:00,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:14:00" (1/3) ... [2020-07-18 00:14:00,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c41017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:00, skipping insertion in model container [2020-07-18 00:14:00,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:00" (2/3) ... [2020-07-18 00:14:00,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c41017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:00, skipping insertion in model container [2020-07-18 00:14:00,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:00" (3/3) ... [2020-07-18 00:14:00,954 INFO L109 eAbstractionObserver]: Analyzing ICFG EvenOdd01-1.c [2020-07-18 00:14:00,966 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:00,975 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:00,990 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:01,016 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:01,016 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:01,017 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:01,017 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:01,017 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:01,017 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:01,017 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:01,018 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-07-18 00:14:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 00:14:01,048 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:01,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:01,050 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1047957633, now seen corresponding path program 1 times [2020-07-18 00:14:01,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:01,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1733928243] [2020-07-18 00:14:01,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:01,711 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2020-07-18 00:14:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:01,759 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-18 00:14:01,760 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {47#true} {47#true} #63#return; {47#true} is VALID [2020-07-18 00:14:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:01,876 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#true} ~n := #in~n; {60#(= isOdd_~n |isOdd_#in~n|)} is VALID [2020-07-18 00:14:01,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#(= isOdd_~n |isOdd_#in~n|)} assume 0 == ~n; {61#(= 0 |isOdd_#in~n|)} is VALID [2020-07-18 00:14:01,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {61#(= 0 |isOdd_#in~n|)} #res := 0; {62#(and (= 0 |isOdd_#in~n|) (= 0 |isOdd_#res|))} is VALID [2020-07-18 00:14:01,881 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#(and (= 0 |isOdd_#in~n|) (= 0 |isOdd_#res|))} assume true; {62#(and (= 0 |isOdd_#in~n|) (= 0 |isOdd_#res|))} is VALID [2020-07-18 00:14:01,883 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {62#(and (= 0 |isOdd_#in~n|) (= 0 |isOdd_#res|))} {51#(< 0 (+ main_~n~0 1))} #67#return; {57#(and (<= |main_#t~ret3| 0) (<= main_~n~0 0) (< 0 (+ main_~n~0 1)))} is VALID [2020-07-18 00:14:01,884 INFO L263 TraceCheckUtils]: 0: Hoare triple {47#true} call ULTIMATE.init(); {47#true} is VALID [2020-07-18 00:14:01,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#true} assume true; {47#true} is VALID [2020-07-18 00:14:01,885 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {47#true} {47#true} #63#return; {47#true} is VALID [2020-07-18 00:14:01,885 INFO L263 TraceCheckUtils]: 3: Hoare triple {47#true} call #t~ret4 := main(); {47#true} is VALID [2020-07-18 00:14:01,886 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {47#true} is VALID [2020-07-18 00:14:01,886 INFO L280 TraceCheckUtils]: 5: Hoare triple {47#true} ~n~0 := #t~nondet2; {47#true} is VALID [2020-07-18 00:14:01,887 INFO L280 TraceCheckUtils]: 6: Hoare triple {47#true} havoc #t~nondet2; {47#true} is VALID [2020-07-18 00:14:01,888 INFO L280 TraceCheckUtils]: 7: Hoare triple {47#true} assume !(~n~0 < 0); {51#(< 0 (+ main_~n~0 1))} is VALID [2020-07-18 00:14:01,889 INFO L263 TraceCheckUtils]: 8: Hoare triple {51#(< 0 (+ main_~n~0 1))} call #t~ret3 := isOdd(~n~0); {47#true} is VALID [2020-07-18 00:14:01,890 INFO L280 TraceCheckUtils]: 9: Hoare triple {47#true} ~n := #in~n; {60#(= isOdd_~n |isOdd_#in~n|)} is VALID [2020-07-18 00:14:01,891 INFO L280 TraceCheckUtils]: 10: Hoare triple {60#(= isOdd_~n |isOdd_#in~n|)} assume 0 == ~n; {61#(= 0 |isOdd_#in~n|)} is VALID [2020-07-18 00:14:01,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {61#(= 0 |isOdd_#in~n|)} #res := 0; {62#(and (= 0 |isOdd_#in~n|) (= 0 |isOdd_#res|))} is VALID [2020-07-18 00:14:01,894 INFO L280 TraceCheckUtils]: 12: Hoare triple {62#(and (= 0 |isOdd_#in~n|) (= 0 |isOdd_#res|))} assume true; {62#(and (= 0 |isOdd_#in~n|) (= 0 |isOdd_#res|))} is VALID [2020-07-18 00:14:01,895 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {62#(and (= 0 |isOdd_#in~n|) (= 0 |isOdd_#res|))} {51#(< 0 (+ main_~n~0 1))} #67#return; {57#(and (<= |main_#t~ret3| 0) (<= main_~n~0 0) (< 0 (+ main_~n~0 1)))} is VALID [2020-07-18 00:14:01,897 INFO L280 TraceCheckUtils]: 14: Hoare triple {57#(and (<= |main_#t~ret3| 0) (<= main_~n~0 0) (< 0 (+ main_~n~0 1)))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {57#(and (<= |main_#t~ret3| 0) (<= main_~n~0 0) (< 0 (+ main_~n~0 1)))} is VALID [2020-07-18 00:14:01,899 INFO L280 TraceCheckUtils]: 15: Hoare triple {57#(and (<= |main_#t~ret3| 0) (<= main_~n~0 0) (< 0 (+ main_~n~0 1)))} ~result~0 := #t~ret3; {58#(or (and (= (+ (* 2 (div main_~n~0 2)) main_~result~0 2) main_~n~0) (< main_~n~0 0) (not (= main_~n~0 (* 2 (div main_~n~0 2))))) (and (= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (or (<= 0 main_~n~0) (= main_~n~0 (* 2 (div main_~n~0 2))))) (and (<= main_~n~0 0) (<= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (< 0 (+ main_~n~0 1))))} is VALID [2020-07-18 00:14:01,900 INFO L280 TraceCheckUtils]: 16: Hoare triple {58#(or (and (= (+ (* 2 (div main_~n~0 2)) main_~result~0 2) main_~n~0) (< main_~n~0 0) (not (= main_~n~0 (* 2 (div main_~n~0 2))))) (and (= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (or (<= 0 main_~n~0) (= main_~n~0 (* 2 (div main_~n~0 2))))) (and (<= main_~n~0 0) (<= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (< 0 (+ main_~n~0 1))))} havoc #t~ret3; {58#(or (and (= (+ (* 2 (div main_~n~0 2)) main_~result~0 2) main_~n~0) (< main_~n~0 0) (not (= main_~n~0 (* 2 (div main_~n~0 2))))) (and (= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (or (<= 0 main_~n~0) (= main_~n~0 (* 2 (div main_~n~0 2))))) (and (<= main_~n~0 0) (<= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (< 0 (+ main_~n~0 1))))} is VALID [2020-07-18 00:14:01,903 INFO L280 TraceCheckUtils]: 17: Hoare triple {58#(or (and (= (+ (* 2 (div main_~n~0 2)) main_~result~0 2) main_~n~0) (< main_~n~0 0) (not (= main_~n~0 (* 2 (div main_~n~0 2))))) (and (= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (or (<= 0 main_~n~0) (= main_~n~0 (* 2 (div main_~n~0 2))))) (and (<= main_~n~0 0) (<= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (< 0 (+ main_~n~0 1))))} ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); {59#(or (<= (+ main_~result~0 1) 0) (= main_~mod~0 main_~result~0))} is VALID [2020-07-18 00:14:01,904 INFO L280 TraceCheckUtils]: 18: Hoare triple {59#(or (<= (+ main_~result~0 1) 0) (= main_~mod~0 main_~result~0))} assume !(~result~0 < 0 || ~result~0 == ~mod~0); {48#false} is VALID [2020-07-18 00:14:01,905 INFO L280 TraceCheckUtils]: 19: Hoare triple {48#false} assume !false; {48#false} is VALID [2020-07-18 00:14:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:14:01,919 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:01,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1733928243] [2020-07-18 00:14:01,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:01,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:14:01,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646279852] [2020-07-18 00:14:01,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-18 00:14:01,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:01,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:14:01,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:01,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:14:01,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:14:01,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:14:01,994 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 9 states. [2020-07-18 00:14:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:02,884 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2020-07-18 00:14:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 00:14:02,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-07-18 00:14:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:14:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2020-07-18 00:14:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:14:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 69 transitions. [2020-07-18 00:14:02,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 69 transitions. [2020-07-18 00:14:02,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:03,025 INFO L225 Difference]: With dead ends: 62 [2020-07-18 00:14:03,025 INFO L226 Difference]: Without dead ends: 40 [2020-07-18 00:14:03,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:14:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-18 00:14:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-18 00:14:03,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:03,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:03,137 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:03,137 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:03,144 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-18 00:14:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-18 00:14:03,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:03,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:03,146 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:03,146 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-18 00:14:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:03,152 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-18 00:14:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-18 00:14:03,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:03,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:03,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:03,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-18 00:14:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-07-18 00:14:03,160 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 20 [2020-07-18 00:14:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:03,160 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-07-18 00:14:03,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:14:03,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2020-07-18 00:14:03,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-18 00:14:03,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-18 00:14:03,229 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:03,229 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-18 00:14:03,230 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:03,230 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:03,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:03,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1743555941, now seen corresponding path program 1 times [2020-07-18 00:14:03,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:03,232 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [693216845] [2020-07-18 00:14:03,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:03,544 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 16 [2020-07-18 00:14:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:03,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {361#true} assume true; {361#true} is VALID [2020-07-18 00:14:03,579 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {361#true} {361#true} #63#return; {361#true} is VALID [2020-07-18 00:14:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:03,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {361#true} ~n := #in~n; {375#(= isOdd_~n |isOdd_#in~n|)} is VALID [2020-07-18 00:14:03,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {375#(= isOdd_~n |isOdd_#in~n|)} assume !(0 == ~n); {375#(= isOdd_~n |isOdd_#in~n|)} is VALID [2020-07-18 00:14:03,637 INFO L280 TraceCheckUtils]: 2: Hoare triple {375#(= isOdd_~n |isOdd_#in~n|)} assume 1 == ~n; {376#(= 1 |isOdd_#in~n|)} is VALID [2020-07-18 00:14:03,638 INFO L280 TraceCheckUtils]: 3: Hoare triple {376#(= 1 |isOdd_#in~n|)} #res := 1; {377#(and (= 1 |isOdd_#res|) (= 1 |isOdd_#in~n|))} is VALID [2020-07-18 00:14:03,639 INFO L280 TraceCheckUtils]: 4: Hoare triple {377#(and (= 1 |isOdd_#res|) (= 1 |isOdd_#in~n|))} assume true; {377#(and (= 1 |isOdd_#res|) (= 1 |isOdd_#in~n|))} is VALID [2020-07-18 00:14:03,641 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {377#(and (= 1 |isOdd_#res|) (= 1 |isOdd_#in~n|))} {365#(or (= main_~n~0 (* 2 (div main_~n~0 2))) (< 0 (+ main_~n~0 1)))} #67#return; {372#(and (<= 1 |main_#t~ret3|) (<= |main_#t~ret3| 1) (< 0 (+ main_~n~0 1)) (<= main_~n~0 1) (not (= main_~n~0 (* 2 (div main_~n~0 2)))))} is VALID [2020-07-18 00:14:03,642 INFO L263 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2020-07-18 00:14:03,642 INFO L280 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2020-07-18 00:14:03,642 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} #63#return; {361#true} is VALID [2020-07-18 00:14:03,643 INFO L263 TraceCheckUtils]: 3: Hoare triple {361#true} call #t~ret4 := main(); {361#true} is VALID [2020-07-18 00:14:03,643 INFO L280 TraceCheckUtils]: 4: Hoare triple {361#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {361#true} is VALID [2020-07-18 00:14:03,644 INFO L280 TraceCheckUtils]: 5: Hoare triple {361#true} ~n~0 := #t~nondet2; {361#true} is VALID [2020-07-18 00:14:03,644 INFO L280 TraceCheckUtils]: 6: Hoare triple {361#true} havoc #t~nondet2; {361#true} is VALID [2020-07-18 00:14:03,645 INFO L280 TraceCheckUtils]: 7: Hoare triple {361#true} assume !(~n~0 < 0); {365#(or (= main_~n~0 (* 2 (div main_~n~0 2))) (< 0 (+ main_~n~0 1)))} is VALID [2020-07-18 00:14:03,646 INFO L263 TraceCheckUtils]: 8: Hoare triple {365#(or (= main_~n~0 (* 2 (div main_~n~0 2))) (< 0 (+ main_~n~0 1)))} call #t~ret3 := isOdd(~n~0); {361#true} is VALID [2020-07-18 00:14:03,646 INFO L280 TraceCheckUtils]: 9: Hoare triple {361#true} ~n := #in~n; {375#(= isOdd_~n |isOdd_#in~n|)} is VALID [2020-07-18 00:14:03,647 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#(= isOdd_~n |isOdd_#in~n|)} assume !(0 == ~n); {375#(= isOdd_~n |isOdd_#in~n|)} is VALID [2020-07-18 00:14:03,648 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#(= isOdd_~n |isOdd_#in~n|)} assume 1 == ~n; {376#(= 1 |isOdd_#in~n|)} is VALID [2020-07-18 00:14:03,649 INFO L280 TraceCheckUtils]: 12: Hoare triple {376#(= 1 |isOdd_#in~n|)} #res := 1; {377#(and (= 1 |isOdd_#res|) (= 1 |isOdd_#in~n|))} is VALID [2020-07-18 00:14:03,650 INFO L280 TraceCheckUtils]: 13: Hoare triple {377#(and (= 1 |isOdd_#res|) (= 1 |isOdd_#in~n|))} assume true; {377#(and (= 1 |isOdd_#res|) (= 1 |isOdd_#in~n|))} is VALID [2020-07-18 00:14:03,652 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {377#(and (= 1 |isOdd_#res|) (= 1 |isOdd_#in~n|))} {365#(or (= main_~n~0 (* 2 (div main_~n~0 2))) (< 0 (+ main_~n~0 1)))} #67#return; {372#(and (<= 1 |main_#t~ret3|) (<= |main_#t~ret3| 1) (< 0 (+ main_~n~0 1)) (<= main_~n~0 1) (not (= main_~n~0 (* 2 (div main_~n~0 2)))))} is VALID [2020-07-18 00:14:03,653 INFO L280 TraceCheckUtils]: 15: Hoare triple {372#(and (<= 1 |main_#t~ret3|) (<= |main_#t~ret3| 1) (< 0 (+ main_~n~0 1)) (<= main_~n~0 1) (not (= main_~n~0 (* 2 (div main_~n~0 2)))))} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {372#(and (<= 1 |main_#t~ret3|) (<= |main_#t~ret3| 1) (< 0 (+ main_~n~0 1)) (<= main_~n~0 1) (not (= main_~n~0 (* 2 (div main_~n~0 2)))))} is VALID [2020-07-18 00:14:03,654 INFO L280 TraceCheckUtils]: 16: Hoare triple {372#(and (<= 1 |main_#t~ret3|) (<= |main_#t~ret3| 1) (< 0 (+ main_~n~0 1)) (<= main_~n~0 1) (not (= main_~n~0 (* 2 (div main_~n~0 2)))))} ~result~0 := #t~ret3; {373#(and (= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (<= 1 main_~result~0) (< 0 (+ main_~n~0 1)) (<= main_~n~0 1))} is VALID [2020-07-18 00:14:03,656 INFO L280 TraceCheckUtils]: 17: Hoare triple {373#(and (= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (<= 1 main_~result~0) (< 0 (+ main_~n~0 1)) (<= main_~n~0 1))} havoc #t~ret3; {373#(and (= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (<= 1 main_~result~0) (< 0 (+ main_~n~0 1)) (<= main_~n~0 1))} is VALID [2020-07-18 00:14:03,657 INFO L280 TraceCheckUtils]: 18: Hoare triple {373#(and (= (+ (* 2 (div main_~n~0 2)) main_~result~0) main_~n~0) (<= 1 main_~result~0) (< 0 (+ main_~n~0 1)) (<= main_~n~0 1))} ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); {374#(= main_~mod~0 main_~result~0)} is VALID [2020-07-18 00:14:03,658 INFO L280 TraceCheckUtils]: 19: Hoare triple {374#(= main_~mod~0 main_~result~0)} assume !(~result~0 < 0 || ~result~0 == ~mod~0); {362#false} is VALID [2020-07-18 00:14:03,659 INFO L280 TraceCheckUtils]: 20: Hoare triple {362#false} assume !false; {362#false} is VALID [2020-07-18 00:14:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:14:03,661 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:03,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [693216845] [2020-07-18 00:14:03,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:03,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:14:03,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151433617] [2020-07-18 00:14:03,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-18 00:14:03,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:03,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:14:03,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:03,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:14:03,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:14:03,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:14:03,692 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2020-07-18 00:14:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:04,274 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2020-07-18 00:14:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:14:04,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-18 00:14:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:14:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2020-07-18 00:14:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:14:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2020-07-18 00:14:04,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 51 transitions. [2020-07-18 00:14:04,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:04,382 INFO L225 Difference]: With dead ends: 49 [2020-07-18 00:14:04,383 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 00:14:04,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:14:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 00:14:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-18 00:14:04,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:04,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2020-07-18 00:14:04,434 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2020-07-18 00:14:04,434 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2020-07-18 00:14:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:04,438 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-18 00:14:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-18 00:14:04,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:04,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:04,440 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2020-07-18 00:14:04,440 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2020-07-18 00:14:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:04,444 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-18 00:14:04,444 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2020-07-18 00:14:04,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:04,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:04,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:04,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-18 00:14:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2020-07-18 00:14:04,449 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 21 [2020-07-18 00:14:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:04,450 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2020-07-18 00:14:04,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:14:04,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2020-07-18 00:14:04,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2020-07-18 00:14:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 00:14:04,500 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:04,500 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, 1, 1, 1, 1] [2020-07-18 00:14:04,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:04,501 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:04,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:04,501 INFO L82 PathProgramCache]: Analyzing trace with hash 698419476, now seen corresponding path program 1 times [2020-07-18 00:14:04,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:04,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [350696942] [2020-07-18 00:14:04,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:04,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {650#true} assume true; {650#true} is VALID [2020-07-18 00:14:04,541 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {650#true} {650#true} #63#return; {650#true} is VALID [2020-07-18 00:14:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:04,584 INFO L280 TraceCheckUtils]: 0: Hoare triple {650#true} ~n := #in~n; {674#(= isEven_~n |isEven_#in~n|)} is VALID [2020-07-18 00:14:04,585 INFO L280 TraceCheckUtils]: 1: Hoare triple {674#(= isEven_~n |isEven_#in~n|)} assume 0 == ~n; {675#(= |isEven_#in~n| 0)} is VALID [2020-07-18 00:14:04,585 INFO L280 TraceCheckUtils]: 2: Hoare triple {675#(= |isEven_#in~n| 0)} #res := 1; {675#(= |isEven_#in~n| 0)} is VALID [2020-07-18 00:14:04,586 INFO L280 TraceCheckUtils]: 3: Hoare triple {675#(= |isEven_#in~n| 0)} assume true; {675#(= |isEven_#in~n| 0)} is VALID [2020-07-18 00:14:04,587 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {675#(= |isEven_#in~n| 0)} {668#(not (= 1 isOdd_~n))} #61#return; {651#false} is VALID [2020-07-18 00:14:04,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {650#true} ~n := #in~n; {650#true} is VALID [2020-07-18 00:14:04,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {650#true} assume !(0 == ~n); {650#true} is VALID [2020-07-18 00:14:04,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {650#true} assume !(1 == ~n); {668#(not (= 1 isOdd_~n))} is VALID [2020-07-18 00:14:04,589 INFO L263 TraceCheckUtils]: 3: Hoare triple {668#(not (= 1 isOdd_~n))} call #t~ret0 := isEven(~n - 1); {650#true} is VALID [2020-07-18 00:14:04,590 INFO L280 TraceCheckUtils]: 4: Hoare triple {650#true} ~n := #in~n; {674#(= isEven_~n |isEven_#in~n|)} is VALID [2020-07-18 00:14:04,591 INFO L280 TraceCheckUtils]: 5: Hoare triple {674#(= isEven_~n |isEven_#in~n|)} assume 0 == ~n; {675#(= |isEven_#in~n| 0)} is VALID [2020-07-18 00:14:04,592 INFO L280 TraceCheckUtils]: 6: Hoare triple {675#(= |isEven_#in~n| 0)} #res := 1; {675#(= |isEven_#in~n| 0)} is VALID [2020-07-18 00:14:04,592 INFO L280 TraceCheckUtils]: 7: Hoare triple {675#(= |isEven_#in~n| 0)} assume true; {675#(= |isEven_#in~n| 0)} is VALID [2020-07-18 00:14:04,594 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {675#(= |isEven_#in~n| 0)} {668#(not (= 1 isOdd_~n))} #61#return; {651#false} is VALID [2020-07-18 00:14:04,594 INFO L280 TraceCheckUtils]: 9: Hoare triple {651#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {651#false} is VALID [2020-07-18 00:14:04,594 INFO L280 TraceCheckUtils]: 10: Hoare triple {651#false} #res := #t~ret0; {651#false} is VALID [2020-07-18 00:14:04,595 INFO L280 TraceCheckUtils]: 11: Hoare triple {651#false} havoc #t~ret0; {651#false} is VALID [2020-07-18 00:14:04,595 INFO L280 TraceCheckUtils]: 12: Hoare triple {651#false} assume true; {651#false} is VALID [2020-07-18 00:14:04,596 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {651#false} {650#true} #67#return; {651#false} is VALID [2020-07-18 00:14:04,596 INFO L263 TraceCheckUtils]: 0: Hoare triple {650#true} call ULTIMATE.init(); {650#true} is VALID [2020-07-18 00:14:04,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {650#true} assume true; {650#true} is VALID [2020-07-18 00:14:04,597 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {650#true} {650#true} #63#return; {650#true} is VALID [2020-07-18 00:14:04,597 INFO L263 TraceCheckUtils]: 3: Hoare triple {650#true} call #t~ret4 := main(); {650#true} is VALID [2020-07-18 00:14:04,597 INFO L280 TraceCheckUtils]: 4: Hoare triple {650#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {650#true} is VALID [2020-07-18 00:14:04,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {650#true} ~n~0 := #t~nondet2; {650#true} is VALID [2020-07-18 00:14:04,598 INFO L280 TraceCheckUtils]: 6: Hoare triple {650#true} havoc #t~nondet2; {650#true} is VALID [2020-07-18 00:14:04,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {650#true} assume !(~n~0 < 0); {650#true} is VALID [2020-07-18 00:14:04,599 INFO L263 TraceCheckUtils]: 8: Hoare triple {650#true} call #t~ret3 := isOdd(~n~0); {650#true} is VALID [2020-07-18 00:14:04,599 INFO L280 TraceCheckUtils]: 9: Hoare triple {650#true} ~n := #in~n; {650#true} is VALID [2020-07-18 00:14:04,599 INFO L280 TraceCheckUtils]: 10: Hoare triple {650#true} assume !(0 == ~n); {650#true} is VALID [2020-07-18 00:14:04,600 INFO L280 TraceCheckUtils]: 11: Hoare triple {650#true} assume !(1 == ~n); {668#(not (= 1 isOdd_~n))} is VALID [2020-07-18 00:14:04,601 INFO L263 TraceCheckUtils]: 12: Hoare triple {668#(not (= 1 isOdd_~n))} call #t~ret0 := isEven(~n - 1); {650#true} is VALID [2020-07-18 00:14:04,601 INFO L280 TraceCheckUtils]: 13: Hoare triple {650#true} ~n := #in~n; {674#(= isEven_~n |isEven_#in~n|)} is VALID [2020-07-18 00:14:04,602 INFO L280 TraceCheckUtils]: 14: Hoare triple {674#(= isEven_~n |isEven_#in~n|)} assume 0 == ~n; {675#(= |isEven_#in~n| 0)} is VALID [2020-07-18 00:14:04,603 INFO L280 TraceCheckUtils]: 15: Hoare triple {675#(= |isEven_#in~n| 0)} #res := 1; {675#(= |isEven_#in~n| 0)} is VALID [2020-07-18 00:14:04,604 INFO L280 TraceCheckUtils]: 16: Hoare triple {675#(= |isEven_#in~n| 0)} assume true; {675#(= |isEven_#in~n| 0)} is VALID [2020-07-18 00:14:04,605 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {675#(= |isEven_#in~n| 0)} {668#(not (= 1 isOdd_~n))} #61#return; {651#false} is VALID [2020-07-18 00:14:04,605 INFO L280 TraceCheckUtils]: 18: Hoare triple {651#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {651#false} is VALID [2020-07-18 00:14:04,606 INFO L280 TraceCheckUtils]: 19: Hoare triple {651#false} #res := #t~ret0; {651#false} is VALID [2020-07-18 00:14:04,606 INFO L280 TraceCheckUtils]: 20: Hoare triple {651#false} havoc #t~ret0; {651#false} is VALID [2020-07-18 00:14:04,606 INFO L280 TraceCheckUtils]: 21: Hoare triple {651#false} assume true; {651#false} is VALID [2020-07-18 00:14:04,607 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {651#false} {650#true} #67#return; {651#false} is VALID [2020-07-18 00:14:04,607 INFO L280 TraceCheckUtils]: 23: Hoare triple {651#false} assume -2147483648 <= #t~ret3 && #t~ret3 <= 2147483647; {651#false} is VALID [2020-07-18 00:14:04,607 INFO L280 TraceCheckUtils]: 24: Hoare triple {651#false} ~result~0 := #t~ret3; {651#false} is VALID [2020-07-18 00:14:04,607 INFO L280 TraceCheckUtils]: 25: Hoare triple {651#false} havoc #t~ret3; {651#false} is VALID [2020-07-18 00:14:04,608 INFO L280 TraceCheckUtils]: 26: Hoare triple {651#false} ~mod~0 := (if ~n~0 < 0 && 0 != ~n~0 % 2 then ~n~0 % 2 - 2 else ~n~0 % 2); {651#false} is VALID [2020-07-18 00:14:04,608 INFO L280 TraceCheckUtils]: 27: Hoare triple {651#false} assume !(~result~0 < 0 || ~result~0 == ~mod~0); {651#false} is VALID [2020-07-18 00:14:04,608 INFO L280 TraceCheckUtils]: 28: Hoare triple {651#false} assume !false; {651#false} is VALID [2020-07-18 00:14:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 00:14:04,850 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:04,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [350696942] [2020-07-18 00:14:04,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:04,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-18 00:14:04,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801552907] [2020-07-18 00:14:04,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2020-07-18 00:14:04,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:04,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-18 00:14:04,868 WARN L140 InductivityCheck]: Transition 678#(and (<= |isOdd_#res| 2147483647) (= |isEven_#in~n| 0) (<= 0 (+ |isOdd_#res| 2147483648))) ( _ , 650#true , #67#return; , 679#(and (<= |main_#t~ret3| 2147483647) (= |isEven_#in~n| 0) (<= 0 (+ |main_#t~ret3| 2147483648))) ) not inductive [2020-07-18 00:14:04,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:14:04,870 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:14:04,877 INFO L168 Benchmark]: Toolchain (without parser) took 4671.33 ms. Allocated memory was 142.1 MB in the beginning and 255.3 MB in the end (delta: 113.2 MB). Free memory was 100.2 MB in the beginning and 146.6 MB in the end (delta: -46.4 MB). Peak memory consumption was 66.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:04,879 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-18 00:14:04,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.98 ms. Allocated memory is still 142.1 MB. Free memory was 100.0 MB in the beginning and 90.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:04,882 INFO L168 Benchmark]: Boogie Preprocessor took 27.71 ms. Allocated memory is still 142.1 MB. Free memory was 90.1 MB in the beginning and 88.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:04,883 INFO L168 Benchmark]: RCFGBuilder took 466.49 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 88.5 MB in the beginning and 157.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:04,888 INFO L168 Benchmark]: TraceAbstraction took 3927.97 ms. Allocated memory was 199.2 MB in the beginning and 255.3 MB in the end (delta: 56.1 MB). Free memory was 157.5 MB in the beginning and 146.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:04,895 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.23 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 242.98 ms. Allocated memory is still 142.1 MB. Free memory was 100.0 MB in the beginning and 90.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.71 ms. Allocated memory is still 142.1 MB. Free memory was 90.1 MB in the beginning and 88.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 466.49 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 88.5 MB in the beginning and 157.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3927.97 ms. Allocated memory was 199.2 MB in the beginning and 255.3 MB in the end (delta: 56.1 MB). Free memory was 157.5 MB in the beginning and 146.6 MB in the end (delta: 10.9 MB). Peak memory consumption was 67.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...