/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:20:50,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:20:50,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:20:50,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:20:50,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:20:50,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:20:50,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:20:50,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:20:50,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:20:50,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:20:50,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:20:50,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:20:50,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:20:50,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:20:50,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:20:50,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:20:50,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:20:50,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:20:50,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:20:50,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:20:50,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:20:50,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:20:50,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:20:50,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:20:50,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:20:50,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:20:50,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:20:50,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:20:50,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:20:50,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:20:50,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:20:50,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:20:50,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:20:50,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:20:50,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:20:50,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:20:50,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:20:50,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:20:50,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:20:50,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:20:50,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:20:50,538 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:20:50,583 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:20:50,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:20:50,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:20:50,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:20:50,586 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:20:50,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:20:50,586 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:20:50,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:20:50,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:20:50,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:20:50,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:20:50,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:20:50,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:20:50,589 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:20:50,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:20:50,589 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:20:50,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:20:50,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:20:50,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:20:50,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:20:50,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:20:50,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:20:50,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:20:50,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:20:50,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:20:50,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:20:50,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:20:50,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:20:50,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:20:50,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:20:51,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:20:51,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:20:51,050 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:20:51,052 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:20:51,052 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:20:51,054 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-09-04 13:20:51,128 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/92ae22f77/08e216cd477b43059c9c69cc8a3c71df/FLAGda33ee532 [2020-09-04 13:20:51,737 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:20:51,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-09-04 13:20:51,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/92ae22f77/08e216cd477b43059c9c69cc8a3c71df/FLAGda33ee532 [2020-09-04 13:20:52,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/92ae22f77/08e216cd477b43059c9c69cc8a3c71df [2020-09-04 13:20:52,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:20:52,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:20:52,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:20:52,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:20:52,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:20:52,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:20:52" (1/1) ... [2020-09-04 13:20:52,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5c9d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52, skipping insertion in model container [2020-09-04 13:20:52,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:20:52" (1/1) ... [2020-09-04 13:20:52,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:20:52,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:20:52,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:20:52,367 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:20:52,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:20:52,401 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:20:52,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52 WrapperNode [2020-09-04 13:20:52,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:20:52,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:20:52,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:20:52,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:20:52,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52" (1/1) ... [2020-09-04 13:20:52,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52" (1/1) ... [2020-09-04 13:20:52,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52" (1/1) ... [2020-09-04 13:20:52,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52" (1/1) ... [2020-09-04 13:20:52,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52" (1/1) ... [2020-09-04 13:20:52,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52" (1/1) ... [2020-09-04 13:20:52,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52" (1/1) ... [2020-09-04 13:20:52,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:20:52,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:20:52,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:20:52,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:20:52,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:20:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:20:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:20:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-04 13:20:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:20:52,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:20:52,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:20:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-04 13:20:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:20:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:20:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:20:52,844 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:20:52,845 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 13:20:52,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:20:52 BoogieIcfgContainer [2020-09-04 13:20:52,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:20:52,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:20:52,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:20:52,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:20:52,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:20:52" (1/3) ... [2020-09-04 13:20:52,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17af0718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:20:52, skipping insertion in model container [2020-09-04 13:20:52,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:20:52" (2/3) ... [2020-09-04 13:20:52,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17af0718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:20:52, skipping insertion in model container [2020-09-04 13:20:52,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:20:52" (3/3) ... [2020-09-04 13:20:52,861 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-09-04 13:20:52,875 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:20:52,886 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:20:52,909 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:20:52,943 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:20:52,944 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:20:52,944 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:20:52,944 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:20:52,945 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:20:52,945 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:20:52,945 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:20:52,946 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:20:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-09-04 13:20:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-04 13:20:52,974 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:20:52,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:20:52,976 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:20:52,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:20:52,983 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-09-04 13:20:52,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:20:52,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301444559] [2020-09-04 13:20:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:20:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:20:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:20:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:20:53,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301444559] [2020-09-04 13:20:53,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:20:53,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:20:53,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665314729] [2020-09-04 13:20:53,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:20:53,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:20:53,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:20:53,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:20:53,282 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-09-04 13:20:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:20:53,441 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-09-04 13:20:53,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:20:53,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-04 13:20:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:20:53,459 INFO L225 Difference]: With dead ends: 35 [2020-09-04 13:20:53,460 INFO L226 Difference]: Without dead ends: 21 [2020-09-04 13:20:53,465 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-09-04 13:20:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-04 13:20:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-04 13:20:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-04 13:20:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-04 13:20:53,557 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-09-04 13:20:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:20:53,558 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-04 13:20:53,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:20:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-04 13:20:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-04 13:20:53,560 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:20:53,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:20:53,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:20:53,561 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:20:53,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:20:53,562 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-09-04 13:20:53,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:20:53,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820955639] [2020-09-04 13:20:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:20:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:20:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:20:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:20:53,654 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820955639] [2020-09-04 13:20:53,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:20:53,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:20:53,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069458726] [2020-09-04 13:20:53,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:20:53,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:20:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:20:53,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:20:53,660 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-09-04 13:20:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:20:53,733 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-09-04 13:20:53,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:20:53,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-04 13:20:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:20:53,736 INFO L225 Difference]: With dead ends: 27 [2020-09-04 13:20:53,736 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 13:20:53,738 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-09-04 13:20:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 13:20:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-09-04 13:20:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-04 13:20:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-04 13:20:53,749 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-09-04 13:20:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:20:53,750 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-04 13:20:53,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:20:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-04 13:20:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:20:53,752 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:20:53,752 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:20:53,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:20:53,752 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:20:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:20:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-09-04 13:20:53,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:20:53,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040471326] [2020-09-04 13:20:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:20:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:20:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:20:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:20:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:20:53,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040471326] [2020-09-04 13:20:53,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767226832] [2020-09-04 13:20:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:20:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:53,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-04 13:20:53,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:20:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:20:54,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:20:54,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-09-04 13:20:54,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309748063] [2020-09-04 13:20:54,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:20:54,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:20:54,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:20:54,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:20:54,121 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-09-04 13:20:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:20:54,269 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-09-04 13:20:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:20:54,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-09-04 13:20:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:20:54,271 INFO L225 Difference]: With dead ends: 38 [2020-09-04 13:20:54,272 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 13:20:54,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:20:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 13:20:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 13:20:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 13:20:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-09-04 13:20:54,282 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-09-04 13:20:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:20:54,282 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-09-04 13:20:54,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:20:54,283 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-09-04 13:20:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:20:54,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:20:54,284 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:20:54,499 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-04 13:20:54,500 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:20:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:20:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-09-04 13:20:54,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:20:54,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350484797] [2020-09-04 13:20:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:20:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:54,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:20:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:54,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:20:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:54,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:54,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:20:54,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350484797] [2020-09-04 13:20:54,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125616856] [2020-09-04 13:20:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:20:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:54,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-04 13:20:54,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:20:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:20:54,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:20:54,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-09-04 13:20:54,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434816882] [2020-09-04 13:20:54,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:20:54,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:20:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:20:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:20:54,767 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-09-04 13:20:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:20:54,893 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-09-04 13:20:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:20:54,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-09-04 13:20:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:20:54,896 INFO L225 Difference]: With dead ends: 41 [2020-09-04 13:20:54,897 INFO L226 Difference]: Without dead ends: 37 [2020-09-04 13:20:54,898 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:20:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-09-04 13:20:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-09-04 13:20:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-04 13:20:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-09-04 13:20:54,909 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-09-04 13:20:54,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:20:54,910 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-09-04 13:20:54,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:20:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-09-04 13:20:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 13:20:54,912 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:20:54,913 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:20:55,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:20:55,128 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:20:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:20:55,129 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-09-04 13:20:55,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:20:55,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744524401] [2020-09-04 13:20:55,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:20:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:55,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:20:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:55,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:20:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:55,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:55,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:55,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:55,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:20:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 13:20:55,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744524401] [2020-09-04 13:20:55,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449239745] [2020-09-04 13:20:55,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:20:55,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:20:55,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:20:55,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:20:55,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:20:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 13:20:55,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:20:55,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-09-04 13:20:55,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884251242] [2020-09-04 13:20:55,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:20:55,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:20:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:20:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:20:55,481 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-09-04 13:20:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:20:55,753 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-09-04 13:20:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:20:55,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-09-04 13:20:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:20:55,757 INFO L225 Difference]: With dead ends: 72 [2020-09-04 13:20:55,757 INFO L226 Difference]: Without dead ends: 41 [2020-09-04 13:20:55,759 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:20:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-09-04 13:20:55,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-09-04 13:20:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-09-04 13:20:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-09-04 13:20:55,769 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2020-09-04 13:20:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:20:55,770 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-09-04 13:20:55,770 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:20:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-09-04 13:20:55,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-04 13:20:55,773 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:20:55,774 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:20:55,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:20:55,989 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:20:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:20:55,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 3 times [2020-09-04 13:20:55,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:20:55,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125140662] [2020-09-04 13:20:55,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:20:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:20:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:20:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:20:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:20:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 13:20:56,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125140662] [2020-09-04 13:20:56,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947911244] [2020-09-04 13:20:56,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:20:56,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-09-04 13:20:56,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:20:56,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:20:56,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:20:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-09-04 13:20:56,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:20:56,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-09-04 13:20:56,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063337066] [2020-09-04 13:20:56,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:20:56,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:20:56,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:20:56,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:20:56,451 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2020-09-04 13:20:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:20:56,624 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2020-09-04 13:20:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:20:56,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2020-09-04 13:20:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:20:56,629 INFO L225 Difference]: With dead ends: 88 [2020-09-04 13:20:56,629 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 13:20:56,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:20:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 13:20:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-09-04 13:20:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 13:20:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-09-04 13:20:56,646 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 68 [2020-09-04 13:20:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:20:56,647 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-09-04 13:20:56,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:20:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-09-04 13:20:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 13:20:56,650 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:20:56,650 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:20:56,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:20:56,865 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:20:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:20:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash -19418837, now seen corresponding path program 4 times [2020-09-04 13:20:56,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:20:56,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427892904] [2020-09-04 13:20:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:20:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:20:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:56,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:20:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:20:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:20:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:20:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:20:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:20:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 47 proven. 280 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-09-04 13:20:57,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427892904] [2020-09-04 13:20:57,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445618620] [2020-09-04 13:20:57,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:20:57,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-04 13:20:57,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:20:57,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2020-09-04 13:20:57,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:20:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 47 proven. 280 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-09-04 13:20:57,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:20:57,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-09-04 13:20:57,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513260664] [2020-09-04 13:20:57,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:20:57,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:20:57,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:20:57,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:20:57,504 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 10 states. [2020-09-04 13:20:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:20:57,769 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2020-09-04 13:20:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:20:57,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-09-04 13:20:57,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:20:57,774 INFO L225 Difference]: With dead ends: 120 [2020-09-04 13:20:57,774 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 13:20:57,776 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:20:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 13:20:57,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2020-09-04 13:20:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-04 13:20:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2020-09-04 13:20:57,799 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 123 [2020-09-04 13:20:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:20:57,800 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2020-09-04 13:20:57,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:20:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2020-09-04 13:20:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-09-04 13:20:57,805 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:20:57,806 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:20:58,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-09-04 13:20:58,022 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:20:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:20:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 5 times [2020-09-04 13:20:58,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:20:58,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020339677] [2020-09-04 13:20:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:20:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:20:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:20:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:20:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:20:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:20:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:20:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:20:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:20:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:20:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:20:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:20:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:20:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:20:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:20:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 432 proven. 761 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-09-04 13:20:58,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020339677] [2020-09-04 13:20:58,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675204436] [2020-09-04 13:20:58,861 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:20:58,967 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2020-09-04 13:20:58,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:20:58,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2020-09-04 13:20:58,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:20:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2020-09-04 13:20:59,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:20:59,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2020-09-04 13:20:59,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577487352] [2020-09-04 13:20:59,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 13:20:59,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:20:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 13:20:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:20:59,161 INFO L87 Difference]: Start difference. First operand 107 states and 162 transitions. Second operand 19 states. [2020-09-04 13:21:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:21:00,003 INFO L93 Difference]: Finished difference Result 196 states and 368 transitions. [2020-09-04 13:21:00,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 13:21:00,004 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 218 [2020-09-04 13:21:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:21:00,006 INFO L225 Difference]: With dead ends: 196 [2020-09-04 13:21:00,007 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 13:21:00,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 13:21:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 13:21:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2020-09-04 13:21:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-09-04 13:21:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2020-09-04 13:21:00,024 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 218 [2020-09-04 13:21:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:21:00,024 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2020-09-04 13:21:00,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 13:21:00,025 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2020-09-04 13:21:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-09-04 13:21:00,029 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:21:00,029 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:21:00,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:21:00,244 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:21:00,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:21:00,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 6 times [2020-09-04 13:21:00,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:21:00,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991521695] [2020-09-04 13:21:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:21:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:21:00,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:21:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:21:00,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:21:00,465 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:21:00,465 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:21:00,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:21:00,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:21:00 BoogieIcfgContainer [2020-09-04 13:21:00,567 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:21:00,571 INFO L168 Benchmark]: Toolchain (without parser) took 8487.85 ms. Allocated memory was 140.0 MB in the beginning and 313.0 MB in the end (delta: 173.0 MB). Free memory was 102.0 MB in the beginning and 277.2 MB in the end (delta: -175.2 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:21:00,572 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 140.0 MB. Free memory was 120.3 MB in the beginning and 119.9 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. [2020-09-04 13:21:00,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.04 ms. Allocated memory is still 140.0 MB. Free memory was 101.6 MB in the beginning and 92.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:21:00,574 INFO L168 Benchmark]: Boogie Preprocessor took 144.75 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 182.8 MB in the end (delta: -90.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2020-09-04 13:21:00,574 INFO L168 Benchmark]: RCFGBuilder took 301.31 ms. Allocated memory is still 203.9 MB. Free memory was 182.8 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-09-04 13:21:00,575 INFO L168 Benchmark]: TraceAbstraction took 7715.67 ms. Allocated memory was 203.9 MB in the beginning and 313.0 MB in the end (delta: 109.1 MB). Free memory was 170.5 MB in the beginning and 277.2 MB in the end (delta: -106.7 MB). Peak memory consumption was 184.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:21:00,579 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 140.0 MB. Free memory was 120.3 MB in the beginning and 119.9 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 319.04 ms. Allocated memory is still 140.0 MB. Free memory was 101.6 MB in the beginning and 92.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 144.75 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 182.8 MB in the end (delta: -90.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 301.31 ms. Allocated memory is still 203.9 MB. Free memory was 182.8 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 7715.67 ms. Allocated memory was 203.9 MB in the beginning and 313.0 MB in the end (delta: 109.1 MB). Free memory was 170.5 MB in the beginning and 277.2 MB in the end (delta: -106.7 MB). Peak memory consumption was 184.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; VAL [x=7] [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L25] int result = fibo(x); [L26] COND TRUE result == 13 VAL [result=13, x=7] [L27] __VERIFIER_error() VAL [result=13, x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.5s, OverallIterations: 9, TraceHistogramMax: 41, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 158 SDtfs, 355 SDslu, 527 SDs, 0 SdLazy, 844 SolverSat, 348 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 656 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred 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.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1317 NumberOfCodeBlocks, 1233 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1017 ConstructedInterpolants, 0 QuantifiedInterpolants, 228759 SizeOfPredicates, 30 NumberOfNonLiveVariables, 924 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 5125/7176 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...