/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_b5_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:14:24,548 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:14:24,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:14:24,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:14:24,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:14:24,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:14:24,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:14:24,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:14:24,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:14:24,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:14:24,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:14:24,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:14:24,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:14:24,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:14:24,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:14:24,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:14:24,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:14:24,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:14:24,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:14:24,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:14:24,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:14:24,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:14:24,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:14:24,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:14:24,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:14:24,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:14:24,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:14:24,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:14:24,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:14:24,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:14:24,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:14:24,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:14:24,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:14:24,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:14:24,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:14:24,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:14:24,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:14:24,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:14:24,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:14:24,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:14:24,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:14:24,600 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,609 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:14:24,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:14:24,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:14:24,611 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:14:24,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:14:24,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:14:24,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:14:24,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:14:24,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:14:24,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:14:24,612 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:14:24,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:14:24,613 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:14:24,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:14:24,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:14:24,613 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:14:24,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:14:24,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:14:24,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:24,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:14:24,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:14:24,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:14:24,615 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:14:24,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:14:24,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:14:24,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:14:24,985 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:14:24,985 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:14:24,986 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-18 00:14:25,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ad1dd6e/607ae7d1290a4c82b94c1f865a2073c6/FLAGbb539c42b [2020-07-18 00:14:25,488 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:14:25,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-18 00:14:25,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ad1dd6e/607ae7d1290a4c82b94c1f865a2073c6/FLAGbb539c42b [2020-07-18 00:14:25,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75ad1dd6e/607ae7d1290a4c82b94c1f865a2073c6 [2020-07-18 00:14:25,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:25,879 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:25,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:25,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:25,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:25,886 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,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9153e4 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,889 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,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:25,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:26,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:26,125 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:26,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:26,157 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:26,158 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,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:26,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:26,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:26,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:26,173 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,173 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,178 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,178 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,183 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,186 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,187 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,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:26,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:26,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:26,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:26,190 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,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-18 00:14:26,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:26,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-18 00:14:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:26,657 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:26,657 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:26,661 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,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:26,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:26,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:26,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:26,674 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,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52193bda 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,676 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,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52193bda 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,676 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,678 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b5_o10-2.c [2020-07-18 00:14:26,696 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:26,709 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:26,725 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:26,746 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:26,746 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:26,746 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:26,746 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:26,746 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:26,747 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:26,747 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:26,747 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-18 00:14:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-18 00:14:26,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:26,773 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,773 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:26,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:26,778 INFO L82 PathProgramCache]: Analyzing trace with hash 856871792, now seen corresponding path program 1 times [2020-07-18 00:14:26,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:26,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013433047] [2020-07-18 00:14:26,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:27,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 00:14:27,061 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 00:14:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:27,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 00:14:27,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 00:14:27,109 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:27,111 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:27,113 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:27,114 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-18 00:14:27,115 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-18 00:14:27,115 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #39#return; {33#true} is VALID [2020-07-18 00:14:27,116 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret3 := main(); {33#true} is VALID [2020-07-18 00:14:27,116 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {33#true} is VALID [2020-07-18 00:14:27,116 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#true} ~input~0 := #t~nondet1; {33#true} is VALID [2020-07-18 00:14:27,117 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} havoc #t~nondet1; {33#true} is VALID [2020-07-18 00:14:27,117 INFO L263 TraceCheckUtils]: 7: Hoare triple {33#true} call #t~ret2 := id(~input~0); {33#true} is VALID [2020-07-18 00:14:27,118 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#true} ~x := #in~x; {33#true} is VALID [2020-07-18 00:14:27,118 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#true} assume 0 == ~x; {33#true} is VALID [2020-07-18 00:14:27,120 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#true} #res := 0; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:27,121 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#(= 0 |id_#res|)} assume true; {44#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:27,124 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:27,126 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:27,129 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:27,131 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,133 INFO L280 TraceCheckUtils]: 16: Hoare triple {43#(<= main_~result~0 0)} assume 10 == ~result~0; {34#false} is VALID [2020-07-18 00:14:27,133 INFO L280 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-18 00:14:27,137 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,152 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:27,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013433047] [2020-07-18 00:14:27,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:27,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:14:27,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484030281] [2020-07-18 00:14:27,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 00:14:27,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:27,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:14:27,235 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,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:14:27,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:27,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:14:27,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:14:27,249 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-07-18 00:14:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:27,520 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-07-18 00:14:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:14:27,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-18 00:14:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 00:14:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:14:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-18 00:14:27,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2020-07-18 00:14:27,647 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,672 INFO L225 Difference]: With dead ends: 44 [2020-07-18 00:14:27,672 INFO L226 Difference]: Without dead ends: 28 [2020-07-18 00:14:27,676 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,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-18 00:14:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-18 00:14:27,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:27,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,747 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,747 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:27,755 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 00:14:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:14:27,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:27,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:27,756 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,757 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-18 00:14:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:27,762 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-18 00:14:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:14:27,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:27,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:27,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:27,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-18 00:14:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-18 00:14:27,769 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2020-07-18 00:14:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:27,770 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-18 00:14:27,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:14:27,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2020-07-18 00:14:27,824 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,824 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-18 00:14:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 00:14:27,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:27,826 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,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:27,827 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:27,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:27,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1774609951, now seen corresponding path program 1 times [2020-07-18 00:14:27,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:27,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408797298] [2020-07-18 00:14:27,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 00:14:28,145 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 00:14:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 00:14:28,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 00:14:28,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:28,208 INFO L280 TraceCheckUtils]: 3: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse8 (* 2 |v_oct_id_#res_out_1|)) (.cse6 (* 2 v_oct_id_~ret~0_out_1)) (.cse2 (* 2 |v_oct_id_#res_in_1|))) (let ((.cse4 (<= 10 .cse2)) (.cse5 (<= .cse6 12)) (.cse0 (<= .cse8 10)) (.cse1 (<= 10 .cse8)) (.cse3 (<= 12 .cse6))) (or (and .cse0 .cse1 (<= .cse2 4294967294) .cse3 .cse4 .cse5 (<= 0 (+ .cse6 4294967294)) (<= .cse6 4294967296)) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= .cse2 4294967294) (<= .cse6 4294967296) (<= 0 (+ .cse6 4294967294))) (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) .cse0 .cse1 .cse3 (<= .cse6 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:28,209 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:28,209 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {250#false} {249#true} #43#return; {259#(<= |main_#t~ret2| 5)} is VALID [2020-07-18 00:14:28,210 INFO L263 TraceCheckUtils]: 0: Hoare triple {249#true} call ULTIMATE.init(); {249#true} is VALID [2020-07-18 00:14:28,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {249#true} assume true; {249#true} is VALID [2020-07-18 00:14:28,211 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {249#true} {249#true} #39#return; {249#true} is VALID [2020-07-18 00:14:28,211 INFO L263 TraceCheckUtils]: 3: Hoare triple {249#true} call #t~ret3 := main(); {249#true} is VALID [2020-07-18 00:14:28,211 INFO L280 TraceCheckUtils]: 4: Hoare triple {249#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {249#true} is VALID [2020-07-18 00:14:28,212 INFO L280 TraceCheckUtils]: 5: Hoare triple {249#true} ~input~0 := #t~nondet1; {249#true} is VALID [2020-07-18 00:14:28,212 INFO L280 TraceCheckUtils]: 6: Hoare triple {249#true} havoc #t~nondet1; {249#true} is VALID [2020-07-18 00:14:28,212 INFO L263 TraceCheckUtils]: 7: Hoare triple {249#true} call #t~ret2 := id(~input~0); {249#true} is VALID [2020-07-18 00:14:28,213 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 00:14:28,213 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#true} assume !(0 == ~x); {249#true} is VALID [2020-07-18 00:14:28,214 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:28,214 INFO L280 TraceCheckUtils]: 11: Hoare triple {249#true} ~x := #in~x; {249#true} is VALID [2020-07-18 00:14:28,214 INFO L280 TraceCheckUtils]: 12: Hoare triple {249#true} assume 0 == ~x; {249#true} is VALID [2020-07-18 00:14:28,215 INFO L280 TraceCheckUtils]: 13: Hoare triple {249#true} #res := 0; {261#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:28,218 INFO L280 TraceCheckUtils]: 14: Hoare triple {261#(= 0 |id_#res|)} [47] idFINAL-->idEXIT_primed: Formula: (let ((.cse8 (* 2 |v_oct_id_#res_out_1|)) (.cse6 (* 2 v_oct_id_~ret~0_out_1)) (.cse2 (* 2 |v_oct_id_#res_in_1|))) (let ((.cse4 (<= 10 .cse2)) (.cse5 (<= .cse6 12)) (.cse0 (<= .cse8 10)) (.cse1 (<= 10 .cse8)) (.cse3 (<= 12 .cse6))) (or (and .cse0 .cse1 (<= .cse2 4294967294) .cse3 .cse4 .cse5 (<= 0 (+ .cse6 4294967294)) (<= .cse6 4294967296)) (and .cse0 .cse1 .cse3 .cse4 .cse5 (<= .cse2 4294967294) (<= .cse6 4294967296) (<= 0 (+ .cse6 4294967294))) (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) .cse0 .cse1 .cse3 (<= .cse6 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:28,218 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:28,219 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {250#false} {249#true} #43#return; {259#(<= |main_#t~ret2| 5)} is VALID [2020-07-18 00:14:28,220 INFO L280 TraceCheckUtils]: 17: Hoare triple {259#(<= |main_#t~ret2| 5)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; {259#(<= |main_#t~ret2| 5)} is VALID [2020-07-18 00:14:28,221 INFO L280 TraceCheckUtils]: 18: Hoare triple {259#(<= |main_#t~ret2| 5)} ~result~0 := #t~ret2; {260#(<= main_~result~0 5)} is VALID [2020-07-18 00:14:28,224 INFO L280 TraceCheckUtils]: 19: Hoare triple {260#(<= main_~result~0 5)} havoc #t~ret2; {260#(<= main_~result~0 5)} is VALID [2020-07-18 00:14:28,225 INFO L280 TraceCheckUtils]: 20: Hoare triple {260#(<= main_~result~0 5)} assume 10 == ~result~0; {250#false} is VALID [2020-07-18 00:14:28,226 INFO L280 TraceCheckUtils]: 21: Hoare triple {250#false} assume !false; {250#false} is VALID [2020-07-18 00:14:28,227 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,288 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:28,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408797298] [2020-07-18 00:14:28,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:28,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:14:28,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769469828] [2020-07-18 00:14:28,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 00:14:28,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:28,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:14:28,327 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,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:14:28,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:28,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:14:28,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:14:28,329 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2020-07-18 00:14:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:28,574 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-18 00:14:28,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:14:28,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-18 00:14:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:14:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-18 00:14:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:14:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2020-07-18 00:14:28,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2020-07-18 00:14:28,682 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,688 INFO L225 Difference]: With dead ends: 49 [2020-07-18 00:14:28,688 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 00:14:28,691 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,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 00:14:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-18 00:14:28,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:28,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-18 00:14:28,737 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-18 00:14:28,737 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-18 00:14:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:28,744 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-18 00:14:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-18 00:14:28,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:28,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:28,749 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-18 00:14:28,750 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-18 00:14:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:28,760 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2020-07-18 00:14:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-18 00:14:28,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:28,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:28,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:28,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-18 00:14:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-18 00:14:28,771 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2020-07-18 00:14:28,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:28,772 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-18 00:14:28,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:14:28,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2020-07-18 00:14:28,832 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,832 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-18 00:14:28,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-18 00:14:28,833 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:28,833 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,834 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:28,834 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:28,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:28,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1645321695, now seen corresponding path program 1 times [2020-07-18 00:14:28,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:28,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1787801683] [2020-07-18 00:14:28,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:28,965 INFO L280 TraceCheckUtils]: 0: Hoare triple {499#true} assume true; {499#true} is VALID [2020-07-18 00:14:28,966 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {499#true} {499#true} #39#return; {499#true} is VALID [2020-07-18 00:14:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:29,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {499#true} ~x := #in~x; {499#true} is VALID [2020-07-18 00:14:29,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {499#true} assume 0 == ~x; {499#true} is VALID [2020-07-18 00:14:29,009 INFO L280 TraceCheckUtils]: 2: Hoare triple {499#true} #res := 0; {511#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:29,010 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) 10) (<= v_oct_id_~ret~0_out_2 .cse0) (<= v_oct_id_~ret~0_out_2 |v_oct_id_#res_out_2|) (<= .cse0 v_oct_id_~ret~0_out_2) (<= 0 (+ (* 2 |v_oct_id_#res_in_2|) 4294967296)))) 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:29,011 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:29,012 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:29,013 INFO L263 TraceCheckUtils]: 0: Hoare triple {499#true} call ULTIMATE.init(); {499#true} is VALID [2020-07-18 00:14:29,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {499#true} assume true; {499#true} is VALID [2020-07-18 00:14:29,014 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {499#true} {499#true} #39#return; {499#true} is VALID [2020-07-18 00:14:29,014 INFO L263 TraceCheckUtils]: 3: Hoare triple {499#true} call #t~ret3 := main(); {499#true} is VALID [2020-07-18 00:14:29,014 INFO L280 TraceCheckUtils]: 4: Hoare triple {499#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {499#true} is VALID [2020-07-18 00:14:29,014 INFO L280 TraceCheckUtils]: 5: Hoare triple {499#true} ~input~0 := #t~nondet1; {499#true} is VALID [2020-07-18 00:14:29,015 INFO L280 TraceCheckUtils]: 6: Hoare triple {499#true} havoc #t~nondet1; {499#true} is VALID [2020-07-18 00:14:29,015 INFO L263 TraceCheckUtils]: 7: Hoare triple {499#true} call #t~ret2 := id(~input~0); {499#true} is VALID [2020-07-18 00:14:29,015 INFO L280 TraceCheckUtils]: 8: Hoare triple {499#true} ~x := #in~x; {499#true} is VALID [2020-07-18 00:14:29,016 INFO L280 TraceCheckUtils]: 9: Hoare triple {499#true} assume !(0 == ~x); {499#true} is VALID [2020-07-18 00:14:29,016 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:29,016 INFO L280 TraceCheckUtils]: 11: Hoare triple {499#true} ~x := #in~x; {499#true} is VALID [2020-07-18 00:14:29,016 INFO L280 TraceCheckUtils]: 12: Hoare triple {499#true} assume 0 == ~x; {499#true} is VALID [2020-07-18 00:14:29,017 INFO L280 TraceCheckUtils]: 13: Hoare triple {499#true} #res := 0; {511#(= 0 |id_#res|)} is VALID [2020-07-18 00:14:29,019 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) 10) (<= v_oct_id_~ret~0_out_2 .cse0) (<= v_oct_id_~ret~0_out_2 |v_oct_id_#res_out_2|) (<= .cse0 v_oct_id_~ret~0_out_2) (<= 0 (+ (* 2 |v_oct_id_#res_in_2|) 4294967296)))) 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:29,020 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:29,021 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:29,022 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:29,023 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:29,023 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:29,024 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= main_~result~0 1)} assume 10 == ~result~0; {500#false} is VALID [2020-07-18 00:14:29,024 INFO L280 TraceCheckUtils]: 21: Hoare triple {500#false} assume !false; {500#false} is VALID [2020-07-18 00:14:29,025 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:29,096 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:29,096 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1787801683] [2020-07-18 00:14:29,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:29,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:14:29,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34829491] [2020-07-18 00:14:29,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-18 00:14:29,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:29,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:14:29,128 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:29,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:14:29,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:29,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:14:29,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:14:29,130 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 10 states. [2020-07-18 00:14:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:29,360 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2020-07-18 00:14:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:14:29,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-18 00:14:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 00:14:29,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2020-07-18 00:14:29,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2020-07-18 00:14:29,410 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,412 INFO L225 Difference]: With dead ends: 41 [2020-07-18 00:14:29,413 INFO L226 Difference]: Without dead ends: 35 [2020-07-18 00:14:29,413 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,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-18 00:14:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-18 00:14:29,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:29,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,451 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,451 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:29,456 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 00:14:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 00:14:29,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:29,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:29,458 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,458 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-18 00:14:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:29,462 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2020-07-18 00:14:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 00:14:29,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:29,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:29,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:29,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 00:14:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2020-07-18 00:14:29,475 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2020-07-18 00:14:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:29,476 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2020-07-18 00:14:29,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:14:29,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2020-07-18 00:14:29,533 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,533 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2020-07-18 00:14:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 00:14:29,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:29,535 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,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:14:29,535 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:29,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:29,536 INFO L82 PathProgramCache]: Analyzing trace with hash 170302224, now seen corresponding path program 1 times [2020-07-18 00:14:29,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:29,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1483199930] [2020-07-18 00:14:29,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:29,773 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:14:29,774 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,781 INFO L168 Benchmark]: Toolchain (without parser) took 3901.19 ms. Allocated memory was 140.0 MB in the beginning and 244.3 MB in the end (delta: 104.3 MB). Free memory was 105.9 MB in the beginning and 212.0 MB in the end (delta: -106.2 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,783 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 00:14:29,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.85 ms. Allocated memory is still 140.0 MB. Free memory was 105.4 MB in the beginning and 95.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,786 INFO L168 Benchmark]: Boogie Preprocessor took 29.88 ms. Allocated memory is still 140.0 MB. Free memory was 95.8 MB in the beginning and 94.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,787 INFO L168 Benchmark]: RCFGBuilder took 472.85 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 94.5 MB in the beginning and 163.7 MB in the end (delta: -69.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,789 INFO L168 Benchmark]: TraceAbstraction took 3106.67 ms. Allocated memory was 200.8 MB in the beginning and 244.3 MB in the end (delta: 43.5 MB). Free memory was 163.7 MB in the beginning and 212.0 MB in the end (delta: -48.4 MB). Peak memory consumption was 108.2 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:29,793 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.22 ms. Allocated memory is still 140.0 MB. Free memory is still 123.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.85 ms. Allocated memory is still 140.0 MB. Free memory was 105.4 MB in the beginning and 95.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.88 ms. Allocated memory is still 140.0 MB. Free memory was 95.8 MB in the beginning and 94.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 472.85 ms. Allocated memory was 140.0 MB in the beginning and 200.8 MB in the end (delta: 60.8 MB). Free memory was 94.5 MB in the beginning and 163.7 MB in the end (delta: -69.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3106.67 ms. Allocated memory was 200.8 MB in the beginning and 244.3 MB in the end (delta: 43.5 MB). Free memory was 163.7 MB in the beginning and 212.0 MB in the end (delta: -48.4 MB). Peak memory consumption was 108.2 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...