/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=SHALLOWEST -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 20:15:55,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 20:15:55,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 20:15:55,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 20:15:55,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 20:15:55,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 20:15:55,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 20:15:55,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 20:15:55,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 20:15:55,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 20:15:55,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 20:15:55,366 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 20:15:55,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 20:15:55,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 20:15:55,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 20:15:55,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 20:15:55,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 20:15:55,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 20:15:55,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 20:15:55,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 20:15:55,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 20:15:55,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 20:15:55,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 20:15:55,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 20:15:55,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 20:15:55,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 20:15:55,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 20:15:55,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 20:15:55,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 20:15:55,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 20:15:55,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 20:15:55,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 20:15:55,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 20:15:55,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 20:15:55,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 20:15:55,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 20:15:55,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 20:15:55,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 20:15:55,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 20:15:55,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 20:15:55,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 20:15:55,394 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-08-18 20:15:55,418 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 20:15:55,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 20:15:55,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 20:15:55,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 20:15:55,420 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 20:15:55,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 20:15:55,420 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 20:15:55,421 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 20:15:55,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 20:15:55,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 20:15:55,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 20:15:55,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 20:15:55,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 20:15:55,422 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 20:15:55,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 20:15:55,422 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 20:15:55,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 20:15:55,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 20:15:55,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 20:15:55,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 20:15:55,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 20:15:55,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 20:15:55,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 20:15:55,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 20:15:55,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 20:15:55,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 20:15:55,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 20:15:55,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 20:15:55,425 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 20:15:55,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SHALLOWEST; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=SHALLOWEST; [2020-08-18 20:15:55,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 20:15:55,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 20:15:55,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 20:15:55,811 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 20:15:55,812 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 20:15:55,814 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 20:15:55,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3859e1753/70f247b208ed4788b11b47d2a3b4e2b5/FLAGafdacb15f [2020-08-18 20:15:56,393 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 20:15:56,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 20:15:56,401 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3859e1753/70f247b208ed4788b11b47d2a3b4e2b5/FLAGafdacb15f [2020-08-18 20:15:56,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3859e1753/70f247b208ed4788b11b47d2a3b4e2b5 [2020-08-18 20:15:56,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 20:15:56,797 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 20:15:56,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 20:15:56,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 20:15:56,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 20:15:56,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 08:15:56" (1/1) ... [2020-08-18 20:15:56,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f92ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:56, skipping insertion in model container [2020-08-18 20:15:56,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 08:15:56" (1/1) ... [2020-08-18 20:15:56,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 20:15:56,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 20:15:57,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 20:15:57,050 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 20:15:57,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 20:15:57,078 INFO L208 MainTranslator]: Completed translation [2020-08-18 20:15:57,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57 WrapperNode [2020-08-18 20:15:57,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 20:15:57,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 20:15:57,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 20:15:57,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 20:15:57,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57" (1/1) ... [2020-08-18 20:15:57,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57" (1/1) ... [2020-08-18 20:15:57,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57" (1/1) ... [2020-08-18 20:15:57,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57" (1/1) ... [2020-08-18 20:15:57,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57" (1/1) ... [2020-08-18 20:15:57,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57" (1/1) ... [2020-08-18 20:15:57,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57" (1/1) ... [2020-08-18 20:15:57,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 20:15:57,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 20:15:57,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 20:15:57,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 20:15:57,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57" (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-08-18 20:15:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 20:15:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 20:15:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-18 20:15:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 20:15:57,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 20:15:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 20:15:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-18 20:15:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 20:15:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 20:15:57,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 20:15:57,432 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 20:15:57,433 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 20:15:57,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 08:15:57 BoogieIcfgContainer [2020-08-18 20:15:57,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 20:15:57,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 20:15:57,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 20:15:57,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 20:15:57,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 08:15:56" (1/3) ... [2020-08-18 20:15:57,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bdb4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 08:15:57, skipping insertion in model container [2020-08-18 20:15:57,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 08:15:57" (2/3) ... [2020-08-18 20:15:57,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bdb4aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 08:15:57, skipping insertion in model container [2020-08-18 20:15:57,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 08:15:57" (3/3) ... [2020-08-18 20:15:57,446 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-18 20:15:57,458 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 20:15:57,465 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 20:15:57,481 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 20:15:57,509 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 20:15:57,509 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 20:15:57,509 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 20:15:57,509 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 20:15:57,510 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 20:15:57,510 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 20:15:57,510 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 20:15:57,511 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 20:15:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-18 20:15:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 20:15:57,550 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:15:57,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:15:57,552 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:15:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:15:57,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-18 20:15:57,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:15:57,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [750359138] [2020-08-18 20:15:57,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:15:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:57,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:15:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:57,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:15:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 20:15:57,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [750359138] [2020-08-18 20:15:57,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 20:15:57,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 20:15:57,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588579001] [2020-08-18 20:15:57,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 20:15:57,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:15:57,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 20:15:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 20:15:57,852 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-18 20:15:57,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:15:57,965 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 20:15:57,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 20:15:57,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 20:15:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:15:57,978 INFO L225 Difference]: With dead ends: 35 [2020-08-18 20:15:57,978 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 20:15:57,982 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-08-18 20:15:58,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 20:15:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 20:15:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 20:15:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 20:15:58,033 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 20:15:58,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:15:58,034 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 20:15:58,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 20:15:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 20:15:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 20:15:58,036 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:15:58,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:15:58,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 20:15:58,038 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:15:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:15:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-18 20:15:58,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:15:58,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1892399315] [2020-08-18 20:15:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:15:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:15:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:15:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 20:15:58,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1892399315] [2020-08-18 20:15:58,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 20:15:58,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 20:15:58,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376004685] [2020-08-18 20:15:58,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 20:15:58,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:15:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 20:15:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 20:15:58,122 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 20:15:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:15:58,191 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 20:15:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 20:15:58,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 20:15:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:15:58,193 INFO L225 Difference]: With dead ends: 27 [2020-08-18 20:15:58,194 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 20:15:58,195 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-08-18 20:15:58,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 20:15:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 20:15:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 20:15:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 20:15:58,204 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 20:15:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:15:58,205 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 20:15:58,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 20:15:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 20:15:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 20:15:58,207 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:15:58,207 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-08-18 20:15:58,208 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 20:15:58,208 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:15:58,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:15:58,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-18 20:15:58,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:15:58,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1238665944] [2020-08-18 20:15:58,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:15:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:15:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:15:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 20:15:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-18 20:15:58,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1238665944] [2020-08-18 20:15:58,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:15:58,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 20:15:58,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143410794] [2020-08-18 20:15:58,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 20:15:58,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:15:58,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 20:15:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 20:15:58,376 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-18 20:15:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:15:58,494 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 20:15:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-18 20:15:58,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-18 20:15:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:15:58,496 INFO L225 Difference]: With dead ends: 38 [2020-08-18 20:15:58,496 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 20:15:58,498 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-18 20:15:58,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 20:15:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 20:15:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 20:15:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 20:15:58,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 20:15:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:15:58,507 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 20:15:58,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 20:15:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 20:15:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 20:15:58,508 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:15:58,509 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-08-18 20:15:58,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 20:15:58,509 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:15:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:15:58,510 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-18 20:15:58,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:15:58,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1283389321] [2020-08-18 20:15:58,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:15:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:15:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:15:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:15:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-18 20:15:58,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1283389321] [2020-08-18 20:15:58,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:15:58,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 20:15:58,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171961388] [2020-08-18 20:15:58,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 20:15:58,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:15:58,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 20:15:58,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 20:15:58,618 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 20:15:58,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:15:58,744 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 20:15:58,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 20:15:58,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 20:15:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:15:58,747 INFO L225 Difference]: With dead ends: 41 [2020-08-18 20:15:58,748 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 20:15:58,748 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-18 20:15:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 20:15:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 20:15:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 20:15:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 20:15:58,760 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 20:15:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:15:58,761 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 20:15:58,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 20:15:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 20:15:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 20:15:58,763 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:15:58,763 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-08-18 20:15:58,764 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 20:15:58,764 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:15:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:15:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-18 20:15:58,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:15:58,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1996544833] [2020-08-18 20:15:58,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:15:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:15:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:15:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:15:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:15:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-18 20:15:58,924 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1996544833] [2020-08-18 20:15:58,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:15:58,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 20:15:58,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173855971] [2020-08-18 20:15:58,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 20:15:58,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:15:58,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 20:15:58,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 20:15:58,927 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-18 20:15:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:15:59,050 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-18 20:15:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 20:15:59,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-18 20:15:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:15:59,053 INFO L225 Difference]: With dead ends: 76 [2020-08-18 20:15:59,053 INFO L226 Difference]: Without dead ends: 45 [2020-08-18 20:15:59,054 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-18 20:15:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-18 20:15:59,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-18 20:15:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-18 20:15:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-18 20:15:59,066 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-18 20:15:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:15:59,067 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-18 20:15:59,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 20:15:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-18 20:15:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 20:15:59,069 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:15:59,070 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:15:59,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 20:15:59,070 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:15:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:15:59,071 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-18 20:15:59,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:15:59,072 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1707397299] [2020-08-18 20:15:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:15:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:15:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:15:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:15:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:15:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-18 20:15:59,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1707397299] [2020-08-18 20:15:59,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:15:59,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 20:15:59,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579056029] [2020-08-18 20:15:59,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 20:15:59,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:15:59,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 20:15:59,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 20:15:59,206 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-18 20:15:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:15:59,320 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-18 20:15:59,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 20:15:59,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 20:15:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:15:59,323 INFO L225 Difference]: With dead ends: 62 [2020-08-18 20:15:59,323 INFO L226 Difference]: Without dead ends: 58 [2020-08-18 20:15:59,324 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 20:15:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-18 20:15:59,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-18 20:15:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-18 20:15:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-18 20:15:59,339 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-18 20:15:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:15:59,339 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-18 20:15:59,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 20:15:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-18 20:15:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-18 20:15:59,343 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:15:59,344 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:15:59,344 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 20:15:59,344 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:15:59,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:15:59,345 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-18 20:15:59,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:15:59,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1980796399] [2020-08-18 20:15:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:15:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:15:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:15:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:15:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:15:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:15:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:15:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:15:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:15:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-18 20:15:59,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1980796399] [2020-08-18 20:15:59,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:15:59,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 20:15:59,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972428298] [2020-08-18 20:15:59,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 20:15:59,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:15:59,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 20:15:59,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-18 20:15:59,626 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-18 20:15:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:15:59,780 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-18 20:15:59,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 20:15:59,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-18 20:15:59,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:15:59,784 INFO L225 Difference]: With dead ends: 97 [2020-08-18 20:15:59,785 INFO L226 Difference]: Without dead ends: 93 [2020-08-18 20:15:59,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-18 20:15:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-18 20:15:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-18 20:15:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-18 20:15:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-18 20:15:59,805 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-18 20:15:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:15:59,805 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-18 20:15:59,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 20:15:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-18 20:15:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-18 20:15:59,809 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:15:59,809 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:15:59,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 20:15:59,810 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:15:59,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:15:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-18 20:15:59,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:15:59,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1441026027] [2020-08-18 20:15:59,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:15:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:15:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:15:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:15:59,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:15:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:16:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 20:16:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:16:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 20:16:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-18 20:16:00,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1441026027] [2020-08-18 20:16:00,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:16:00,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-18 20:16:00,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979474143] [2020-08-18 20:16:00,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 20:16:00,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:16:00,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 20:16:00,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-18 20:16:00,226 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-18 20:16:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:16:00,623 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-18 20:16:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-18 20:16:00,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-18 20:16:00,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:16:00,625 INFO L225 Difference]: With dead ends: 153 [2020-08-18 20:16:00,626 INFO L226 Difference]: Without dead ends: 71 [2020-08-18 20:16:00,629 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-18 20:16:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-18 20:16:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-18 20:16:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-18 20:16:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-18 20:16:00,639 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-18 20:16:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:16:00,639 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-18 20:16:00,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 20:16:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-18 20:16:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-18 20:16:00,641 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:16:00,642 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:16:00,642 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 20:16:00,642 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:16:00,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:16:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-18 20:16:00,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:16:00,643 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568807508] [2020-08-18 20:16:00,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:16:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:16:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:16:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:16:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 20:16:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:00,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-18 20:16:01,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568807508] [2020-08-18 20:16:01,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:16:01,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-18 20:16:01,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306825114] [2020-08-18 20:16:01,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 20:16:01,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:16:01,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 20:16:01,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-18 20:16:01,037 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-18 20:16:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:16:01,215 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-18 20:16:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 20:16:01,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-18 20:16:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:16:01,219 INFO L225 Difference]: With dead ends: 68 [2020-08-18 20:16:01,219 INFO L226 Difference]: Without dead ends: 64 [2020-08-18 20:16:01,220 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-18 20:16:01,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-18 20:16:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-18 20:16:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-18 20:16:01,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-18 20:16:01,234 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-18 20:16:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:16:01,236 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-18 20:16:01,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 20:16:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-18 20:16:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 20:16:01,241 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:16:01,241 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:16:01,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 20:16:01,245 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:16:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:16:01,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-18 20:16:01,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:16:01,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626531534] [2020-08-18 20:16:01,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:16:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:16:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:16:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:16:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 20:16:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 20:16:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:16:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-18 20:16:01,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626531534] [2020-08-18 20:16:01,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:16:01,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 20:16:01,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59406482] [2020-08-18 20:16:01,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 20:16:01,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:16:01,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 20:16:01,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 20:16:01,724 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-18 20:16:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:16:01,928 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-18 20:16:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 20:16:01,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 20:16:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:16:01,931 INFO L225 Difference]: With dead ends: 180 [2020-08-18 20:16:01,931 INFO L226 Difference]: Without dead ends: 176 [2020-08-18 20:16:01,932 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-18 20:16:01,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-18 20:16:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-18 20:16:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-18 20:16:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-18 20:16:01,950 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-18 20:16:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:16:01,951 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-18 20:16:01,951 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 20:16:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-18 20:16:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-18 20:16:01,955 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:16:01,956 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-08-18 20:16:01,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 20:16:01,956 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:16:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:16:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-18 20:16:01,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:16:01,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [17015987] [2020-08-18 20:16:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:16:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 20:16:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 20:16:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:16:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 20:16:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 20:16:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:16:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 20:16:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 20:16:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 20:16:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 20:16:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 20:16:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 20:16:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 20:16:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-18 20:16:02,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [17015987] [2020-08-18 20:16:02,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 20:16:02,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 20:16:02,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228298699] [2020-08-18 20:16:02,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 20:16:02,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 20:16:02,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 20:16:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-18 20:16:02,697 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-18 20:16:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 20:16:02,976 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-18 20:16:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-18 20:16:02,977 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-18 20:16:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 20:16:02,982 INFO L225 Difference]: With dead ends: 410 [2020-08-18 20:16:02,982 INFO L226 Difference]: Without dead ends: 406 [2020-08-18 20:16:02,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-18 20:16:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-18 20:16:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-18 20:16:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-18 20:16:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-18 20:16:03,036 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-18 20:16:03,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 20:16:03,037 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-18 20:16:03,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 20:16:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-18 20:16:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-18 20:16:03,047 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 20:16:03,048 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 20:16:03,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 20:16:03,048 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 20:16:03,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 20:16:03,049 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 9 times [2020-08-18 20:16:03,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 20:16:03,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [980240221] [2020-08-18 20:16:03,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 20:16:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 20:16:03,185 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 20:16:03,186 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 20:16:03,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 20:16:03,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 08:16:03 BoogieIcfgContainer [2020-08-18 20:16:03,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 20:16:03,277 INFO L168 Benchmark]: Toolchain (without parser) took 6478.65 ms. Allocated memory was 140.0 MB in the beginning and 360.7 MB in the end (delta: 220.7 MB). Free memory was 103.6 MB in the beginning and 133.6 MB in the end (delta: -30.0 MB). Peak memory consumption was 190.7 MB. Max. memory is 7.1 GB. [2020-08-18 20:16:03,278 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-18 20:16:03,279 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.78 ms. Allocated memory is still 140.0 MB. Free memory was 103.4 MB in the beginning and 94.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-18 20:16:03,280 INFO L168 Benchmark]: Boogie Preprocessor took 114.42 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 182.2 MB in the end (delta: -88.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-08-18 20:16:03,280 INFO L168 Benchmark]: RCFGBuilder took 242.95 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 169.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2020-08-18 20:16:03,281 INFO L168 Benchmark]: TraceAbstraction took 5835.46 ms. Allocated memory was 203.4 MB in the beginning and 360.7 MB in the end (delta: 157.3 MB). Free memory was 169.9 MB in the beginning and 133.6 MB in the end (delta: 36.3 MB). Peak memory consumption was 193.6 MB. Max. memory is 7.1 GB. [2020-08-18 20:16:03,285 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.63 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.78 ms. Allocated memory is still 140.0 MB. Free memory was 103.4 MB in the beginning and 94.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.42 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 182.2 MB in the end (delta: -88.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 242.95 ms. Allocated memory is still 203.4 MB. Free memory was 181.5 MB in the beginning and 169.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5835.46 ms. Allocated memory was 203.4 MB in the beginning and 360.7 MB in the end (delta: 157.3 MB). Free memory was 169.9 MB in the beginning and 133.6 MB in the end (delta: 36.3 MB). Peak memory consumption was 193.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.6s, OverallIterations: 12, TraceHistogramMax: 67, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 210 SDtfs, 310 SDslu, 530 SDs, 0 SdLazy, 885 SolverSat, 278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, 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, 11 MinimizatonAttempts, 54 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 968 ConstructedInterpolants, 0 QuantifiedInterpolants, 243366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 6018/8497 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...