/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=NARROWEST -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 21:52:41,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 21:52:41,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 21:52:41,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 21:52:41,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 21:52:41,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 21:52:41,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 21:52:41,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 21:52:41,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 21:52:41,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 21:52:41,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 21:52:41,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 21:52:41,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 21:52:41,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 21:52:41,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 21:52:41,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 21:52:41,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 21:52:41,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 21:52:41,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 21:52:41,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 21:52:41,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 21:52:41,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 21:52:41,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 21:52:41,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 21:52:41,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 21:52:41,434 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 21:52:41,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 21:52:41,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 21:52:41,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 21:52:41,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 21:52:41,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 21:52:41,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 21:52:41,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 21:52:41,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 21:52:41,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 21:52:41,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 21:52:41,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 21:52:41,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 21:52:41,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 21:52:41,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 21:52:41,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 21:52:41,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-18 21:52:41,485 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 21:52:41,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 21:52:41,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 21:52:41,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 21:52:41,487 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 21:52:41,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 21:52:41,488 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 21:52:41,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 21:52:41,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 21:52:41,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 21:52:41,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 21:52:41,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 21:52:41,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 21:52:41,489 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 21:52:41,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 21:52:41,489 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 21:52:41,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 21:52:41,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 21:52:41,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 21:52:41,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 21:52:41,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 21:52:41,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 21:52:41,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 21:52:41,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 21:52:41,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 21:52:41,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 21:52:41,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 21:52:41,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 21:52:41,492 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 21:52:41,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=NARROWEST; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=NARROWEST; [2020-08-18 21:52:41,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 21:52:41,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 21:52:41,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 21:52:41,828 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 21:52:41,829 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 21:52:41,831 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 21:52:41,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/45c9d26c3/641ca4a34b484ba198ce0b629c6d395d/FLAG4195d511e [2020-08-18 21:52:42,296 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 21:52:42,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-18 21:52:42,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/45c9d26c3/641ca4a34b484ba198ce0b629c6d395d/FLAG4195d511e [2020-08-18 21:52:42,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/45c9d26c3/641ca4a34b484ba198ce0b629c6d395d [2020-08-18 21:52:42,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 21:52:42,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 21:52:42,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 21:52:42,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 21:52:42,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 21:52:42,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 09:52:42" (1/1) ... [2020-08-18 21:52:42,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1808924a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:42, skipping insertion in model container [2020-08-18 21:52:42,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 09:52:42" (1/1) ... [2020-08-18 21:52:42,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 21:52:42,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 21:52:42,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 21:52:43,001 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 21:52:43,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 21:52:43,027 INFO L208 MainTranslator]: Completed translation [2020-08-18 21:52:43,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43 WrapperNode [2020-08-18 21:52:43,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 21:52:43,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 21:52:43,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 21:52:43,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 21:52:43,041 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43" (1/1) ... [2020-08-18 21:52:43,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43" (1/1) ... [2020-08-18 21:52:43,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43" (1/1) ... [2020-08-18 21:52:43,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43" (1/1) ... [2020-08-18 21:52:43,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43" (1/1) ... [2020-08-18 21:52:43,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43" (1/1) ... [2020-08-18 21:52:43,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43" (1/1) ... [2020-08-18 21:52:43,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 21:52:43,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 21:52:43,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 21:52:43,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 21:52:43,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 21:52:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 21:52:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 21:52:43,215 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-18 21:52:43,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 21:52:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 21:52:43,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 21:52:43,217 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-18 21:52:43,217 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 21:52:43,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 21:52:43,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 21:52:43,494 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 21:52:43,494 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 21:52:43,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 09:52:43 BoogieIcfgContainer [2020-08-18 21:52:43,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 21:52:43,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 21:52:43,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 21:52:43,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 21:52:43,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 09:52:42" (1/3) ... [2020-08-18 21:52:43,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296790fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 09:52:43, skipping insertion in model container [2020-08-18 21:52:43,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 09:52:43" (2/3) ... [2020-08-18 21:52:43,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296790fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 09:52:43, skipping insertion in model container [2020-08-18 21:52:43,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 09:52:43" (3/3) ... [2020-08-18 21:52:43,516 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-18 21:52:43,529 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 21:52:43,537 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 21:52:43,551 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 21:52:43,576 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 21:52:43,576 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 21:52:43,576 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 21:52:43,576 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 21:52:43,576 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 21:52:43,577 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 21:52:43,577 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 21:52:43,577 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 21:52:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-18 21:52:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 21:52:43,602 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:43,603 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:43,603 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:43,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-18 21:52:43,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:43,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [758083035] [2020-08-18 21:52:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:43,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:43,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:43,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 21:52:43,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [758083035] [2020-08-18 21:52:43,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 21:52:43,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 21:52:43,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12789283] [2020-08-18 21:52:43,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 21:52:43,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:43,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 21:52:43,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 21:52:43,885 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-18 21:52:43,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:43,987 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 21:52:43,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 21:52:43,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 21:52:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:44,003 INFO L225 Difference]: With dead ends: 35 [2020-08-18 21:52:44,004 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 21:52:44,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-18 21:52:44,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 21:52:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 21:52:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 21:52:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 21:52:44,047 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 21:52:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:44,047 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 21:52:44,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 21:52:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 21:52:44,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 21:52:44,049 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:44,049 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:44,050 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 21:52:44,050 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:44,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-18 21:52:44,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:44,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1573969398] [2020-08-18 21:52:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-18 21:52:44,125 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1573969398] [2020-08-18 21:52:44,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 21:52:44,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 21:52:44,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390638973] [2020-08-18 21:52:44,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 21:52:44,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 21:52:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 21:52:44,129 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 21:52:44,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:44,196 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 21:52:44,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 21:52:44,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 21:52:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:44,199 INFO L225 Difference]: With dead ends: 27 [2020-08-18 21:52:44,199 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 21:52:44,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-18 21:52:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 21:52:44,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 21:52:44,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 21:52:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 21:52:44,208 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 21:52:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:44,208 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 21:52:44,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 21:52:44,209 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 21:52:44,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 21:52:44,210 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:44,210 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:44,210 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 21:52:44,211 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:44,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-18 21:52:44,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:44,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1901691847] [2020-08-18 21:52:44,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 21:52:44,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-18 21:52:44,435 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1901691847] [2020-08-18 21:52:44,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:44,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 21:52:44,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562163719] [2020-08-18 21:52:44,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 21:52:44,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:44,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 21:52:44,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 21:52:44,437 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-18 21:52:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:44,522 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 21:52:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-18 21:52:44,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-18 21:52:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:44,524 INFO L225 Difference]: With dead ends: 38 [2020-08-18 21:52:44,524 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 21:52:44,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-18 21:52:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 21:52:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 21:52:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 21:52:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 21:52:44,532 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 21:52:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:44,533 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 21:52:44,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 21:52:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 21:52:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 21:52:44,535 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:44,535 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:44,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 21:52:44,536 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:44,536 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-18 21:52:44,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:44,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1190422011] [2020-08-18 21:52:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-18 21:52:44,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1190422011] [2020-08-18 21:52:44,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:44,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 21:52:44,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417025170] [2020-08-18 21:52:44,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 21:52:44,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:44,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 21:52:44,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 21:52:44,651 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 21:52:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:44,762 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 21:52:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 21:52:44,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 21:52:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:44,765 INFO L225 Difference]: With dead ends: 41 [2020-08-18 21:52:44,765 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 21:52:44,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-18 21:52:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 21:52:44,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 21:52:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 21:52:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 21:52:44,778 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 21:52:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:44,778 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 21:52:44,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 21:52:44,779 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 21:52:44,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 21:52:44,780 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:44,781 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:44,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 21:52:44,781 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:44,782 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-18 21:52:44,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:44,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1523068405] [2020-08-18 21:52:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-18 21:52:44,998 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1523068405] [2020-08-18 21:52:44,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:44,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 21:52:44,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342433011] [2020-08-18 21:52:44,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 21:52:44,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:45,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 21:52:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 21:52:45,000 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-18 21:52:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:45,113 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-18 21:52:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 21:52:45,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-18 21:52:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:45,116 INFO L225 Difference]: With dead ends: 76 [2020-08-18 21:52:45,116 INFO L226 Difference]: Without dead ends: 45 [2020-08-18 21:52:45,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-18 21:52:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-18 21:52:45,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-18 21:52:45,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-18 21:52:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-18 21:52:45,130 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-18 21:52:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:45,130 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-18 21:52:45,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 21:52:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-18 21:52:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 21:52:45,132 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:45,133 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:45,133 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 21:52:45,133 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:45,133 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-18 21:52:45,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:45,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248247468] [2020-08-18 21:52:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-18 21:52:45,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248247468] [2020-08-18 21:52:45,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:45,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 21:52:45,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447161575] [2020-08-18 21:52:45,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 21:52:45,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:45,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 21:52:45,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 21:52:45,324 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-18 21:52:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:45,471 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-18 21:52:45,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 21:52:45,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 21:52:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:45,474 INFO L225 Difference]: With dead ends: 62 [2020-08-18 21:52:45,474 INFO L226 Difference]: Without dead ends: 58 [2020-08-18 21:52:45,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 21:52:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-18 21:52:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-18 21:52:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-18 21:52:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-18 21:52:45,504 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-18 21:52:45,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:45,504 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-18 21:52:45,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 21:52:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-18 21:52:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-18 21:52:45,517 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:45,517 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:45,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 21:52:45,518 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:45,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-18 21:52:45,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:45,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [128355339] [2020-08-18 21:52:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:45,837 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-18 21:52:45,837 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [128355339] [2020-08-18 21:52:45,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:45,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 21:52:45,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577967575] [2020-08-18 21:52:45,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 21:52:45,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:45,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 21:52:45,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-18 21:52:45,840 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-18 21:52:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:46,003 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-18 21:52:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-18 21:52:46,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-18 21:52:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:46,007 INFO L225 Difference]: With dead ends: 97 [2020-08-18 21:52:46,008 INFO L226 Difference]: Without dead ends: 93 [2020-08-18 21:52:46,009 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-18 21:52:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-18 21:52:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-18 21:52:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-18 21:52:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-18 21:52:46,029 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-18 21:52:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:46,030 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-18 21:52:46,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 21:52:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-18 21:52:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-18 21:52:46,034 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:46,034 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:46,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 21:52:46,035 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:46,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-18 21:52:46,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:46,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531308229] [2020-08-18 21:52:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 21:52:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 21:52:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-18 21:52:46,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531308229] [2020-08-18 21:52:46,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:46,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-18 21:52:46,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737090047] [2020-08-18 21:52:46,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-18 21:52:46,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:46,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-18 21:52:46,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-18 21:52:46,507 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-18 21:52:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:46,867 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-18 21:52:46,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-18 21:52:46,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-18 21:52:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:46,870 INFO L225 Difference]: With dead ends: 153 [2020-08-18 21:52:46,870 INFO L226 Difference]: Without dead ends: 71 [2020-08-18 21:52:46,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-18 21:52:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-18 21:52:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-18 21:52:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-18 21:52:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-18 21:52:46,881 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-18 21:52:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:46,881 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-18 21:52:46,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-18 21:52:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-18 21:52:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-18 21:52:46,883 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:46,883 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:46,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 21:52:46,884 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:46,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:46,884 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-18 21:52:46,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:46,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400834661] [2020-08-18 21:52:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:46,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 21:52:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-18 21:52:47,164 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400834661] [2020-08-18 21:52:47,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:47,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-18 21:52:47,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546080626] [2020-08-18 21:52:47,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-18 21:52:47,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:47,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-18 21:52:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-18 21:52:47,173 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-18 21:52:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:47,352 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-18 21:52:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-18 21:52:47,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-18 21:52:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:47,355 INFO L225 Difference]: With dead ends: 68 [2020-08-18 21:52:47,355 INFO L226 Difference]: Without dead ends: 64 [2020-08-18 21:52:47,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-18 21:52:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-18 21:52:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-18 21:52:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-18 21:52:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-18 21:52:47,371 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-18 21:52:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:47,372 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-18 21:52:47,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-18 21:52:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-18 21:52:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 21:52:47,374 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:47,374 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:47,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 21:52:47,374 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:47,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-18 21:52:47,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:47,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [920830130] [2020-08-18 21:52:47,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 21:52:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 21:52:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-18 21:52:47,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [920830130] [2020-08-18 21:52:47,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:47,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 21:52:47,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182829067] [2020-08-18 21:52:47,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 21:52:47,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:47,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 21:52:47,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 21:52:47,732 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-18 21:52:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:47,987 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-18 21:52:47,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 21:52:47,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 21:52:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:47,991 INFO L225 Difference]: With dead ends: 180 [2020-08-18 21:52:47,991 INFO L226 Difference]: Without dead ends: 176 [2020-08-18 21:52:47,992 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-18 21:52:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-18 21:52:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-18 21:52:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-18 21:52:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-18 21:52:48,011 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-18 21:52:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:48,012 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-18 21:52:48,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 21:52:48,012 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-18 21:52:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-18 21:52:48,016 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:48,016 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:48,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 21:52:48,017 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:48,017 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-18 21:52:48,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:48,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1926400201] [2020-08-18 21:52:48,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 21:52:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 21:52:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 21:52:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 21:52:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-18 21:52:48,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1926400201] [2020-08-18 21:52:48,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:48,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 21:52:48,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836248003] [2020-08-18 21:52:48,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 21:52:48,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:48,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 21:52:48,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-18 21:52:48,856 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-18 21:52:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:49,126 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-18 21:52:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-18 21:52:49,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-18 21:52:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:49,133 INFO L225 Difference]: With dead ends: 410 [2020-08-18 21:52:49,133 INFO L226 Difference]: Without dead ends: 406 [2020-08-18 21:52:49,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-18 21:52:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-18 21:52:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-18 21:52:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-18 21:52:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-18 21:52:49,200 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-18 21:52:49,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:49,201 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-18 21:52:49,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 21:52:49,201 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-18 21:52:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-18 21:52:49,213 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:49,213 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:49,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 21:52:49,214 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-18 21:52:49,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:49,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2057127401] [2020-08-18 21:52:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 21:52:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 21:52:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:49,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 21:52:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 21:52:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 21:52:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 21:52:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 21:52:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 21:52:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 21:52:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 21:52:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 21:52:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 21:52:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 21:52:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:50,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 21:52:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 21:52:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-18 21:52:51,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2057127401] [2020-08-18 21:52:51,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 21:52:51,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-18 21:52:51,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426458059] [2020-08-18 21:52:51,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-18 21:52:51,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 21:52:51,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-18 21:52:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-18 21:52:51,569 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-18 21:52:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 21:52:52,456 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-18 21:52:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-18 21:52:52,456 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-18 21:52:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 21:52:52,462 INFO L225 Difference]: With dead ends: 531 [2020-08-18 21:52:52,462 INFO L226 Difference]: Without dead ends: 148 [2020-08-18 21:52:52,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-18 21:52:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-18 21:52:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-18 21:52:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-18 21:52:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-18 21:52:52,479 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-18 21:52:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 21:52:52,480 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-18 21:52:52,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-18 21:52:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-18 21:52:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-18 21:52:52,488 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 21:52:52,488 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 21:52:52,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 21:52:52,489 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 21:52:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 21:52:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-18 21:52:52,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 21:52:52,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [186701631] [2020-08-18 21:52:52,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 21:52:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 21:52:52,601 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 21:52:52,601 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 21:52:52,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 21:52:52,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 09:52:52 BoogieIcfgContainer [2020-08-18 21:52:52,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 21:52:52,693 INFO L168 Benchmark]: Toolchain (without parser) took 9940.93 ms. Allocated memory was 140.5 MB in the beginning and 503.8 MB in the end (delta: 363.3 MB). Free memory was 102.5 MB in the beginning and 166.7 MB in the end (delta: -64.2 MB). Peak memory consumption was 299.1 MB. Max. memory is 7.1 GB. [2020-08-18 21:52:52,696 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-08-18 21:52:52,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.77 ms. Allocated memory is still 140.5 MB. Free memory was 102.3 MB in the beginning and 93.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-08-18 21:52:52,698 INFO L168 Benchmark]: Boogie Preprocessor took 105.88 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 93.0 MB in the beginning and 181.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2020-08-18 21:52:52,698 INFO L168 Benchmark]: RCFGBuilder took 367.46 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 169.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2020-08-18 21:52:52,704 INFO L168 Benchmark]: TraceAbstraction took 9186.13 ms. Allocated memory was 202.4 MB in the beginning and 503.8 MB in the end (delta: 301.5 MB). Free memory was 168.5 MB in the beginning and 166.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 303.3 MB. Max. memory is 7.1 GB. [2020-08-18 21:52:52,707 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.19 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 276.77 ms. Allocated memory is still 140.5 MB. Free memory was 102.3 MB in the beginning and 93.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.88 ms. Allocated memory was 140.5 MB in the beginning and 202.4 MB in the end (delta: 61.9 MB). Free memory was 93.0 MB in the beginning and 181.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 367.46 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 169.1 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9186.13 ms. Allocated memory was 202.4 MB in the beginning and 503.8 MB in the end (delta: 301.5 MB). Free memory was 168.5 MB in the beginning and 166.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 303.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.0s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1339 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 657826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 19463/24904 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...