/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 18:15:16,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 18:15:16,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 18:15:16,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 18:15:16,627 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 18:15:16,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 18:15:16,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 18:15:16,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 18:15:16,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 18:15:16,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 18:15:16,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 18:15:16,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 18:15:16,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 18:15:16,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 18:15:16,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 18:15:16,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 18:15:16,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 18:15:16,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 18:15:16,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 18:15:16,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 18:15:16,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 18:15:16,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 18:15:16,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 18:15:16,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 18:15:16,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 18:15:16,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 18:15:16,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 18:15:16,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 18:15:16,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 18:15:16,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 18:15:16,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 18:15:16,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 18:15:16,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 18:15:16,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 18:15:16,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 18:15:16,693 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 18:15:16,694 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 18:15:16,694 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 18:15:16,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 18:15:16,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 18:15:16,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 18:15:16,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-23 18:15:16,736 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 18:15:16,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 18:15:16,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 18:15:16,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 18:15:16,739 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 18:15:16,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 18:15:16,740 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 18:15:16,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 18:15:16,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 18:15:16,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 18:15:16,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 18:15:16,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 18:15:16,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 18:15:16,742 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 18:15:16,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 18:15:16,743 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 18:15:16,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 18:15:16,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 18:15:16,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 18:15:16,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 18:15:16,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 18:15:16,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 18:15:16,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 18:15:16,746 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 18:15:16,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 18:15:16,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 18:15:16,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 18:15:16,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 18:15:16,747 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 18:15:16,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-10-23 18:15:17,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 18:15:17,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 18:15:17,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 18:15:17,382 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 18:15:17,383 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 18:15:17,384 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-10-23 18:15:17,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac62888a7/040504cce0f8464583905224680b0b71/FLAG1c7c76033 [2020-10-23 18:15:18,493 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 18:15:18,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-10-23 18:15:18,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac62888a7/040504cce0f8464583905224680b0b71/FLAG1c7c76033 [2020-10-23 18:15:18,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac62888a7/040504cce0f8464583905224680b0b71 [2020-10-23 18:15:18,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 18:15:18,842 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 18:15:18,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 18:15:18,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 18:15:18,854 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 18:15:18,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:15:18" (1/1) ... [2020-10-23 18:15:18,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5992023d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:18, skipping insertion in model container [2020-10-23 18:15:18,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:15:18" (1/1) ... [2020-10-23 18:15:18,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 18:15:18,890 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 18:15:19,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:15:19,091 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 18:15:19,113 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 18:15:19,135 INFO L208 MainTranslator]: Completed translation [2020-10-23 18:15:19,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19 WrapperNode [2020-10-23 18:15:19,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 18:15:19,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 18:15:19,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 18:15:19,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 18:15:19,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19" (1/1) ... [2020-10-23 18:15:19,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19" (1/1) ... [2020-10-23 18:15:19,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19" (1/1) ... [2020-10-23 18:15:19,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19" (1/1) ... [2020-10-23 18:15:19,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19" (1/1) ... [2020-10-23 18:15:19,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19" (1/1) ... [2020-10-23 18:15:19,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19" (1/1) ... [2020-10-23 18:15:19,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 18:15:19,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 18:15:19,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 18:15:19,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 18:15:19,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19" (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-10-23 18:15:19,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 18:15:19,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 18:15:19,294 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 18:15:19,295 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-10-23 18:15:19,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 18:15:19,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 18:15:19,295 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 18:15:19,296 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 18:15:19,296 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 18:15:19,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 18:15:19,296 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-10-23 18:15:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 18:15:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 18:15:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 18:15:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 18:15:19,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 18:15:19,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 18:15:19,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 18:15:19,635 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 18:15:19,635 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 18:15:19,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:15:19 BoogieIcfgContainer [2020-10-23 18:15:19,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 18:15:19,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 18:15:19,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 18:15:19,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 18:15:19,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:15:18" (1/3) ... [2020-10-23 18:15:19,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b6324c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:15:19, skipping insertion in model container [2020-10-23 18:15:19,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:15:19" (2/3) ... [2020-10-23 18:15:19,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b6324c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:15:19, skipping insertion in model container [2020-10-23 18:15:19,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:15:19" (3/3) ... [2020-10-23 18:15:19,651 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-10-23 18:15:19,672 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 18:15:19,680 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 18:15:19,722 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 18:15:19,817 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 18:15:19,818 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 18:15:19,821 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 18:15:19,822 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 18:15:19,822 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 18:15:19,822 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 18:15:19,822 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 18:15:19,823 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 18:15:19,873 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-10-23 18:15:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-23 18:15:19,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:15:19,888 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:15:19,889 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:15:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:15:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1708859500, now seen corresponding path program 1 times [2020-10-23 18:15:19,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:15:19,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788324292] [2020-10-23 18:15:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:15:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:20,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:15:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:20,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:15:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:20,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:15:20,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788324292] [2020-10-23 18:15:20,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:15:20,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:15:20,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21031660] [2020-10-23 18:15:20,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:15:20,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:15:20,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:15:20,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:15:20,598 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 6 states. [2020-10-23 18:15:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:15:21,140 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-10-23 18:15:21,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:15:21,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-23 18:15:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:15:21,155 INFO L225 Difference]: With dead ends: 44 [2020-10-23 18:15:21,155 INFO L226 Difference]: Without dead ends: 23 [2020-10-23 18:15:21,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:15:21,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-10-23 18:15:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-23 18:15:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-23 18:15:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-10-23 18:15:21,221 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2020-10-23 18:15:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:15:21,222 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-23 18:15:21,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:15:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-10-23 18:15:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-23 18:15:21,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:15:21,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:15:21,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:15:21,226 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:15:21,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:15:21,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2119969838, now seen corresponding path program 1 times [2020-10-23 18:15:21,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:15:21,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237615145] [2020-10-23 18:15:21,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:15:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:21,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:15:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:21,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:15:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:15:21,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237615145] [2020-10-23 18:15:21,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:15:21,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:15:21,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720891660] [2020-10-23 18:15:21,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:15:21,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:15:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:15:21,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:15:21,403 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-10-23 18:15:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:15:21,699 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-10-23 18:15:21,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:15:21,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-23 18:15:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:15:21,702 INFO L225 Difference]: With dead ends: 30 [2020-10-23 18:15:21,702 INFO L226 Difference]: Without dead ends: 25 [2020-10-23 18:15:21,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:15:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-23 18:15:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-10-23 18:15:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-23 18:15:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-10-23 18:15:21,717 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2020-10-23 18:15:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:15:21,717 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-23 18:15:21,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:15:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-10-23 18:15:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-23 18:15:21,719 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:15:21,719 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:15:21,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:15:21,720 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:15:21,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:15:21,722 INFO L82 PathProgramCache]: Analyzing trace with hash -308126725, now seen corresponding path program 1 times [2020-10-23 18:15:21,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:15:21,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103265431] [2020-10-23 18:15:21,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:15:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:21,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:15:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:21,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:15:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:21,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:21,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-23 18:15:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-23 18:15:21,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103265431] [2020-10-23 18:15:21,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679284126] [2020-10-23 18:15:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:22,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-23 18:15:22,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:15:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-23 18:15:22,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:15:22,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-10-23 18:15:22,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467702882] [2020-10-23 18:15:22,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:15:22,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:15:22,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:15:22,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:15:22,182 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2020-10-23 18:15:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:15:22,724 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-10-23 18:15:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:15:22,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-10-23 18:15:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:15:22,727 INFO L225 Difference]: With dead ends: 41 [2020-10-23 18:15:22,727 INFO L226 Difference]: Without dead ends: 25 [2020-10-23 18:15:22,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:15:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-23 18:15:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-23 18:15:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-23 18:15:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-10-23 18:15:22,739 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 28 [2020-10-23 18:15:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:15:22,740 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-10-23 18:15:22,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:15:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-10-23 18:15:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-23 18:15:22,742 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:15:22,742 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:15:22,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-23 18:15:22,958 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:15:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:15:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1144313053, now seen corresponding path program 1 times [2020-10-23 18:15:22,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:15:22,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290346638] [2020-10-23 18:15:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:15:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:23,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:15:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:23,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:15:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:23,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:23,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 18:15:23,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290346638] [2020-10-23 18:15:23,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818180617] [2020-10-23 18:15:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:23,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-23 18:15:23,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:15:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 18:15:23,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:15:23,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-10-23 18:15:23,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917297740] [2020-10-23 18:15:23,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:15:23,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:15:23,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:15:23,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:15:23,253 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2020-10-23 18:15:23,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:15:23,695 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-10-23 18:15:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:15:23,696 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-10-23 18:15:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:15:23,699 INFO L225 Difference]: With dead ends: 44 [2020-10-23 18:15:23,699 INFO L226 Difference]: Without dead ends: 39 [2020-10-23 18:15:23,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:15:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-23 18:15:23,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-23 18:15:23,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-23 18:15:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-10-23 18:15:23,714 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 29 [2020-10-23 18:15:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:15:23,715 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-10-23 18:15:23,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:15:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2020-10-23 18:15:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-23 18:15:23,718 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:15:23,718 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:15:23,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:23,932 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:15:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:15:23,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1249611306, now seen corresponding path program 2 times [2020-10-23 18:15:23,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:15:23,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801637031] [2020-10-23 18:15:23,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:15:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:24,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:15:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:24,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:15:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:24,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:24,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:24,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:24,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:15:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-23 18:15:24,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801637031] [2020-10-23 18:15:24,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218718794] [2020-10-23 18:15:24,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:24,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-23 18:15:24,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:15:24,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-23 18:15:24,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:15:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-23 18:15:24,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:15:24,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-10-23 18:15:24,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111581216] [2020-10-23 18:15:24,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 18:15:24,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:15:24,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 18:15:24,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:15:24,359 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 13 states. [2020-10-23 18:15:25,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:15:25,424 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2020-10-23 18:15:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 18:15:25,425 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2020-10-23 18:15:25,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:15:25,427 INFO L225 Difference]: With dead ends: 75 [2020-10-23 18:15:25,427 INFO L226 Difference]: Without dead ends: 43 [2020-10-23 18:15:25,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2020-10-23 18:15:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-23 18:15:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-23 18:15:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-23 18:15:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2020-10-23 18:15:25,473 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 42 [2020-10-23 18:15:25,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:15:25,473 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2020-10-23 18:15:25,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 18:15:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-10-23 18:15:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-23 18:15:25,477 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:15:25,477 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:15:25,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:25,692 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:15:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:15:25,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1158728484, now seen corresponding path program 3 times [2020-10-23 18:15:25,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:15:25,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871885269] [2020-10-23 18:15:25,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:15:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:25,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:15:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:25,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:15:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:25,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:25,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:25,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:25,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:25,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:15:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:25,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:15:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:26,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:26,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:26,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:26,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:26,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:15:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:26,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:15:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-10-23 18:15:26,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871885269] [2020-10-23 18:15:26,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656809299] [2020-10-23 18:15:26,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:26,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-10-23 18:15:26,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:15:26,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-23 18:15:26,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:15:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2020-10-23 18:15:26,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:15:26,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-10-23 18:15:26,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344745141] [2020-10-23 18:15:26,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 18:15:26,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:15:26,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 18:15:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:15:26,278 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 14 states. [2020-10-23 18:15:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:15:27,505 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2020-10-23 18:15:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 18:15:27,506 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2020-10-23 18:15:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:15:27,511 INFO L225 Difference]: With dead ends: 95 [2020-10-23 18:15:27,511 INFO L226 Difference]: Without dead ends: 58 [2020-10-23 18:15:27,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2020-10-23 18:15:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-23 18:15:27,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-10-23 18:15:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-23 18:15:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2020-10-23 18:15:27,534 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 98 [2020-10-23 18:15:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:15:27,534 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2020-10-23 18:15:27,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 18:15:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2020-10-23 18:15:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-10-23 18:15:27,539 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:15:27,540 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:15:27,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:27,744 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:15:27,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:15:27,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1296121057, now seen corresponding path program 4 times [2020-10-23 18:15:27,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:15:27,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516035243] [2020-10-23 18:15:27,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:15:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:27,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:15:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:27,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:15:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:27,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:27,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:15:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:15:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:15:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:15:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-10-23 18:15:28,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516035243] [2020-10-23 18:15:28,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141226382] [2020-10-23 18:15:28,122 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:28,191 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-23 18:15:28,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:15:28,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-23 18:15:28,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:15:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-10-23 18:15:28,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:15:28,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-10-23 18:15:28,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814650228] [2020-10-23 18:15:28,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:15:28,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:15:28,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:15:28,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:15:28,272 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 11 states. [2020-10-23 18:15:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:15:29,055 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2020-10-23 18:15:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:15:29,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2020-10-23 18:15:29,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:15:29,064 INFO L225 Difference]: With dead ends: 128 [2020-10-23 18:15:29,065 INFO L226 Difference]: Without dead ends: 123 [2020-10-23 18:15:29,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2020-10-23 18:15:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-10-23 18:15:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2020-10-23 18:15:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-23 18:15:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2020-10-23 18:15:29,098 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 111 [2020-10-23 18:15:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:15:29,099 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2020-10-23 18:15:29,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:15:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2020-10-23 18:15:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-23 18:15:29,103 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:15:29,103 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:15:29,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-23 18:15:29,318 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:15:29,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:15:29,319 INFO L82 PathProgramCache]: Analyzing trace with hash -732775580, now seen corresponding path program 5 times [2020-10-23 18:15:29,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:15:29,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557980639] [2020-10-23 18:15:29,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:15:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:15:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:15:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:15:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:15:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:15:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:15:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:15:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:15:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:15:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:15:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:15:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:15:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-10-23 18:15:29,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557980639] [2020-10-23 18:15:29,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992479053] [2020-10-23 18:15:29,926 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:30,090 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2020-10-23 18:15:30,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:15:30,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-23 18:15:30,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:15:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-10-23 18:15:30,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:15:30,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2020-10-23 18:15:30,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526939685] [2020-10-23 18:15:30,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:15:30,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:15:30,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:15:30,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:15:30,243 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 12 states. [2020-10-23 18:15:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:15:31,264 INFO L93 Difference]: Finished difference Result 256 states and 390 transitions. [2020-10-23 18:15:31,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 18:15:31,265 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2020-10-23 18:15:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:15:31,272 INFO L225 Difference]: With dead ends: 256 [2020-10-23 18:15:31,272 INFO L226 Difference]: Without dead ends: 251 [2020-10-23 18:15:31,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:15:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-10-23 18:15:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 239. [2020-10-23 18:15:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-10-23 18:15:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 367 transitions. [2020-10-23 18:15:31,343 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 367 transitions. Word has length 179 [2020-10-23 18:15:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:15:31,344 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 367 transitions. [2020-10-23 18:15:31,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:15:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 367 transitions. [2020-10-23 18:15:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-10-23 18:15:31,352 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:15:31,353 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:15:31,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:15:31,568 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:15:31,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:15:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1616639890, now seen corresponding path program 6 times [2020-10-23 18:15:31,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:15:31,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990084272] [2020-10-23 18:15:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:15:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:15:31,644 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:15:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:15:31,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:15:31,830 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-23 18:15:31,831 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 18:15:31,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-23 18:15:31,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:15:31 BoogieIcfgContainer [2020-10-23 18:15:31,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:15:31,999 INFO L168 Benchmark]: Toolchain (without parser) took 13160.60 ms. Allocated memory was 170.9 MB in the beginning and 299.9 MB in the end (delta: 129.0 MB). Free memory was 146.7 MB in the beginning and 221.3 MB in the end (delta: -74.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:15:31,999 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 170.9 MB. Free memory is still 142.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:15:32,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.96 ms. Allocated memory is still 170.9 MB. Free memory was 145.9 MB in the beginning and 137.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 18:15:32,006 INFO L168 Benchmark]: Boogie Preprocessor took 45.79 ms. Allocated memory is still 170.9 MB. Free memory was 136.8 MB in the beginning and 135.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:15:32,008 INFO L168 Benchmark]: RCFGBuilder took 453.09 ms. Allocated memory is still 170.9 MB. Free memory was 135.4 MB in the beginning and 123.0 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:15:32,010 INFO L168 Benchmark]: TraceAbstraction took 12354.96 ms. Allocated memory was 170.9 MB in the beginning and 299.9 MB in the end (delta: 129.0 MB). Free memory was 122.5 MB in the beginning and 221.3 MB in the end (delta: -98.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 8.0 GB. [2020-10-23 18:15:32,015 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.22 ms. Allocated memory is still 170.9 MB. Free memory is still 142.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 287.96 ms. Allocated memory is still 170.9 MB. Free memory was 145.9 MB in the beginning and 137.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 45.79 ms. Allocated memory is still 170.9 MB. Free memory was 136.8 MB in the beginning and 135.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 453.09 ms. Allocated memory is still 170.9 MB. Free memory was 135.4 MB in the beginning and 123.0 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12354.96 ms. Allocated memory was 170.9 MB in the beginning and 299.9 MB in the end (delta: 129.0 MB). Free memory was 122.5 MB in the beginning and 221.3 MB in the end (delta: -98.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [result=13, x=7] [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_7-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.0s, OverallIterations: 9, TraceHistogramMax: 41, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 168 SDtfs, 444 SDslu, 235 SDs, 0 SdLazy, 1019 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 760 GetRequests, 627 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1293 NumberOfCodeBlocks, 1242 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 991 ConstructedInterpolants, 0 QuantifiedInterpolants, 186027 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1310 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 4108/5446 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...