/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/id2_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:41:34,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:41:34,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:41:34,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:41:34,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:41:34,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:41:34,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:41:34,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:41:34,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:41:34,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:41:34,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:41:34,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:41:34,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:41:34,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:41:34,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:41:34,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:41:34,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:41:34,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:41:34,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:41:34,636 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:41:34,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:41:34,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:41:34,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:41:34,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:41:34,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:41:34,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:41:34,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:41:34,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:41:34,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:41:34,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:41:34,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:41:34,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:41:34,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:41:34,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:41:34,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:41:34,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:41:34,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:41:34,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:41:34,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:41:34,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:41:34,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:41:34,684 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 00:41:34,708 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:41:34,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:41:34,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:41:34,714 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:41:34,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:41:34,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:41:34,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:41:34,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:41:34,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:41:34,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:41:34,715 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:41:34,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:41:34,715 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:41:34,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:41:34,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:41:34,716 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:41:34,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:41:34,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:41:34,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:34,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:41:34,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:41:34,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:41:34,722 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-07 00:41:35,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:41:35,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:41:35,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:41:35,171 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:41:35,172 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:41:35,173 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-11-07 00:41:35,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ab86d75/ba4a07d856f94f478929ff382ce0e67e/FLAG4a30a4efd [2020-11-07 00:41:35,872 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:41:35,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-11-07 00:41:35,880 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ab86d75/ba4a07d856f94f478929ff382ce0e67e/FLAG4a30a4efd [2020-11-07 00:41:36,240 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16ab86d75/ba4a07d856f94f478929ff382ce0e67e [2020-11-07 00:41:36,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:41:36,250 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:41:36,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:36,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:41:36,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:41:36,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:36" (1/1) ... [2020-11-07 00:41:36,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@571ce351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36, skipping insertion in model container [2020-11-07 00:41:36,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:36" (1/1) ... [2020-11-07 00:41:36,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:41:36,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:41:36,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:36,483 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:41:36,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:36,519 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:41:36,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36 WrapperNode [2020-11-07 00:41:36,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:36,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:41:36,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:41:36,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:41:36,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36" (1/1) ... [2020-11-07 00:41:36,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36" (1/1) ... [2020-11-07 00:41:36,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36" (1/1) ... [2020-11-07 00:41:36,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36" (1/1) ... [2020-11-07 00:41:36,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36" (1/1) ... [2020-11-07 00:41:36,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36" (1/1) ... [2020-11-07 00:41:36,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36" (1/1) ... [2020-11-07 00:41:36,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:41:36,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:41:36,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:41:36,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:41:36,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36" (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-11-07 00:41:36,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:41:36,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:41:36,647 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:41:36,647 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 00:41:36,648 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-11-07 00:41:36,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:41:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:41:36,648 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:41:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:41:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:41:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:41:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 00:41:36,649 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-11-07 00:41:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:41:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:41:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:41:36,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:41:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:41:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:41:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:41:37,013 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:41:37,013 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:41:37,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:37 BoogieIcfgContainer [2020-11-07 00:41:37,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:41:37,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:41:37,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:41:37,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:41:37,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:36" (1/3) ... [2020-11-07 00:41:37,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f409c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:37, skipping insertion in model container [2020-11-07 00:41:37,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:36" (2/3) ... [2020-11-07 00:41:37,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f409c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:37, skipping insertion in model container [2020-11-07 00:41:37,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:37" (3/3) ... [2020-11-07 00:41:37,030 INFO L111 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2020-11-07 00:41:37,063 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:41:37,077 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:41:37,106 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:41:37,135 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:41:37,145 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:41:37,146 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:41:37,146 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:41:37,146 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:41:37,146 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:41:37,146 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:41:37,147 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:41:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-11-07 00:41:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:41:37,178 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:37,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:37,179 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:37,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash -407315157, now seen corresponding path program 1 times [2020-11-07 00:41:37,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:37,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1652880476] [2020-11-07 00:41:37,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:37,308 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:41:37,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1652880476] [2020-11-07 00:41:37,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:37,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:37,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225119827] [2020-11-07 00:41:37,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:37,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:37,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:37,709 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2020-11-07 00:41:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:38,130 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2020-11-07 00:41:38,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:41:38,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:41:38,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:38,145 INFO L225 Difference]: With dead ends: 59 [2020-11-07 00:41:38,145 INFO L226 Difference]: Without dead ends: 41 [2020-11-07 00:41:38,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-07 00:41:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-11-07 00:41:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-07 00:41:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-11-07 00:41:38,220 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 25 [2020-11-07 00:41:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:38,221 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-11-07 00:41:38,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-11-07 00:41:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 00:41:38,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:38,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:38,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:41:38,225 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:38,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash -795183819, now seen corresponding path program 1 times [2020-11-07 00:41:38,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:38,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1039099586] [2020-11-07 00:41:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:38,231 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 00:41:38,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1039099586] [2020-11-07 00:41:38,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:38,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:41:38,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924847538] [2020-11-07 00:41:38,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:41:38,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:38,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:41:38,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:41:38,464 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 8 states. [2020-11-07 00:41:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:38,842 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-11-07 00:41:38,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:41:38,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-11-07 00:41:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:38,845 INFO L225 Difference]: With dead ends: 55 [2020-11-07 00:41:38,845 INFO L226 Difference]: Without dead ends: 48 [2020-11-07 00:41:38,847 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:41:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-07 00:41:38,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-11-07 00:41:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-07 00:41:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-11-07 00:41:38,864 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 33 [2020-11-07 00:41:38,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:38,865 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-11-07 00:41:38,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:41:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-11-07 00:41:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 00:41:38,867 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:38,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:38,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:41:38,868 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:38,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash 870121323, now seen corresponding path program 1 times [2020-11-07 00:41:38,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:38,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1549851455] [2020-11-07 00:41:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:38,873 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:38,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:39,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:39,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:39,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1549851455] [2020-11-07 00:41:39,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:39,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:39,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000716713] [2020-11-07 00:41:39,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:39,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:39,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:39,067 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 9 states. [2020-11-07 00:41:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:39,493 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-11-07 00:41:39,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:41:39,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-11-07 00:41:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:39,496 INFO L225 Difference]: With dead ends: 65 [2020-11-07 00:41:39,496 INFO L226 Difference]: Without dead ends: 58 [2020-11-07 00:41:39,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:41:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-07 00:41:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2020-11-07 00:41:39,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 00:41:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-11-07 00:41:39,514 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 41 [2020-11-07 00:41:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:39,515 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-11-07 00:41:39,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-11-07 00:41:39,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 00:41:39,517 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:39,517 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:39,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:41:39,518 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:39,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:39,519 INFO L82 PathProgramCache]: Analyzing trace with hash -308032267, now seen corresponding path program 1 times [2020-11-07 00:41:39,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:39,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1367707547] [2020-11-07 00:41:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:39,522 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:39,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:39,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:39,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:39,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:39,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 00:41:39,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1367707547] [2020-11-07 00:41:39,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:39,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:41:39,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343289347] [2020-11-07 00:41:39,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:41:39,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:41:39,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:39,862 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 10 states. [2020-11-07 00:41:40,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:40,492 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-11-07 00:41:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:41:40,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2020-11-07 00:41:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:40,503 INFO L225 Difference]: With dead ends: 75 [2020-11-07 00:41:40,503 INFO L226 Difference]: Without dead ends: 68 [2020-11-07 00:41:40,504 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:41:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-07 00:41:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2020-11-07 00:41:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 00:41:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-11-07 00:41:40,524 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 49 [2020-11-07 00:41:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:40,525 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-11-07 00:41:40,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:41:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-11-07 00:41:40,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 00:41:40,526 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:40,527 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2020-11-07 00:41:40,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:41:40,527 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:40,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1623603797, now seen corresponding path program 2 times [2020-11-07 00:41:40,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:40,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1679581475] [2020-11-07 00:41:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:40,531 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:41:40,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1679581475] [2020-11-07 00:41:40,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:40,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:41:40,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480505967] [2020-11-07 00:41:40,777 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:41:40,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:40,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:41:40,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:41:40,779 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 11 states. [2020-11-07 00:41:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:41,431 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2020-11-07 00:41:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:41,432 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2020-11-07 00:41:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:41,434 INFO L225 Difference]: With dead ends: 85 [2020-11-07 00:41:41,434 INFO L226 Difference]: Without dead ends: 78 [2020-11-07 00:41:41,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:41:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-07 00:41:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2020-11-07 00:41:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 00:41:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-11-07 00:41:41,457 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 57 [2020-11-07 00:41:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:41,458 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-11-07 00:41:41,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:41:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-11-07 00:41:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 00:41:41,459 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:41,460 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2020-11-07 00:41:41,460 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:41:41,460 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1353914187, now seen corresponding path program 2 times [2020-11-07 00:41:41,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:41,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259263359] [2020-11-07 00:41:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:41,467 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 00:41:41,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259263359] [2020-11-07 00:41:41,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:41,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:41:41,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026324875] [2020-11-07 00:41:41,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:41:41,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:41,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:41:41,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:41:41,947 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 16 states. [2020-11-07 00:41:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:43,623 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2020-11-07 00:41:43,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 00:41:43,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2020-11-07 00:41:43,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:43,626 INFO L225 Difference]: With dead ends: 95 [2020-11-07 00:41:43,626 INFO L226 Difference]: Without dead ends: 88 [2020-11-07 00:41:43,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:41:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-07 00:41:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2020-11-07 00:41:43,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-07 00:41:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2020-11-07 00:41:43,652 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 65 [2020-11-07 00:41:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:43,652 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2020-11-07 00:41:43,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:41:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2020-11-07 00:41:43,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:41:43,654 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:43,654 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:43,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:41:43,655 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1561710613, now seen corresponding path program 3 times [2020-11-07 00:41:43,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:43,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [89069224] [2020-11-07 00:41:43,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:43,660 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:43,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:44,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 00:41:44,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [89069224] [2020-11-07 00:41:44,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:44,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:41:44,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744096815] [2020-11-07 00:41:44,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:41:44,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:44,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:41:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:41:44,093 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 13 states. [2020-11-07 00:41:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:45,063 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2020-11-07 00:41:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:41:45,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2020-11-07 00:41:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:45,067 INFO L225 Difference]: With dead ends: 105 [2020-11-07 00:41:45,067 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 00:41:45,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:41:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 00:41:45,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-11-07 00:41:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 00:41:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-11-07 00:41:45,118 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 73 [2020-11-07 00:41:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:45,119 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-11-07 00:41:45,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:41:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-11-07 00:41:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:41:45,121 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:45,121 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:45,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:41:45,121 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:45,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1203189643, now seen corresponding path program 3 times [2020-11-07 00:41:45,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:45,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [858451150] [2020-11-07 00:41:45,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:45,125 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-11-07 00:41:45,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [858451150] [2020-11-07 00:41:45,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:45,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:41:45,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062170639] [2020-11-07 00:41:45,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:41:45,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:45,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:41:45,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:41:45,438 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-11-07 00:41:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:46,250 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2020-11-07 00:41:46,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:41:46,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2020-11-07 00:41:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:46,252 INFO L225 Difference]: With dead ends: 65 [2020-11-07 00:41:46,252 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:41:46,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2020-11-07 00:41:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:41:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:41:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:41:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:41:46,258 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2020-11-07 00:41:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:46,260 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:41:46,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:41:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:41:46,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:41:46,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:41:46,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:41:46,421 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-11-07 00:41:47,035 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2020-11-07 00:41:47,316 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2020-11-07 00:41:47,718 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 31 [2020-11-07 00:41:48,094 WARN L194 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2020-11-07 00:41:48,368 WARN L194 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2020-11-07 00:41:48,748 WARN L194 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2020-11-07 00:41:49,104 WARN L194 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2020-11-07 00:41:49,313 WARN L194 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 31 [2020-11-07 00:41:49,729 WARN L194 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2020-11-07 00:41:49,939 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2020-11-07 00:41:50,135 WARN L194 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2020-11-07 00:41:50,335 WARN L194 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 32 [2020-11-07 00:41:50,515 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,515 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,515 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,515 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,516 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,516 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,516 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:50,516 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:50,516 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,516 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:41:50,516 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,517 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,517 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:41:50,517 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:50,517 INFO L262 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-11-07 00:41:50,517 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-11-07 00:41:50,518 INFO L262 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (or (and (<= |id2_#in~x| 1) .cse0) (and (<= |id2_#t~ret8| 1) .cse1 (<= 1 |id2_#t~ret8|) .cse0)) (<= 1 |id2_#in~x|)) (and (or .cse1 (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3))) (<= 3 |id2_#in~x|) .cse0) (and (<= 5 |id2_#in~x|) .cse0))) [2020-11-07 00:41:50,518 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (= |id2_#in~x| 0) (= id2_~x |id2_#in~x|)) [2020-11-07 00:41:50,518 INFO L262 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (or (and (<= |id2_#in~x| 1) .cse0) (and (<= |id2_#t~ret8| 1) .cse1 (<= 1 |id2_#t~ret8|) .cse0)) (<= 1 |id2_#in~x|)) (and (or .cse1 (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3))) (<= 3 |id2_#in~x|) .cse0) (and (<= 5 |id2_#in~x|) .cse0))) [2020-11-07 00:41:50,518 INFO L262 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (<= 5 |id2_#in~x|) .cse0) (and (<= 3 |id2_#in~x|) (or .cse1 (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3) (<= |id2_#res| 4) (<= 4 |id2_#res|))) .cse0) (and (or (and (<= |id2_#in~x| 1) .cse0) (and (<= 2 |id2_#res|) (<= |id2_#t~ret8| 1) .cse1 (<= 1 |id2_#t~ret8|) (<= |id2_#res| 2) .cse0)) (<= 1 |id2_#in~x|)))) [2020-11-07 00:41:50,518 INFO L262 CegarLoopResult]: At program point id2EXIT(lines 14 17) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (<= 3 |id2_#in~x|) (or (and (<= |id2_#res| 4) .cse0 (<= 4 |id2_#res|)) (and .cse1 .cse0))) (and (= |id2_#in~x| 0) (= |id2_#res| 0) .cse0) (and (or (and (<= 2 |id2_#res|) .cse1 (<= |id2_#res| 2)) (<= |id2_#in~x| 1)) (<= 1 |id2_#in~x|) .cse0) (and (<= 5 |id2_#in~x|) .cse0))) [2020-11-07 00:41:50,519 INFO L269 CegarLoopResult]: At program point id2ENTRY(lines 14 17) the Hoare annotation is: true [2020-11-07 00:41:50,519 INFO L262 CegarLoopResult]: At program point id2FINAL(lines 14 17) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (<= 3 |id2_#in~x|) (or (and (<= |id2_#res| 4) .cse0 (<= 4 |id2_#res|)) (and .cse1 .cse0))) (and (= |id2_#in~x| 0) (= |id2_#res| 0) .cse0) (and (or (and (<= 2 |id2_#res|) .cse1 (<= |id2_#res| 2)) (<= |id2_#in~x| 1)) (<= 1 |id2_#in~x|) .cse0) (and (<= 5 |id2_#in~x|) .cse0))) [2020-11-07 00:41:50,519 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:41:50,519 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:41:50,519 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:41:50,520 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:41:50,520 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 19 25) the Hoare annotation is: true [2020-11-07 00:41:50,520 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 19 25) the Hoare annotation is: (<= 5 main_~input~0) [2020-11-07 00:41:50,520 INFO L262 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: false [2020-11-07 00:41:50,520 INFO L262 CegarLoopResult]: At program point L22(lines 22 24) the Hoare annotation is: (and (<= 5 main_~input~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-11-07 00:41:50,520 INFO L262 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: false [2020-11-07 00:41:50,520 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-11-07 00:41:50,521 INFO L262 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= |main_#t~ret9| 5) (<= 5 main_~input~0)) [2020-11-07 00:41:50,521 INFO L262 CegarLoopResult]: At program point L22-2(lines 19 25) the Hoare annotation is: (<= 5 main_~input~0) [2020-11-07 00:41:50,521 INFO L262 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= |main_#t~ret9| 5) (<= 5 main_~input~0)) [2020-11-07 00:41:50,521 INFO L262 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= |main_#t~ret9| 5) (<= 5 main_~input~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-11-07 00:41:50,521 INFO L262 CegarLoopResult]: At program point idFINAL(lines 9 12) the Hoare annotation is: (let ((.cse1 (<= |id_#in~x| 2)) (.cse2 (= |id_#in~x| id_~x)) (.cse0 (<= |id_#in~x| 4))) (or (and (or (and (<= |id_#res| 3) .cse0 (<= 3 |id_#res|)) .cse1) .cse2 (<= 2 |id_#in~x|)) (and .cse2 (<= 6 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse2 (<= |id_#res| 1) (<= 1 |id_#res|) .cse1) (and .cse2 (= |id_#in~x| 0)) (and (<= 4 |id_#in~x|) (or (and (<= 5 |id_#res|) .cse2 (<= |id_#res| 5)) (and .cse2 .cse0))))) [2020-11-07 00:41:50,522 INFO L262 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 00:41:50,522 INFO L262 CegarLoopResult]: At program point idEXIT(lines 9 12) the Hoare annotation is: (let ((.cse1 (<= |id_#in~x| 2)) (.cse2 (= |id_#in~x| id_~x)) (.cse0 (<= |id_#in~x| 4))) (or (and (or (and (<= |id_#res| 3) .cse0 (<= 3 |id_#res|)) .cse1) .cse2 (<= 2 |id_#in~x|)) (and .cse2 (<= 6 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse2 (<= |id_#res| 1) (<= 1 |id_#res|) .cse1) (and .cse2 (= |id_#in~x| 0)) (and (<= 4 |id_#in~x|) (or (and (<= 5 |id_#res|) .cse2 (<= |id_#res| 5)) (and .cse2 .cse0))))) [2020-11-07 00:41:50,522 INFO L262 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 00:41:50,522 INFO L262 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x)) (.cse1 (<= |id_#in~x| 4))) (or (and .cse0 (<= 6 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (or (and .cse0 (<= |id_#in~x| 2)) (and .cse0 .cse1 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|))) (<= 2 |id_#in~x|)) (and (or (and .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 .cse1)) (<= 4 |id_#in~x|)))) [2020-11-07 00:41:50,522 INFO L262 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-11-07 00:41:50,523 INFO L262 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x)) (.cse1 (<= |id_#in~x| 4))) (or (and .cse0 (<= 6 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (or (and .cse0 (<= |id_#in~x| 2)) (and .cse0 .cse1 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|))) (<= 2 |id_#in~x|)) (and (or (and .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 .cse1)) (<= 4 |id_#in~x|)))) [2020-11-07 00:41:50,523 INFO L262 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (or (and (or (and (<= |id_#res| 3) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= 3 |id_#res|)) (<= |id_#in~x| 2)) (<= 2 |id_#in~x|)) (and (<= 1 |id_#in~x|) (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (<= 4 |id_#in~x|)) (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 5 |id_#res|) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= 6 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 4))))) [2020-11-07 00:41:50,523 INFO L269 CegarLoopResult]: At program point idENTRY(lines 9 12) the Hoare annotation is: true [2020-11-07 00:41:50,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:41:50 BoogieIcfgContainer [2020-11-07 00:41:50,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:41:50,549 INFO L168 Benchmark]: Toolchain (without parser) took 14304.15 ms. Allocated memory was 155.2 MB in the beginning and 324.0 MB in the end (delta: 168.8 MB). Free memory was 131.8 MB in the beginning and 170.8 MB in the end (delta: -39.0 MB). Peak memory consumption was 152.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:50,550 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 155.2 MB. Free memory is still 130.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:41:50,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.27 ms. Allocated memory is still 155.2 MB. Free memory was 131.1 MB in the beginning and 122.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:50,552 INFO L168 Benchmark]: Boogie Preprocessor took 37.07 ms. Allocated memory is still 155.2 MB. Free memory was 122.0 MB in the beginning and 120.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:50,552 INFO L168 Benchmark]: RCFGBuilder took 456.57 ms. Allocated memory is still 155.2 MB. Free memory was 120.6 MB in the beginning and 106.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:50,553 INFO L168 Benchmark]: TraceAbstraction took 13528.76 ms. Allocated memory was 155.2 MB in the beginning and 324.0 MB in the end (delta: 168.8 MB). Free memory was 106.1 MB in the beginning and 170.8 MB in the end (delta: -64.6 MB). Peak memory consumption was 126.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:41:50,557 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 155.2 MB. Free memory is still 130.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 266.27 ms. Allocated memory is still 155.2 MB. Free memory was 131.1 MB in the beginning and 122.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.07 ms. Allocated memory is still 155.2 MB. Free memory was 122.0 MB in the beginning and 120.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 456.57 ms. Allocated memory is still 155.2 MB. Free memory was 120.6 MB in the beginning and 106.7 MB in the end (delta: 14.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13528.76 ms. Allocated memory was 155.2 MB in the beginning and 324.0 MB in the end (delta: 168.8 MB). Free memory was 106.1 MB in the beginning and 170.8 MB in the end (delta: -64.6 MB). Peak memory consumption was 126.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for id2 Derived contract for procedure id2: (((3 <= \old(x) && (((\result <= 4 && x == \old(x)) && 4 <= \result) || (\old(x) <= 3 && x == \old(x)))) || ((\old(x) == 0 && \result == 0) && x == \old(x))) || (((((2 <= \result && \old(x) <= 3) && \result <= 2) || \old(x) <= 1) && 1 <= \old(x)) && x == \old(x))) || (5 <= \old(x) && x == \old(x)) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 5 <= input - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id: ((((((((\result <= 3 && \old(x) <= 4) && 3 <= \result) || \old(x) <= 2) && \old(x) == x) && 2 <= \old(x)) || (\old(x) == x && 6 <= \old(x))) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 2)) || (\old(x) == x && \old(x) == 0)) || (4 <= \old(x) && (((5 <= \result && \old(x) == x) && \result <= 5) || (\old(x) == x && \old(x) <= 4))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.1s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 325 SDtfs, 393 SDslu, 876 SDs, 0 SdLazy, 1996 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 60 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 83 PreInvPairs, 283 NumberOfFragments, 782 HoareAnnotationTreeSize, 83 FomulaSimplifications, 59532 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 46 FomulaSimplificationsInter, 7171 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...