/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 false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:17:50,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:17:50,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:17:50,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:17:50,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:17:50,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:17:50,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:17:50,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:17:50,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:17:50,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:17:50,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:17:50,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:17:50,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:17:50,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:17:50,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:17:50,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:17:50,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:17:50,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:17:50,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:17:50,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:17:50,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:17:50,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:17:50,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:17:50,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:17:50,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:17:50,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:17:50,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:17:50,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:17:50,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:17:50,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:17:50,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:17:50,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:17:50,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:17:50,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:17:50,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:17:50,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:17:50,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:17:50,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:17:50,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:17:50,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:17:50,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:17:50,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-21 10:17:50,374 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:17:50,374 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:17:50,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:17:50,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:17:50,377 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:17:50,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:17:50,379 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:17:50,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:17:50,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:17:50,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:17:50,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:17:50,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:17:50,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:17:50,380 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:17:50,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:17:50,380 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:17:50,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:17:50,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:17:50,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:17:50,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:17:50,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:17:50,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:17:50,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:17:50,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:17:50,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:17:50,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:17:50,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:17:50,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:17:50,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:17:50,384 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 -> false [2020-09-21 10:17:50,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:17:50,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:17:50,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:17:50,886 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:17:50,887 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:17:50,888 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-09-21 10:17:50,971 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d47ba3c16/fbfa4bcdd8cd42e8a488262123df41ec/FLAG5f42f6c43 [2020-09-21 10:17:51,556 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:17:51,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-09-21 10:17:51,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d47ba3c16/fbfa4bcdd8cd42e8a488262123df41ec/FLAG5f42f6c43 [2020-09-21 10:17:51,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d47ba3c16/fbfa4bcdd8cd42e8a488262123df41ec [2020-09-21 10:17:51,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:17:51,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:17:51,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:17:51,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:17:51,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:17:51,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:17:51" (1/1) ... [2020-09-21 10:17:51,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51d7e22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:51, skipping insertion in model container [2020-09-21 10:17:51,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:17:51" (1/1) ... [2020-09-21 10:17:51,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:17:51,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:17:52,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:17:52,188 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:17:52,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:17:52,223 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:17:52,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52 WrapperNode [2020-09-21 10:17:52,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:17:52,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:17:52,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:17:52,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:17:52,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52" (1/1) ... [2020-09-21 10:17:52,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52" (1/1) ... [2020-09-21 10:17:52,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52" (1/1) ... [2020-09-21 10:17:52,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52" (1/1) ... [2020-09-21 10:17:52,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52" (1/1) ... [2020-09-21 10:17:52,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52" (1/1) ... [2020-09-21 10:17:52,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52" (1/1) ... [2020-09-21 10:17:52,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:17:52,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:17:52,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:17:52,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:17:52,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:17:52,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:17:52,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:17:52,435 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-21 10:17:52,436 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:17:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:17:52,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:17:52,437 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-21 10:17:52,438 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:17:52,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:17:52,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:17:52,641 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:17:52,641 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:17:52,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:17:52 BoogieIcfgContainer [2020-09-21 10:17:52,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:17:52,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:17:52,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:17:52,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:17:52,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:17:51" (1/3) ... [2020-09-21 10:17:52,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46862b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:17:52, skipping insertion in model container [2020-09-21 10:17:52,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:17:52" (2/3) ... [2020-09-21 10:17:52,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46862b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:17:52, skipping insertion in model container [2020-09-21 10:17:52,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:17:52" (3/3) ... [2020-09-21 10:17:52,656 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-09-21 10:17:52,669 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:17:52,679 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:17:52,722 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:17:52,796 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:17:52,797 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:17:52,800 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:17:52,800 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:17:52,803 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:17:52,803 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:17:52,803 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:17:52,803 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:17:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-09-21 10:17:52,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:17:52,833 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:52,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:52,834 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:52,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:52,840 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-09-21 10:17:52,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:52,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524316721] [2020-09-21 10:17:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:17:53,091 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1524316721] [2020-09-21 10:17:53,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:17:53,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:17:53,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782959837] [2020-09-21 10:17:53,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:17:53,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:53,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:17:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:17:53,116 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-09-21 10:17:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:53,230 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-09-21 10:17:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:17:53,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:17:53,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:53,245 INFO L225 Difference]: With dead ends: 35 [2020-09-21 10:17:53,245 INFO L226 Difference]: Without dead ends: 21 [2020-09-21 10:17:53,249 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-21 10:17:53,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-21 10:17:53,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:17:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-21 10:17:53,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-09-21 10:17:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:53,302 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-21 10:17:53,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:17:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-21 10:17:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-21 10:17:53,305 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:53,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:53,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:17:53,306 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:53,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:53,306 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-09-21 10:17:53,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:53,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1841932552] [2020-09-21 10:17:53,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:17:53,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1841932552] [2020-09-21 10:17:53,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:17:53,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:17:53,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094652628] [2020-09-21 10:17:53,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:17:53,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:53,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:17:53,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:17:53,384 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-09-21 10:17:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:53,447 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-09-21 10:17:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:17:53,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-21 10:17:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:53,449 INFO L225 Difference]: With dead ends: 27 [2020-09-21 10:17:53,450 INFO L226 Difference]: Without dead ends: 23 [2020-09-21 10:17:53,451 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-21 10:17:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-09-21 10:17:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:17:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-21 10:17:53,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-09-21 10:17:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:53,459 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-21 10:17:53,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:17:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-21 10:17:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-21 10:17:53,461 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:53,461 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:53,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:17:53,462 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:53,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:53,463 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-09-21 10:17:53,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:53,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039738373] [2020-09-21 10:17:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-21 10:17:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-21 10:17:53,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039738373] [2020-09-21 10:17:53,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:53,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:17:53,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463720090] [2020-09-21 10:17:53,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:17:53,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:53,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:17:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:17:53,611 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-09-21 10:17:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:53,713 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-09-21 10:17:53,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:17:53,714 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-09-21 10:17:53,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:53,716 INFO L225 Difference]: With dead ends: 38 [2020-09-21 10:17:53,716 INFO L226 Difference]: Without dead ends: 23 [2020-09-21 10:17:53,717 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:17:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-21 10:17:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-21 10:17:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-21 10:17:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-09-21 10:17:53,725 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-09-21 10:17:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:53,726 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-09-21 10:17:53,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:17:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-09-21 10:17:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-21 10:17:53,728 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:53,728 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:53,729 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:17:53,729 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:53,730 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-09-21 10:17:53,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:53,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [498376225] [2020-09-21 10:17:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-21 10:17:53,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [498376225] [2020-09-21 10:17:53,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:53,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:17:53,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418146982] [2020-09-21 10:17:53,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:17:53,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:53,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:17:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:17:53,894 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-09-21 10:17:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:54,017 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-09-21 10:17:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:17:54,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-21 10:17:54,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:54,020 INFO L225 Difference]: With dead ends: 41 [2020-09-21 10:17:54,020 INFO L226 Difference]: Without dead ends: 37 [2020-09-21 10:17:54,021 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-09-21 10:17:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-09-21 10:17:54,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-09-21 10:17:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-21 10:17:54,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-09-21 10:17:54,033 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-09-21 10:17:54,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:54,034 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-09-21 10:17:54,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:17:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-09-21 10:17:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-21 10:17:54,036 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:54,036 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:54,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:17:54,037 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:54,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:54,037 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-09-21 10:17:54,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:54,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [272181192] [2020-09-21 10:17:54,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-21 10:17:54,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [272181192] [2020-09-21 10:17:54,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:54,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:17:54,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973263717] [2020-09-21 10:17:54,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:17:54,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:54,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:17:54,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:17:54,259 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-09-21 10:17:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:54,395 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-09-21 10:17:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:17:54,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-09-21 10:17:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:54,398 INFO L225 Difference]: With dead ends: 79 [2020-09-21 10:17:54,399 INFO L226 Difference]: Without dead ends: 48 [2020-09-21 10:17:54,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:17:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-21 10:17:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-09-21 10:17:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-21 10:17:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-09-21 10:17:54,412 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-09-21 10:17:54,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:54,413 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-09-21 10:17:54,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:17:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-09-21 10:17:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-09-21 10:17:54,415 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:54,415 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-09-21 10:17:54,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:17:54,416 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:54,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-09-21 10:17:54,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:54,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1295337822] [2020-09-21 10:17:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-21 10:17:54,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1295337822] [2020-09-21 10:17:54,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:54,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:17:54,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868286492] [2020-09-21 10:17:54,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:17:54,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:54,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:17:54,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:17:54,596 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-09-21 10:17:54,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:54,731 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-09-21 10:17:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:17:54,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-09-21 10:17:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:54,734 INFO L225 Difference]: With dead ends: 65 [2020-09-21 10:17:54,734 INFO L226 Difference]: Without dead ends: 61 [2020-09-21 10:17:54,735 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-09-21 10:17:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-09-21 10:17:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-09-21 10:17:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-21 10:17:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-09-21 10:17:54,750 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-09-21 10:17:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:54,750 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-09-21 10:17:54,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:17:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-09-21 10:17:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-09-21 10:17:54,754 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:54,755 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:54,755 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:17:54,755 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-09-21 10:17:54,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:54,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [473946799] [2020-09-21 10:17:54,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:54,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-09-21 10:17:55,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [473946799] [2020-09-21 10:17:55,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:55,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:17:55,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260197616] [2020-09-21 10:17:55,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:17:55,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:55,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:17:55,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:17:55,137 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-09-21 10:17:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:55,544 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-09-21 10:17:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:17:55,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-09-21 10:17:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:55,548 INFO L225 Difference]: With dead ends: 107 [2020-09-21 10:17:55,549 INFO L226 Difference]: Without dead ends: 57 [2020-09-21 10:17:55,551 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:17:55,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-21 10:17:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-09-21 10:17:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-21 10:17:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-09-21 10:17:55,562 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-09-21 10:17:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:55,563 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-09-21 10:17:55,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:17:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-09-21 10:17:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-09-21 10:17:55,568 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:55,568 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:55,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:17:55,569 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-09-21 10:17:55,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:55,570 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908731897] [2020-09-21 10:17:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:55,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 193 proven. 313 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2020-09-21 10:17:56,051 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908731897] [2020-09-21 10:17:56,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:56,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:17:56,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946896065] [2020-09-21 10:17:56,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:17:56,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:56,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:17:56,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:17:56,053 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-09-21 10:17:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:56,540 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-09-21 10:17:56,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-21 10:17:56,541 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-09-21 10:17:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:56,543 INFO L225 Difference]: With dead ends: 115 [2020-09-21 10:17:56,543 INFO L226 Difference]: Without dead ends: 74 [2020-09-21 10:17:56,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2020-09-21 10:17:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-09-21 10:17:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-09-21 10:17:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-21 10:17:56,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-09-21 10:17:56,557 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-09-21 10:17:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:56,571 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-09-21 10:17:56,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:17:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-09-21 10:17:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-09-21 10:17:56,574 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:56,574 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-09-21 10:17:56,574 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:17:56,575 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:56,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:56,575 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-09-21 10:17:56,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:56,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [414854243] [2020-09-21 10:17:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:17:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:56,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-09-21 10:17:57,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [414854243] [2020-09-21 10:17:57,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:57,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:17:57,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118700905] [2020-09-21 10:17:57,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:17:57,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:17:57,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:17:57,097 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-09-21 10:17:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:57,339 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-09-21 10:17:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:17:57,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-09-21 10:17:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:57,344 INFO L225 Difference]: With dead ends: 186 [2020-09-21 10:17:57,345 INFO L226 Difference]: Without dead ends: 182 [2020-09-21 10:17:57,345 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-09-21 10:17:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-09-21 10:17:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-09-21 10:17:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-09-21 10:17:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-09-21 10:17:57,369 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-09-21 10:17:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:57,370 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-09-21 10:17:57,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:17:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-09-21 10:17:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-09-21 10:17:57,379 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:57,379 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:57,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:17:57,379 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-09-21 10:17:57,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:57,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [282528305] [2020-09-21 10:17:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:17:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:57,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:17:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-21 10:17:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:17:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:17:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:17:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:17:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:17:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:17:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-09-21 10:17:58,670 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [282528305] [2020-09-21 10:17:58,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:17:58,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-21 10:17:58,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360399962] [2020-09-21 10:17:58,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-21 10:17:58,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:17:58,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-21 10:17:58,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:17:58,672 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-09-21 10:17:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:17:59,599 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-09-21 10:17:59,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-09-21 10:17:59,600 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-09-21 10:17:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:17:59,603 INFO L225 Difference]: With dead ends: 281 [2020-09-21 10:17:59,603 INFO L226 Difference]: Without dead ends: 125 [2020-09-21 10:17:59,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2020-09-21 10:17:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-09-21 10:17:59,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-09-21 10:17:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-09-21 10:17:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-09-21 10:17:59,628 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-09-21 10:17:59,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:17:59,629 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-09-21 10:17:59,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-21 10:17:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-09-21 10:17:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-09-21 10:17:59,650 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:17:59,650 INFO L422 BasicCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:17:59,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:17:59,651 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:17:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:17:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-09-21 10:17:59,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:17:59,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [225124347] [2020-09-21 10:17:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:17:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:17:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:17:59,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:18:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:18:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-21 10:18:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:18:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:00,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-09-21 10:18:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:18:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:18:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-21 10:18:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-09-21 10:18:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:01,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:02,111 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3272 proven. 3796 refuted. 0 times theorem prover too weak. 13923 trivial. 0 not checked. [2020-09-21 10:18:02,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [225124347] [2020-09-21 10:18:02,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:02,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-21 10:18:02,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762722280] [2020-09-21 10:18:02,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-21 10:18:02,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:02,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-21 10:18:02,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:18:02,114 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-09-21 10:18:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:03,309 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-09-21 10:18:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-09-21 10:18:03,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-09-21 10:18:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:03,317 INFO L225 Difference]: With dead ends: 226 [2020-09-21 10:18:03,317 INFO L226 Difference]: Without dead ends: 136 [2020-09-21 10:18:03,321 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2020-09-21 10:18:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-09-21 10:18:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-09-21 10:18:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-09-21 10:18:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-09-21 10:18:03,352 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-09-21 10:18:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:03,353 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-09-21 10:18:03,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-21 10:18:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-09-21 10:18:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-09-21 10:18:03,379 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:03,380 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:03,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:18:03,380 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:03,381 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-09-21 10:18:03,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:03,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1514649758] [2020-09-21 10:18:03,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:18:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:03,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:18:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:04,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:18:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:18:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-21 10:18:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:18:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-09-21 10:18:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:18:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:18:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:05,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-09-21 10:18:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:18:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-21 10:18:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-21 10:18:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-21 10:18:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-21 10:18:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-21 10:18:06,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-21 10:18:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:06,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-21 10:18:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:18:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-09-21 10:18:07,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1514649758] [2020-09-21 10:18:07,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:18:07,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:18:07,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426268644] [2020-09-21 10:18:07,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:18:07,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:18:07,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:18:07,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:18:07,282 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-09-21 10:18:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:18:07,605 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-09-21 10:18:07,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-21 10:18:07,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-09-21 10:18:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:18:07,614 INFO L225 Difference]: With dead ends: 486 [2020-09-21 10:18:07,614 INFO L226 Difference]: Without dead ends: 482 [2020-09-21 10:18:07,616 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:18:07,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-09-21 10:18:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-09-21 10:18:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-09-21 10:18:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-09-21 10:18:07,657 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-09-21 10:18:07,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:18:07,658 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-09-21 10:18:07,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:18:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-09-21 10:18:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-09-21 10:18:07,672 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:18:07,672 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:18:07,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:18:07,673 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:18:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:18:07,673 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-09-21 10:18:07,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:18:07,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [127540834] [2020-09-21 10:18:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:18:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:18:08,426 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:18:08,426 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:18:08,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-21 10:18:08,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:18:08 BoogieIcfgContainer [2020-09-21 10:18:08,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:18:08,521 INFO L168 Benchmark]: Toolchain (without parser) took 16591.52 ms. Allocated memory was 145.2 MB in the beginning and 906.5 MB in the end (delta: 761.3 MB). Free memory was 102.1 MB in the beginning and 575.1 MB in the end (delta: -473.0 MB). Peak memory consumption was 663.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:18:08,522 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:18:08,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.71 ms. Allocated memory is still 145.2 MB. Free memory was 101.7 MB in the beginning and 92.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:18:08,523 INFO L168 Benchmark]: Boogie Preprocessor took 32.39 ms. Allocated memory is still 145.2 MB. Free memory was 92.3 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-21 10:18:08,524 INFO L168 Benchmark]: RCFGBuilder took 388.79 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 91.0 MB in the beginning and 172.5 MB in the end (delta: -81.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-09-21 10:18:08,525 INFO L168 Benchmark]: TraceAbstraction took 15869.50 ms. Allocated memory was 204.5 MB in the beginning and 906.5 MB in the end (delta: 702.0 MB). Free memory was 171.9 MB in the beginning and 575.1 MB in the end (delta: -403.2 MB). Peak memory consumption was 674.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:18:08,529 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 291.71 ms. Allocated memory is still 145.2 MB. Free memory was 101.7 MB in the beginning and 92.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.39 ms. Allocated memory is still 145.2 MB. Free memory was 92.3 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 388.79 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 91.0 MB in the beginning and 172.5 MB in the end (delta: -81.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15869.50 ms. Allocated memory was 204.5 MB in the beginning and 906.5 MB in the end (delta: 702.0 MB). Free memory was 171.9 MB in the beginning and 575.1 MB in the end (delta: -403.2 MB). Peak memory consumption was 674.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; [L25] CALL, EXPR fibo(x) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.6s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1803 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 3443 NumberOfCodeBlocks, 3443 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1448155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 52623/63131 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...