/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-simple/id_b3_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:14:24,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:14:24,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:14:24,547 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:14:24,547 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:14:24,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:14:24,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:14:24,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:14:24,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:14:24,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:14:24,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:14:24,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:14:24,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:14:24,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:14:24,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:14:24,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:14:24,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:14:24,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:14:24,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:14:24,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:14:24,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:14:24,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:14:24,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:14:24,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:14:24,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:14:24,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:14:24,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:14:24,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:14:24,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:14:24,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:14:24,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:14:24,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:14:24,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:14:24,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:14:24,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:14:24,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:14:24,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:14:24,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:14:24,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:14:24,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:14:24,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:14:24,589 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:14:24,598 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:14:24,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:14:24,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:14:24,599 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:14:24,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:14:24,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:14:24,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:14:24,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:14:24,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:14:24,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:14:24,601 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:14:24,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:14:24,601 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:14:24,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:14:24,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:14:24,602 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:14:24,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:14:24,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:14:24,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:24,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:14:24,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:14:24,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:14:24,603 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:14:24,910 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:14:24,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:14:24,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:14:24,929 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:14:24,930 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:14:24,932 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-18 00:14:24,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac95d33f/11782c7677e64e90b2197f82e58728d6/FLAG69c82a0f7 [2020-07-18 00:14:25,430 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:14:25,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b3_o5-2.c [2020-07-18 00:14:25,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac95d33f/11782c7677e64e90b2197f82e58728d6/FLAG69c82a0f7 [2020-07-18 00:14:25,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac95d33f/11782c7677e64e90b2197f82e58728d6 [2020-07-18 00:14:25,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:25,786 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:25,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:25,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:25,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:25,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:25" (1/1) ... [2020-07-18 00:14:25,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ff5312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:25, skipping insertion in model container [2020-07-18 00:14:25,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:25" (1/1) ... [2020-07-18 00:14:25,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:25,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:26,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:26,016 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:26,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:26,061 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:26,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26 WrapperNode [2020-07-18 00:14:26,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:26,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:26,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:26,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:26,077 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:26" (1/1) ... [2020-07-18 00:14:26,078 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:26" (1/1) ... [2020-07-18 00:14:26,084 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:26" (1/1) ... [2020-07-18 00:14:26,085 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:26" (1/1) ... [2020-07-18 00:14:26,090 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:26" (1/1) ... [2020-07-18 00:14:26,093 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:26" (1/1) ... [2020-07-18 00:14:26,094 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:26" (1/1) ... [2020-07-18 00:14:26,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:26,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:26,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:26,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:26,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (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:26,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:26,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:26,255 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-18 00:14:26,255 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:26,255 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-18 00:14:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:26,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:26,515 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:26,516 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:26,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:26 BoogieIcfgContainer [2020-07-18 00:14:26,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:26,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:26,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:26,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:26,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:14:25" (1/3) ... [2020-07-18 00:14:26,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6ded0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:26, skipping insertion in model container [2020-07-18 00:14:26,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:26" (2/3) ... [2020-07-18 00:14:26,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b6ded0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:26, skipping insertion in model container [2020-07-18 00:14:26,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:26" (3/3) ... [2020-07-18 00:14:26,531 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o5-2.c [2020-07-18 00:14:26,545 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:26,555 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:26,576 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:26,604 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:26,604 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:26,604 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:26,604 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:26,605 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:26,605 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:26,605 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:26,605 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-18 00:14:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 00:14:26,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:26,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:14:26,636 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:26,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:26,643 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-18 00:14:26,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:26,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2101231125] [2020-07-18 00:14:26,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:26,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 00:14:26,920 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 00:14:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:26,968 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 00:14:26,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 00:14:26,971 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:26,972 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:26,975 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 00:14:26,976 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-18 00:14:26,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 00:14:26,977 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 00:14:26,977 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-18 00:14:26,977 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-18 00:14:26,978 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-18 00:14:26,978 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-18 00:14:26,979 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-18 00:14:26,979 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 00:14:26,980 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 00:14:26,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:26,985 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:26,987 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#(= 0 |id_#res|)} {33#true} #43#return; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 00:14:26,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {42#(<= |main_#t~ret2| 0)} is VALID [2020-07-18 00:14:26,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#(<= |main_#t~ret2| 0)} ~result~0 := #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-18 00:14:26,999 INFO L280 TraceCheckUtils]: 15: Hoare triple {43#(<= main_~result~0 0)} havoc #t~ret2; {43#(<= main_~result~0 0)} is VALID [2020-07-18 00:14:27,001 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 5 == ~result~0; {34#false} is VALID [2020-07-18 00:14:27,001 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-18 00:14:27,004 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:27,018 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:27,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2101231125] [2020-07-18 00:14:27,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:27,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:14:27,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183900899] [2020-07-18 00:14:27,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 00:14:27,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:27,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:14:27,081 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-18 00:14:27,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:14:27,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:27,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:14:27,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:14:27,093 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-18 00:14:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:27,387 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-18 00:14:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:14:27,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 00:14:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 00:14:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 00:14:27,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-18 00:14:27,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:27,494 INFO L225 Difference]: With dead ends: 44 [2020-07-18 00:14:27,494 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 00:14:27,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:14:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 00:14:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 00:14:27,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:27,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,559 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,560 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:27,566 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 00:14:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:14:27,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:27,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:27,568 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,568 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:27,573 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 00:14:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:14:27,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:27,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:27,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:27,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 00:14:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-18 00:14:27,580 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-18 00:14:27,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:27,581 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-18 00:14:27,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:14:27,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-18 00:14:27,624 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-18 00:14:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:14:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 00:14:27,626 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:27,627 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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:27,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:27,627 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:27,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:27,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-18 00:14:27,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:27,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [307910468] [2020-07-18 00:14:27,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:27,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 00:14:27,944 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 00:14:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:27,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 00:14:27,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 00:14:27,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:27,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse2 (* 2 |v_oct_id_#res_in_1|)) (.cse0 (* 2 v_oct_id_~ret~0_out_1)) (.cse8 (* 2 |v_oct_id_#res_out_1|))) (let ((.cse1 (<= .cse8 6)) (.cse3 (<= 6 .cse8)) (.cse4 (<= 8 .cse0)) (.cse5 (<= 6 .cse2)) (.cse6 (<= .cse0 8))) (or (and (<= .cse0 4294967296) .cse1 (<= .cse2 4294967294) .cse3 .cse4 .cse5 (<= 0 (+ .cse0 4294967294)) .cse6) (let ((.cse7 (+ |v_oct_id_#res_in_1| 1))) (and (<= v_oct_id_~ret~0_out_1 .cse7) (<= .cse7 v_oct_id_~ret~0_out_1) .cse1 .cse3 .cse4 (<= .cse0 4294967296))) (and (<= 0 (+ .cse0 4294967294)) .cse1 (<= .cse2 4294967294) .cse3 .cse4 .cse5 .cse6 (<= .cse0 4294967296))))) InVars {id_#res=|v_oct_id_#res_in_1|} OutVars{id_#res=|v_oct_id_#res_out_1|, id_#t~ret0=|v_oct_id_#t~ret0_out_1|, id_~ret~0=v_oct_id_~ret~0_out_1} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {250#false} is VALID [2020-07-18 00:14:27,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {250#false} [46] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#false} is VALID [2020-07-18 00:14:27,981 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {250#false} {249#true} #43#return; {259#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 00:14:27,982 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-18 00:14:27,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 00:14:27,982 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 00:14:27,983 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-18 00:14:27,983 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-18 00:14:27,983 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-18 00:14:27,984 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-18 00:14:27,984 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-18 00:14:27,984 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 00:14:27,985 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-18 00:14:27,985 INFO L263 TraceCheckUtils]: 10: Hoare triple {249#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {249#true} is VALID [2020-07-18 00:14:27,985 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 00:14:27,986 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 00:14:27,987 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:27,988 INFO L280 TraceCheckUtils]: 14: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse2 (* 2 |v_oct_id_#res_in_1|)) (.cse0 (* 2 v_oct_id_~ret~0_out_1)) (.cse8 (* 2 |v_oct_id_#res_out_1|))) (let ((.cse1 (<= .cse8 6)) (.cse3 (<= 6 .cse8)) (.cse4 (<= 8 .cse0)) (.cse5 (<= 6 .cse2)) (.cse6 (<= .cse0 8))) (or (and (<= .cse0 4294967296) .cse1 (<= .cse2 4294967294) .cse3 .cse4 .cse5 (<= 0 (+ .cse0 4294967294)) .cse6) (let ((.cse7 (+ |v_oct_id_#res_in_1| 1))) (and (<= v_oct_id_~ret~0_out_1 .cse7) (<= .cse7 v_oct_id_~ret~0_out_1) .cse1 .cse3 .cse4 (<= .cse0 4294967296))) (and (<= 0 (+ .cse0 4294967294)) .cse1 (<= .cse2 4294967294) .cse3 .cse4 .cse5 .cse6 (<= .cse0 4294967296))))) InVars {id_#res=|v_oct_id_#res_in_1|} OutVars{id_#res=|v_oct_id_#res_out_1|, id_#t~ret0=|v_oct_id_#t~ret0_out_1|, id_~ret~0=v_oct_id_~ret~0_out_1} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {250#false} is VALID [2020-07-18 00:14:27,989 INFO L280 TraceCheckUtils]: 15: Hoare triple {250#false} [46] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#false} is VALID [2020-07-18 00:14:27,989 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {250#false} {249#true} #43#return; {259#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 00:14:27,990 INFO L280 TraceCheckUtils]: 17: Hoare triple {259#(<= |main_#t~ret2| 3)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {259#(<= |main_#t~ret2| 3)} is VALID [2020-07-18 00:14:27,991 INFO L280 TraceCheckUtils]: 18: Hoare triple {259#(<= |main_#t~ret2| 3)} ~result~0 := #t~ret2; {260#(<= main_~result~0 3)} is VALID [2020-07-18 00:14:27,992 INFO L280 TraceCheckUtils]: 19: Hoare triple {260#(<= main_~result~0 3)} havoc #t~ret2; {260#(<= main_~result~0 3)} is VALID [2020-07-18 00:14:27,992 INFO L280 TraceCheckUtils]: 20: Hoare triple {260#(<= main_~result~0 3)} assume 5 == ~result~0; {250#false} is VALID [2020-07-18 00:14:27,993 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-18 00:14:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 00:14:28,048 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:28,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [307910468] [2020-07-18 00:14:28,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:28,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:14:28,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440116486] [2020-07-18 00:14:28,051 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 00:14:28,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:28,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:14:28,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:28,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:14:28,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:28,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:14:28,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:14:28,088 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2020-07-18 00:14:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:28,311 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-18 00:14:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:14:28,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 00:14:28,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:28,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:14:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-18 00:14:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:14:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-18 00:14:28,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2020-07-18 00:14:28,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:28,395 INFO L225 Difference]: With dead ends: 49 [2020-07-18 00:14:28,395 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 00:14:28,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:14:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 00:14:28,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-18 00:14:28,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:28,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-18 00:14:28,425 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-18 00:14:28,426 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-18 00:14:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:28,430 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-18 00:14:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-18 00:14:28,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:28,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:28,432 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-18 00:14:28,432 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-18 00:14:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:28,437 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-18 00:14:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-18 00:14:28,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:28,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:28,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:28,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:28,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 00:14:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-18 00:14:28,442 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2020-07-18 00:14:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:28,443 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-18 00:14:28,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:14:28,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-18 00:14:28,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 00:14:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 00:14:28,493 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:28,493 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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:28,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:28,494 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:28,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1645321695, now seen corresponding path program 1 times [2020-07-18 00:14:28,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:28,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1940771372] [2020-07-18 00:14:28,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,639 INFO L280 TraceCheckUtils]: 0: Hoare triple {499#true} assume true; {499#true} is VALID [2020-07-18 00:14:28,640 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {499#true} {499#true} #39#return; {499#true} is VALID [2020-07-18 00:14:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,688 INFO L280 TraceCheckUtils]: 0: Hoare triple {499#true} ~x := #in~x; {499#true} is VALID [2020-07-18 00:14:28,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {499#true} assume 0 == ~x; {499#true} is VALID [2020-07-18 00:14:28,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {499#true} #res := 0; {511#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:28,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {511#(= 0 |id_#res|)} [49] idFINAL-->idEXIT_primed: Formula: (let ((.cse0 (+ |v_oct_id_#res_in_2| 1))) (and (<= |v_oct_id_#res_out_2| v_oct_id_~ret~0_out_2) (<= (* 2 v_oct_id_~ret~0_out_2) 6) (<= v_oct_id_~ret~0_out_2 .cse0) (<= 0 (+ (* 2 |v_oct_id_#res_in_2|) 4294967296)) (<= v_oct_id_~ret~0_out_2 |v_oct_id_#res_out_2|) (<= .cse0 v_oct_id_~ret~0_out_2))) InVars {id_#res=|v_oct_id_#res_in_2|} OutVars{id_#res=|v_oct_id_#res_out_2|, id_#t~ret0=|v_oct_id_#t~ret0_out_2|, id_~ret~0=v_oct_id_~ret~0_out_2} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {512#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:28,693 INFO L280 TraceCheckUtils]: 4: Hoare triple {512#(<= |id_#res| 1)} [48] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {512#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:28,694 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {512#(<= |id_#res| 1)} {499#true} #43#return; {509#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 00:14:28,694 INFO L263 TraceCheckUtils]: 0: Hoare triple {499#true} call ULTIMATE.init(); {499#true} is VALID [2020-07-18 00:14:28,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {499#true} assume true; {499#true} is VALID [2020-07-18 00:14:28,695 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {499#true} {499#true} #39#return; {499#true} is VALID [2020-07-18 00:14:28,696 INFO L263 TraceCheckUtils]: 3: Hoare triple {499#true} call #t~ret3 := main(); {499#true} is VALID [2020-07-18 00:14:28,696 INFO L280 TraceCheckUtils]: 4: Hoare triple {499#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {499#true} is VALID [2020-07-18 00:14:28,696 INFO L280 TraceCheckUtils]: 5: Hoare triple {499#true} ~input~0 := #t~nondet1; {499#true} is VALID [2020-07-18 00:14:28,697 INFO L280 TraceCheckUtils]: 6: Hoare triple {499#true} havoc #t~nondet1; {499#true} is VALID [2020-07-18 00:14:28,697 INFO L263 TraceCheckUtils]: 7: Hoare triple {499#true} call #t~ret2 := id(~input~0); {499#true} is VALID [2020-07-18 00:14:28,697 INFO L280 TraceCheckUtils]: 8: Hoare triple {499#true} ~x := #in~x; {499#true} is VALID [2020-07-18 00:14:28,698 INFO L280 TraceCheckUtils]: 9: Hoare triple {499#true} assume !(0 == ~x); {499#true} is VALID [2020-07-18 00:14:28,698 INFO L263 TraceCheckUtils]: 10: Hoare triple {499#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {499#true} is VALID [2020-07-18 00:14:28,698 INFO L280 TraceCheckUtils]: 11: Hoare triple {499#true} ~x := #in~x; {499#true} is VALID [2020-07-18 00:14:28,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {499#true} assume 0 == ~x; {499#true} is VALID [2020-07-18 00:14:28,700 INFO L280 TraceCheckUtils]: 13: Hoare triple {499#true} #res := 0; {511#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:28,701 INFO L280 TraceCheckUtils]: 14: Hoare triple {511#(= 0 |id_#res|)} [49] idFINAL-->idEXIT_primed: Formula: (let ((.cse0 (+ |v_oct_id_#res_in_2| 1))) (and (<= |v_oct_id_#res_out_2| v_oct_id_~ret~0_out_2) (<= (* 2 v_oct_id_~ret~0_out_2) 6) (<= v_oct_id_~ret~0_out_2 .cse0) (<= 0 (+ (* 2 |v_oct_id_#res_in_2|) 4294967296)) (<= v_oct_id_~ret~0_out_2 |v_oct_id_#res_out_2|) (<= .cse0 v_oct_id_~ret~0_out_2))) InVars {id_#res=|v_oct_id_#res_in_2|} OutVars{id_#res=|v_oct_id_#res_out_2|, id_#t~ret0=|v_oct_id_#t~ret0_out_2|, id_~ret~0=v_oct_id_~ret~0_out_2} AuxVars[] AssignedVars[id_#res, id_#t~ret0, id_~ret~0] {512#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:28,702 INFO L280 TraceCheckUtils]: 15: Hoare triple {512#(<= |id_#res| 1)} [48] idEXIT_primed-->idEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {512#(<= |id_#res| 1)} is VALID [2020-07-18 00:14:28,703 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {512#(<= |id_#res| 1)} {499#true} #43#return; {509#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 00:14:28,704 INFO L280 TraceCheckUtils]: 17: Hoare triple {509#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {509#(<= |main_#t~ret2| 1)} is VALID [2020-07-18 00:14:28,705 INFO L280 TraceCheckUtils]: 18: Hoare triple {509#(<= |main_#t~ret2| 1)} ~result~0 := #t~ret2; {510#(<= main_~result~0 1)} is VALID [2020-07-18 00:14:28,706 INFO L280 TraceCheckUtils]: 19: Hoare triple {510#(<= main_~result~0 1)} havoc #t~ret2; {510#(<= main_~result~0 1)} is VALID [2020-07-18 00:14:28,707 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= main_~result~0 1)} assume 5 == ~result~0; {500#false} is VALID [2020-07-18 00:14:28,708 INFO L280 TraceCheckUtils]: 21: Hoare triple {500#false} assume !false; {500#false} is VALID [2020-07-18 00:14:28,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-18 00:14:28,785 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:28,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1940771372] [2020-07-18 00:14:28,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:28,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:14:28,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190930637] [2020-07-18 00:14:28,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-18 00:14:28,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:28,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:14:28,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:28,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:14:28,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:28,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:14:28,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:14:28,822 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2020-07-18 00:14:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:29,056 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-18 00:14:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:14:29,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-18 00:14:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 00:14:29,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 00:14:29,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-18 00:14:29,109 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:29,111 INFO L225 Difference]: With dead ends: 41 [2020-07-18 00:14:29,112 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 00:14:29,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:14:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 00:14:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-18 00:14:29,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:29,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,137 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,138 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:29,141 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 00:14:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 00:14:29,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:29,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:29,142 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,143 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:29,146 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 00:14:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 00:14:29,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:29,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:29,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:29,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:29,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 00:14:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-18 00:14:29,150 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-18 00:14:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:29,151 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-18 00:14:29,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:14:29,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-18 00:14:29,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 00:14:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 00:14:29,222 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:29,223 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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:29,223 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:14:29,223 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:29,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:29,224 INFO L82 PathProgramCache]: Analyzing trace with hash 170302224, now seen corresponding path program 1 times [2020-07-18 00:14:29,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:29,224 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945009508] [2020-07-18 00:14:29,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:29,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:14:29,417 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: must have same length at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.pairwiseEquality(SmtUtils.java:418) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.constructEpsilon(AcceleratedInterpolation.java:526) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:465) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) 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:29,424 INFO L168 Benchmark]: Toolchain (without parser) took 3638.22 ms. Allocated memory was 136.3 MB in the beginning and 251.1 MB in the end (delta: 114.8 MB). Free memory was 100.5 MB in the beginning and 107.2 MB in the end (delta: -6.7 MB). Peak memory consumption was 108.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,425 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 136.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.14 ms. Allocated memory is still 136.3 MB. Free memory was 100.3 MB in the beginning and 90.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,426 INFO L168 Benchmark]: Boogie Preprocessor took 37.77 ms. Allocated memory is still 136.3 MB. Free memory was 90.8 MB in the beginning and 89.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,427 INFO L168 Benchmark]: RCFGBuilder took 421.36 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 89.5 MB in the beginning and 163.2 MB in the end (delta: -73.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,428 INFO L168 Benchmark]: TraceAbstraction took 2897.03 ms. Allocated memory was 200.3 MB in the beginning and 251.1 MB in the end (delta: 50.9 MB). Free memory was 162.5 MB in the beginning and 107.2 MB in the end (delta: 55.3 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,432 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.81 ms. Allocated memory is still 136.3 MB. Free memory was 118.5 MB in the beginning and 118.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.14 ms. Allocated memory is still 136.3 MB. Free memory was 100.3 MB in the beginning and 90.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.77 ms. Allocated memory is still 136.3 MB. Free memory was 90.8 MB in the beginning and 89.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 421.36 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 89.5 MB in the beginning and 163.2 MB in the end (delta: -73.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2897.03 ms. Allocated memory was 200.3 MB in the beginning and 251.1 MB in the end (delta: 50.9 MB). Free memory was 162.5 MB in the beginning and 107.2 MB in the end (delta: 55.3 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: must have same length de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: must have same length: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.pairwiseEquality(SmtUtils.java:418) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...