/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy CAMEL_NO_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-19 21:27:20,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-19 21:27:20,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-19 21:27:20,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-19 21:27:20,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-19 21:27:20,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-19 21:27:20,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-19 21:27:20,856 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-19 21:27:20,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-19 21:27:20,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-19 21:27:20,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-19 21:27:20,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-19 21:27:20,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-19 21:27:20,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-19 21:27:20,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-19 21:27:20,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-19 21:27:20,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-19 21:27:20,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-19 21:27:20,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-19 21:27:20,883 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-19 21:27:20,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-19 21:27:20,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-19 21:27:20,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-19 21:27:20,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-19 21:27:20,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-19 21:27:20,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-19 21:27:20,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-19 21:27:20,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-19 21:27:20,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-19 21:27:20,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-19 21:27:20,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-19 21:27:20,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-19 21:27:20,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-19 21:27:20,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-19 21:27:20,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-19 21:27:20,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-19 21:27:20,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-19 21:27:20,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-19 21:27:20,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-19 21:27:20,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-19 21:27:20,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-19 21:27:20,910 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-07-19 21:27:20,952 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-19 21:27:20,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-19 21:27:20,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-19 21:27:20,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-19 21:27:20,955 INFO L138 SettingsManager]: * Use SBE=true [2020-07-19 21:27:20,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-19 21:27:20,955 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-19 21:27:20,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-19 21:27:20,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-19 21:27:20,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-19 21:27:20,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-19 21:27:20,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-19 21:27:20,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-19 21:27:20,960 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-19 21:27:20,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-19 21:27:20,960 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-19 21:27:20,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-19 21:27:20,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-19 21:27:20,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-19 21:27:20,962 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-19 21:27:20,962 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-19 21:27:20,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 21:27:20,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-19 21:27:20,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-19 21:27:20,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-19 21:27:20,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-19 21:27:20,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-19 21:27:20,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-19 21:27:20,963 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-19 21:27:20,963 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_NO_AM [2020-07-19 21:27:21,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-19 21:27:21,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-19 21:27:21,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-19 21:27:21,304 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-19 21:27:21,305 INFO L275 PluginConnector]: CDTParser initialized [2020-07-19 21:27:21,306 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-07-19 21:27:21,398 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f04a46a/7a3834b951754ea49011c492e0774c33/FLAG8667a43d1 [2020-07-19 21:27:21,942 INFO L306 CDTParser]: Found 1 translation units. [2020-07-19 21:27:21,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-07-19 21:27:21,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f04a46a/7a3834b951754ea49011c492e0774c33/FLAG8667a43d1 [2020-07-19 21:27:22,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f04a46a/7a3834b951754ea49011c492e0774c33 [2020-07-19 21:27:22,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-19 21:27:22,318 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-19 21:27:22,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-19 21:27:22,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-19 21:27:22,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-19 21:27:22,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:27:22" (1/1) ... [2020-07-19 21:27:22,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c49e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22, skipping insertion in model container [2020-07-19 21:27:22,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:27:22" (1/1) ... [2020-07-19 21:27:22,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-19 21:27:22,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-19 21:27:22,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:27:22,538 INFO L203 MainTranslator]: Completed pre-run [2020-07-19 21:27:22,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-19 21:27:22,574 INFO L208 MainTranslator]: Completed translation [2020-07-19 21:27:22,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22 WrapperNode [2020-07-19 21:27:22,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-19 21:27:22,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-19 21:27:22,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-19 21:27:22,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-19 21:27:22,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22" (1/1) ... [2020-07-19 21:27:22,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22" (1/1) ... [2020-07-19 21:27:22,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22" (1/1) ... [2020-07-19 21:27:22,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22" (1/1) ... [2020-07-19 21:27:22,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22" (1/1) ... [2020-07-19 21:27:22,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22" (1/1) ... [2020-07-19 21:27:22,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22" (1/1) ... [2020-07-19 21:27:22,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-19 21:27:22,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-19 21:27:22,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-19 21:27:22,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-19 21:27:22,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-19 21:27:22,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-19 21:27:22,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-19 21:27:22,790 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-07-19 21:27:22,790 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-07-19 21:27:22,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-19 21:27:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-19 21:27:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-19 21:27:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-07-19 21:27:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-07-19 21:27:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-19 21:27:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-19 21:27:22,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-19 21:27:22,996 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-19 21:27:22,996 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-19 21:27:23,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:27:23 BoogieIcfgContainer [2020-07-19 21:27:23,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-19 21:27:23,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-19 21:27:23,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-19 21:27:23,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-19 21:27:23,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:27:22" (1/3) ... [2020-07-19 21:27:23,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6ed30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:27:23, skipping insertion in model container [2020-07-19 21:27:23,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:27:22" (2/3) ... [2020-07-19 21:27:23,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b6ed30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:27:23, skipping insertion in model container [2020-07-19 21:27:23,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:27:23" (3/3) ... [2020-07-19 21:27:23,011 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-07-19 21:27:23,025 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-19 21:27:23,034 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-19 21:27:23,052 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-19 21:27:23,094 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-19 21:27:23,095 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-19 21:27:23,095 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-19 21:27:23,096 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-19 21:27:23,096 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-19 21:27:23,096 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-19 21:27:23,096 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-19 21:27:23,097 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-19 21:27:23,125 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-19 21:27:23,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-19 21:27:23,134 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:23,135 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:23,136 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:23,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:23,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-07-19 21:27:23,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:23,158 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664178790] [2020-07-19 21:27:23,159 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:27:23,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664178790] [2020-07-19 21:27:23,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:27:23,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 21:27:23,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731269483] [2020-07-19 21:27:23,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 21:27:23,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:23,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 21:27:23,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:27:23,461 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-19 21:27:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:23,590 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-07-19 21:27:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 21:27:23,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-19 21:27:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:23,603 INFO L225 Difference]: With dead ends: 44 [2020-07-19 21:27:23,604 INFO L226 Difference]: Without dead ends: 30 [2020-07-19 21:27:23,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:27:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-19 21:27:23,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-19 21:27:23,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-19 21:27:23,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-19 21:27:23,659 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-07-19 21:27:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:23,659 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-19 21:27:23,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 21:27:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-19 21:27:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-19 21:27:23,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:23,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:23,663 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-19 21:27:23,663 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:23,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:23,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-07-19 21:27:23,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:23,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230125658] [2020-07-19 21:27:23,665 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-19 21:27:23,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230125658] [2020-07-19 21:27:23,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-19 21:27:23,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-19 21:27:23,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797178020] [2020-07-19 21:27:23,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-19 21:27:23,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:23,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-19 21:27:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-19 21:27:23,737 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-07-19 21:27:23,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:23,813 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-19 21:27:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-19 21:27:23,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-19 21:27:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:23,817 INFO L225 Difference]: With dead ends: 36 [2020-07-19 21:27:23,817 INFO L226 Difference]: Without dead ends: 32 [2020-07-19 21:27:23,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-19 21:27:23,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-19 21:27:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-19 21:27:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-19 21:27:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-07-19 21:27:23,832 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-07-19 21:27:23,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:23,832 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-07-19 21:27:23,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-19 21:27:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-07-19 21:27:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-19 21:27:23,834 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:23,835 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:23,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-19 21:27:23,835 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-07-19 21:27:23,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:23,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719306200] [2020-07-19 21:27:23,837 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:27:24,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719306200] [2020-07-19 21:27:24,030 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944296319] [2020-07-19 21:27:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 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-07-19 21:27:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:24,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-19 21:27:24,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:24,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:27:24,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:24,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-19 21:27:24,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122832181] [2020-07-19 21:27:24,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-19 21:27:24,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:24,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-19 21:27:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-07-19 21:27:24,191 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-07-19 21:27:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:24,423 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-07-19 21:27:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-19 21:27:24,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-07-19 21:27:24,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:24,425 INFO L225 Difference]: With dead ends: 58 [2020-07-19 21:27:24,426 INFO L226 Difference]: Without dead ends: 34 [2020-07-19 21:27:24,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-19 21:27:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-19 21:27:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-07-19 21:27:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-19 21:27:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-07-19 21:27:24,436 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-07-19 21:27:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:24,437 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-07-19 21:27:24,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-19 21:27:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-07-19 21:27:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-19 21:27:24,439 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:24,439 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:24,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-19 21:27:24,653 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:24,654 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-07-19 21:27:24,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:24,655 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459072786] [2020-07-19 21:27:24,656 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:27:24,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459072786] [2020-07-19 21:27:24,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170453179] [2020-07-19 21:27:24,806 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 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-07-19 21:27:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:24,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-19 21:27:24,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-19 21:27:24,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:24,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-07-19 21:27:24,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122668478] [2020-07-19 21:27:24,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-19 21:27:24,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:24,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-19 21:27:24,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-19 21:27:24,886 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-07-19 21:27:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:25,072 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-07-19 21:27:25,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-19 21:27:25,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-19 21:27:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:25,077 INFO L225 Difference]: With dead ends: 54 [2020-07-19 21:27:25,077 INFO L226 Difference]: Without dead ends: 50 [2020-07-19 21:27:25,078 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:27:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-19 21:27:25,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-19 21:27:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-19 21:27:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-07-19 21:27:25,091 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-07-19 21:27:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:25,092 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-07-19 21:27:25,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-19 21:27:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-07-19 21:27:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-19 21:27:25,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:25,094 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:25,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:25,308 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:25,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-07-19 21:27:25,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:25,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286465017] [2020-07-19 21:27:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-19 21:27:25,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286465017] [2020-07-19 21:27:25,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977366260] [2020-07-19 21:27:25,464 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 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-07-19 21:27:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:25,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-19 21:27:25,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-19 21:27:25,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:25,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-07-19 21:27:25,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604978045] [2020-07-19 21:27:25,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-19 21:27:25,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:25,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-19 21:27:25,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-19 21:27:25,584 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-07-19 21:27:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:25,867 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-07-19 21:27:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-19 21:27:25,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-07-19 21:27:25,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:25,870 INFO L225 Difference]: With dead ends: 108 [2020-07-19 21:27:25,871 INFO L226 Difference]: Without dead ends: 66 [2020-07-19 21:27:25,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-07-19 21:27:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-19 21:27:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-07-19 21:27:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-19 21:27:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-07-19 21:27:25,888 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-07-19 21:27:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:25,898 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-07-19 21:27:25,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-19 21:27:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-07-19 21:27:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-19 21:27:25,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:25,901 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:26,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:26,102 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-07-19 21:27:26,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:26,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198791481] [2020-07-19 21:27:26,105 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-19 21:27:26,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198791481] [2020-07-19 21:27:26,277 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225044001] [2020-07-19 21:27:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 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) [2020-07-19 21:27:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:26,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-19 21:27:26,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:26,376 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-19 21:27:26,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:26,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-19 21:27:26,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343612171] [2020-07-19 21:27:26,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-19 21:27:26,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:26,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-19 21:27:26,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-07-19 21:27:26,379 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-07-19 21:27:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:26,846 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-07-19 21:27:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-19 21:27:26,847 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-07-19 21:27:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:26,855 INFO L225 Difference]: With dead ends: 180 [2020-07-19 21:27:26,856 INFO L226 Difference]: Without dead ends: 120 [2020-07-19 21:27:26,860 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-07-19 21:27:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-07-19 21:27:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-07-19 21:27:26,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-07-19 21:27:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-07-19 21:27:26,886 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-07-19 21:27:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:26,887 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-07-19 21:27:26,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-19 21:27:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-07-19 21:27:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-19 21:27:26,892 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:26,892 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:27,101 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:27,103 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-07-19 21:27:27,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:27,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896834009] [2020-07-19 21:27:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,255 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-19 21:27:27,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896834009] [2020-07-19 21:27:27,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231056576] [2020-07-19 21:27:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 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-07-19 21:27:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:27,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-19 21:27:27,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-19 21:27:27,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:27,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-19 21:27:27,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554402170] [2020-07-19 21:27:27,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-19 21:27:27,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:27,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-19 21:27:27,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-07-19 21:27:27,397 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 14 states. [2020-07-19 21:27:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:27,960 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-07-19 21:27:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-19 21:27:27,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-07-19 21:27:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:27,966 INFO L225 Difference]: With dead ends: 258 [2020-07-19 21:27:27,966 INFO L226 Difference]: Without dead ends: 158 [2020-07-19 21:27:27,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-07-19 21:27:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-19 21:27:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-07-19 21:27:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-07-19 21:27:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-07-19 21:27:28,025 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-07-19 21:27:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:28,025 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-07-19 21:27:28,026 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-19 21:27:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-07-19 21:27:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-07-19 21:27:28,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:28,030 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:28,234 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-19 21:27:28,235 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:28,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2020-07-19 21:27:28,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:28,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269261703] [2020-07-19 21:27:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-07-19 21:27:28,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269261703] [2020-07-19 21:27:28,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217683482] [2020-07-19 21:27:28,527 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 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-07-19 21:27:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:28,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-19 21:27:28,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-19 21:27:28,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:28,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-07-19 21:27:28,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589907575] [2020-07-19 21:27:28,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-19 21:27:28,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:28,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-19 21:27:28,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-19 21:27:28,737 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 16 states. [2020-07-19 21:27:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:29,395 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-07-19 21:27:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-19 21:27:29,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-07-19 21:27:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:29,402 INFO L225 Difference]: With dead ends: 243 [2020-07-19 21:27:29,403 INFO L226 Difference]: Without dead ends: 110 [2020-07-19 21:27:29,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-07-19 21:27:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-19 21:27:29,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-07-19 21:27:29,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-19 21:27:29,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-07-19 21:27:29,418 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 82 [2020-07-19 21:27:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:29,418 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-07-19 21:27:29,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-19 21:27:29,419 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-07-19 21:27:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-19 21:27:29,421 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:29,421 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:29,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:29,636 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:29,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2020-07-19 21:27:29,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:29,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527632310] [2020-07-19 21:27:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2020-07-19 21:27:29,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527632310] [2020-07-19 21:27:29,875 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334128138] [2020-07-19 21:27:29,875 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:29,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-19 21:27:29,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:30,033 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-07-19 21:27:30,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:30,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-19 21:27:30,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136289718] [2020-07-19 21:27:30,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-19 21:27:30,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:30,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-19 21:27:30,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-07-19 21:27:30,038 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 15 states. [2020-07-19 21:27:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:30,552 INFO L93 Difference]: Finished difference Result 172 states and 251 transitions. [2020-07-19 21:27:30,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-19 21:27:30,553 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2020-07-19 21:27:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:30,555 INFO L225 Difference]: With dead ends: 172 [2020-07-19 21:27:30,555 INFO L226 Difference]: Without dead ends: 96 [2020-07-19 21:27:30,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2020-07-19 21:27:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-19 21:27:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-07-19 21:27:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-19 21:27:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2020-07-19 21:27:30,568 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 123 [2020-07-19 21:27:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:30,568 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2020-07-19 21:27:30,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-19 21:27:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2020-07-19 21:27:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-07-19 21:27:30,570 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:30,571 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:30,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:30,784 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:30,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:30,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1830253150, now seen corresponding path program 2 times [2020-07-19 21:27:30,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:30,786 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675919953] [2020-07-19 21:27:30,787 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 110 proven. 86 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2020-07-19 21:27:31,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675919953] [2020-07-19 21:27:31,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093714086] [2020-07-19 21:27:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:31,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-19 21:27:31,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 78 proven. 108 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2020-07-19 21:27:31,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:31,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2020-07-19 21:27:31,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009164692] [2020-07-19 21:27:31,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-19 21:27:31,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:31,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-19 21:27:31,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-07-19 21:27:31,290 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand 18 states. [2020-07-19 21:27:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:31,873 INFO L93 Difference]: Finished difference Result 204 states and 330 transitions. [2020-07-19 21:27:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-19 21:27:31,874 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 137 [2020-07-19 21:27:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:31,876 INFO L225 Difference]: With dead ends: 204 [2020-07-19 21:27:31,876 INFO L226 Difference]: Without dead ends: 98 [2020-07-19 21:27:31,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2020-07-19 21:27:31,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-19 21:27:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2020-07-19 21:27:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-19 21:27:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2020-07-19 21:27:31,907 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 137 [2020-07-19 21:27:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:31,908 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2020-07-19 21:27:31,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-19 21:27:31,909 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2020-07-19 21:27:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-07-19 21:27:31,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:31,912 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:32,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-19 21:27:32,128 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:32,128 INFO L82 PathProgramCache]: Analyzing trace with hash -529934979, now seen corresponding path program 1 times [2020-07-19 21:27:32,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:32,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790608642] [2020-07-19 21:27:32,134 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 139 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-07-19 21:27:32,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790608642] [2020-07-19 21:27:32,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099453707] [2020-07-19 21:27:32,605 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-19 21:27:32,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-19 21:27:32,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-19 21:27:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2020-07-19 21:27:32,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-19 21:27:32,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 17 [2020-07-19 21:27:32,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227536360] [2020-07-19 21:27:32,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-19 21:27:32,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2020-07-19 21:27:32,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-19 21:27:32,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-07-19 21:27:32,830 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 17 states. [2020-07-19 21:27:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-19 21:27:33,405 INFO L93 Difference]: Finished difference Result 202 states and 257 transitions. [2020-07-19 21:27:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-19 21:27:33,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2020-07-19 21:27:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-19 21:27:33,409 INFO L225 Difference]: With dead ends: 202 [2020-07-19 21:27:33,409 INFO L226 Difference]: Without dead ends: 114 [2020-07-19 21:27:33,411 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2020-07-19 21:27:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-07-19 21:27:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2020-07-19 21:27:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-07-19 21:27:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2020-07-19 21:27:33,421 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 150 [2020-07-19 21:27:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-19 21:27:33,421 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2020-07-19 21:27:33,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-19 21:27:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2020-07-19 21:27:33,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-07-19 21:27:33,424 INFO L414 BasicCegarLoop]: Found error trace [2020-07-19 21:27:33,424 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-19 21:27:33,638 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-19 21:27:33,639 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-19 21:27:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-19 21:27:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 2 times [2020-07-19 21:27:33,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2020-07-19 21:27:33,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706267449] [2020-07-19 21:27:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@2d190022 [2020-07-19 21:27:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 21:27:33,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 21:27:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-19 21:27:33,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-19 21:27:33,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2020-07-19 21:27:33,751 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-19 21:27:33,751 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-19 21:27:33,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 09:27:33 BoogieIcfgContainer [2020-07-19 21:27:33,864 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-19 21:27:33,867 INFO L168 Benchmark]: Toolchain (without parser) took 11549.52 ms. Allocated memory was 146.3 MB in the beginning and 325.1 MB in the end (delta: 178.8 MB). Free memory was 102.4 MB in the beginning and 203.4 MB in the end (delta: -101.0 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. [2020-07-19 21:27:33,869 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 146.3 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-19 21:27:33,870 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.18 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-19 21:27:33,875 INFO L168 Benchmark]: Boogie Preprocessor took 141.44 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 92.7 MB in the beginning and 182.9 MB in the end (delta: -90.2 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2020-07-19 21:27:33,880 INFO L168 Benchmark]: RCFGBuilder took 284.75 ms. Allocated memory is still 204.5 MB. Free memory was 182.9 MB in the beginning and 170.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-07-19 21:27:33,883 INFO L168 Benchmark]: TraceAbstraction took 10860.95 ms. Allocated memory was 204.5 MB in the beginning and 325.1 MB in the end (delta: 120.6 MB). Free memory was 169.6 MB in the beginning and 203.4 MB in the end (delta: -33.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 7.1 GB. [2020-07-19 21:27:33,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 146.3 MB. Free memory is still 120.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 255.18 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.44 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 92.7 MB in the beginning and 182.9 MB in the end (delta: -90.2 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 284.75 ms. Allocated memory is still 204.5 MB. Free memory was 182.9 MB in the beginning and 170.5 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10860.95 ms. Allocated memory was 204.5 MB in the beginning and 325.1 MB in the end (delta: 120.6 MB). Free memory was 169.6 MB in the beginning and 203.4 MB in the end (delta: -33.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) 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 fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(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] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(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 fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.6s, OverallIterations: 12, TraceHistogramMax: 13, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 338 SDtfs, 497 SDslu, 2048 SDs, 0 SdLazy, 2899 SolverSat, 502 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1080 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=7, 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, 11 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1560 NumberOfCodeBlocks, 1560 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1363 ConstructedInterpolants, 0 QuantifiedInterpolants, 218669 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1524 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 2424/3144 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...