/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=HIGHLEXORDER -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-18 19:27:47,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-18 19:27:47,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-18 19:27:47,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-18 19:27:47,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-18 19:27:47,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-18 19:27:47,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-18 19:27:47,824 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-18 19:27:47,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-18 19:27:47,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-18 19:27:47,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-18 19:27:47,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-18 19:27:47,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-18 19:27:47,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-18 19:27:47,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-18 19:27:47,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-18 19:27:47,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-18 19:27:47,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-18 19:27:47,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-18 19:27:47,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-18 19:27:47,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-18 19:27:47,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-18 19:27:47,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-18 19:27:47,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-18 19:27:47,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-18 19:27:47,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-18 19:27:47,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-18 19:27:47,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-18 19:27:47,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-18 19:27:47,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-18 19:27:47,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-18 19:27:47,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-18 19:27:47,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-18 19:27:47,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-18 19:27:47,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-18 19:27:47,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-18 19:27:47,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-18 19:27:47,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-18 19:27:47,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-18 19:27:47,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-18 19:27:47,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-18 19:27:47,853 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 19:27:47,874 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-18 19:27:47,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-18 19:27:47,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-18 19:27:47,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-18 19:27:47,876 INFO L138 SettingsManager]: * Use SBE=true [2020-08-18 19:27:47,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-18 19:27:47,877 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-18 19:27:47,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-18 19:27:47,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-18 19:27:47,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-18 19:27:47,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-18 19:27:47,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-18 19:27:47,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-18 19:27:47,878 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-18 19:27:47,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-18 19:27:47,879 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-18 19:27:47,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-18 19:27:47,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-18 19:27:47,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-18 19:27:47,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-18 19:27:47,880 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-18 19:27:47,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-18 19:27:47,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-18 19:27:47,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-18 19:27:47,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-18 19:27:47,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-18 19:27:47,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-18 19:27:47,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-18 19:27:47,881 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-18 19:27:47,881 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=HIGHLEXORDER; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=HIGHLEXORDER; [2020-08-18 19:27:48,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-18 19:27:48,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-18 19:27:48,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-18 19:27:48,202 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-18 19:27:48,203 INFO L275 PluginConnector]: CDTParser initialized [2020-08-18 19:27:48,203 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-18 19:27:48,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dec012cbe/e47a928975b54d76a41a60cbc4eb8084/FLAG61791344e [2020-08-18 19:27:48,726 INFO L306 CDTParser]: Found 1 translation units. [2020-08-18 19:27:48,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-18 19:27:48,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dec012cbe/e47a928975b54d76a41a60cbc4eb8084/FLAG61791344e [2020-08-18 19:27:49,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/dec012cbe/e47a928975b54d76a41a60cbc4eb8084 [2020-08-18 19:27:49,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-18 19:27:49,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-18 19:27:49,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-18 19:27:49,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-18 19:27:49,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-18 19:27:49,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 07:27:49" (1/1) ... [2020-08-18 19:27:49,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697b2ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49, skipping insertion in model container [2020-08-18 19:27:49,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.08 07:27:49" (1/1) ... [2020-08-18 19:27:49,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-18 19:27:49,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-18 19:27:49,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 19:27:49,304 INFO L203 MainTranslator]: Completed pre-run [2020-08-18 19:27:49,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-18 19:27:49,330 INFO L208 MainTranslator]: Completed translation [2020-08-18 19:27:49,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49 WrapperNode [2020-08-18 19:27:49,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-18 19:27:49,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-18 19:27:49,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-18 19:27:49,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-18 19:27:49,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49" (1/1) ... [2020-08-18 19:27:49,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49" (1/1) ... [2020-08-18 19:27:49,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49" (1/1) ... [2020-08-18 19:27:49,349 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49" (1/1) ... [2020-08-18 19:27:49,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49" (1/1) ... [2020-08-18 19:27:49,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49" (1/1) ... [2020-08-18 19:27:49,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49" (1/1) ... [2020-08-18 19:27:49,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-18 19:27:49,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-18 19:27:49,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-18 19:27:49,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-18 19:27:49,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49" (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 19:27:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-18 19:27:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-18 19:27:49,495 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-18 19:27:49,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-18 19:27:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-18 19:27:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-18 19:27:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-18 19:27:49,496 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-18 19:27:49,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-18 19:27:49,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-18 19:27:49,708 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-18 19:27:49,708 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-18 19:27:49,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 07:27:49 BoogieIcfgContainer [2020-08-18 19:27:49,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-18 19:27:49,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-18 19:27:49,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-18 19:27:49,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-18 19:27:49,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.08 07:27:49" (1/3) ... [2020-08-18 19:27:49,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6d15e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 07:27:49, skipping insertion in model container [2020-08-18 19:27:49,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.08 07:27:49" (2/3) ... [2020-08-18 19:27:49,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e6d15e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.08 07:27:49, skipping insertion in model container [2020-08-18 19:27:49,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.08 07:27:49" (3/3) ... [2020-08-18 19:27:49,735 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-18 19:27:49,747 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-18 19:27:49,775 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-18 19:27:49,802 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-18 19:27:49,824 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-18 19:27:49,824 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-18 19:27:49,824 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-18 19:27:49,824 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-18 19:27:49,825 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-18 19:27:49,825 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-18 19:27:49,825 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-18 19:27:49,825 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-18 19:27:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-18 19:27:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-18 19:27:49,845 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:49,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:27:49,846 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:49,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:49,851 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-18 19:27:49,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:49,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1922814781] [2020-08-18 19:27:49,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:49,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,078 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 19:27:50,078 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1922814781] [2020-08-18 19:27:50,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 19:27:50,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 19:27:50,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781893859] [2020-08-18 19:27:50,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 19:27:50,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 19:27:50,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 19:27:50,103 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-18 19:27:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:50,197 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-18 19:27:50,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 19:27:50,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-18 19:27:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:50,210 INFO L225 Difference]: With dead ends: 35 [2020-08-18 19:27:50,210 INFO L226 Difference]: Without dead ends: 21 [2020-08-18 19:27:50,213 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 19:27:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-18 19:27:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-18 19:27:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 19:27:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 19:27:50,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-18 19:27:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:50,256 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 19:27:50,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 19:27:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 19:27:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-18 19:27:50,258 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:50,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:27:50,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-18 19:27:50,259 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-18 19:27:50,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:50,261 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1593591588] [2020-08-18 19:27:50,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,320 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 19:27:50,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1593591588] [2020-08-18 19:27:50,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-18 19:27:50,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-18 19:27:50,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173485368] [2020-08-18 19:27:50,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-18 19:27:50,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:50,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-18 19:27:50,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-18 19:27:50,326 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-18 19:27:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:50,380 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-18 19:27:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-18 19:27:50,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-18 19:27:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:50,382 INFO L225 Difference]: With dead ends: 27 [2020-08-18 19:27:50,383 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 19:27:50,384 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 19:27:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 19:27:50,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-18 19:27:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-18 19:27:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-18 19:27:50,391 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-18 19:27:50,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:50,392 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-18 19:27:50,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-18 19:27:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-18 19:27:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-18 19:27:50,394 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:50,394 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 19:27:50,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-18 19:27:50,394 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-18 19:27:50,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:50,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1014935917] [2020-08-18 19:27:50,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-18 19:27:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,576 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 19:27:50,576 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1014935917] [2020-08-18 19:27:50,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:27:50,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 19:27:50,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883080063] [2020-08-18 19:27:50,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 19:27:50,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:50,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 19:27:50,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-18 19:27:50,579 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-18 19:27:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:50,669 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-18 19:27:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 19:27:50,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-18 19:27:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:50,671 INFO L225 Difference]: With dead ends: 38 [2020-08-18 19:27:50,671 INFO L226 Difference]: Without dead ends: 23 [2020-08-18 19:27:50,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-18 19:27:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-18 19:27:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-18 19:27:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-18 19:27:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-18 19:27:50,680 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-18 19:27:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:50,681 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-18 19:27:50,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 19:27:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-18 19:27:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-18 19:27:50,682 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:50,683 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 19:27:50,683 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-18 19:27:50,683 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:50,684 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-18 19:27:50,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:50,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [277797446] [2020-08-18 19:27:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,781 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 19:27:50,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [277797446] [2020-08-18 19:27:50,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:27:50,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-18 19:27:50,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483600017] [2020-08-18 19:27:50,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-18 19:27:50,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:50,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-18 19:27:50,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-18 19:27:50,784 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-18 19:27:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:50,891 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-18 19:27:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-18 19:27:50,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-18 19:27:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:50,894 INFO L225 Difference]: With dead ends: 41 [2020-08-18 19:27:50,894 INFO L226 Difference]: Without dead ends: 37 [2020-08-18 19:27:50,895 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 19:27:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-18 19:27:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-18 19:27:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-18 19:27:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-18 19:27:50,906 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-18 19:27:50,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:50,906 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-18 19:27:50,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-18 19:27:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-18 19:27:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-18 19:27:50,909 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:50,909 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 19:27:50,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-18 19:27:50,909 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:50,910 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-18 19:27:50,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:50,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705380139] [2020-08-18 19:27:50,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:50,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,071 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 19:27:51,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705380139] [2020-08-18 19:27:51,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:27:51,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-18 19:27:51,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293264981] [2020-08-18 19:27:51,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-18 19:27:51,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-18 19:27:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-18 19:27:51,073 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-18 19:27:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:51,243 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-18 19:27:51,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-18 19:27:51,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-18 19:27:51,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:51,249 INFO L225 Difference]: With dead ends: 79 [2020-08-18 19:27:51,249 INFO L226 Difference]: Without dead ends: 48 [2020-08-18 19:27:51,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-08-18 19:27:51,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-18 19:27:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-18 19:27:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-18 19:27:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-18 19:27:51,276 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-18 19:27:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:51,277 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-18 19:27:51,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-18 19:27:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-18 19:27:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-18 19:27:51,282 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:51,282 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 19:27:51,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-18 19:27:51,285 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:51,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-18 19:27:51,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:51,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1203005549] [2020-08-18 19:27:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,484 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 19:27:51,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1203005549] [2020-08-18 19:27:51,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:27:51,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-18 19:27:51,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134934526] [2020-08-18 19:27:51,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-18 19:27:51,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:51,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-18 19:27:51,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-18 19:27:51,490 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-18 19:27:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:51,621 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-18 19:27:51,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-18 19:27:51,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-18 19:27:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:51,626 INFO L225 Difference]: With dead ends: 65 [2020-08-18 19:27:51,627 INFO L226 Difference]: Without dead ends: 61 [2020-08-18 19:27:51,627 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 19:27:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-18 19:27:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-18 19:27:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-18 19:27:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-18 19:27:51,641 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-18 19:27:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:51,642 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-18 19:27:51,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-18 19:27:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-18 19:27:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-18 19:27:51,645 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:51,645 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:27:51,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-18 19:27:51,645 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-18 19:27:51,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:51,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1720913966] [2020-08-18 19:27:51,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 77 proven. 104 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-08-18 19:27:51,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1720913966] [2020-08-18 19:27:51,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:27:51,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-18 19:27:51,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363230085] [2020-08-18 19:27:51,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-18 19:27:51,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:51,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-18 19:27:51,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-18 19:27:51,901 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-18 19:27:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:52,247 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-18 19:27:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-18 19:27:52,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-18 19:27:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:52,255 INFO L225 Difference]: With dead ends: 107 [2020-08-18 19:27:52,258 INFO L226 Difference]: Without dead ends: 57 [2020-08-18 19:27:52,260 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2020-08-18 19:27:52,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-18 19:27:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-18 19:27:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-18 19:27:52,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-18 19:27:52,282 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-18 19:27:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:52,282 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-18 19:27:52,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-18 19:27:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-18 19:27:52,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-18 19:27:52,292 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:52,293 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:27:52,293 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-18 19:27:52,293 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:52,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:52,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-18 19:27:52,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:52,294 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1106406092] [2020-08-18 19:27:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:27:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 193 proven. 313 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2020-08-18 19:27:52,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1106406092] [2020-08-18 19:27:52,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:27:52,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-18 19:27:52,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024098525] [2020-08-18 19:27:52,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-18 19:27:52,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-18 19:27:52,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-18 19:27:52,802 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-18 19:27:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:53,264 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-18 19:27:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-18 19:27:53,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-18 19:27:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:53,267 INFO L225 Difference]: With dead ends: 115 [2020-08-18 19:27:53,268 INFO L226 Difference]: Without dead ends: 74 [2020-08-18 19:27:53,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2020-08-18 19:27:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-18 19:27:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-18 19:27:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-18 19:27:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-18 19:27:53,292 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-18 19:27:53,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:53,292 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-18 19:27:53,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-18 19:27:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-18 19:27:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-18 19:27:53,295 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:53,296 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 19:27:53,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-18 19:27:53,296 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:53,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:53,296 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-18 19:27:53,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:53,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [897008088] [2020-08-18 19:27:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:27:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 19:27:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:53,686 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 19:27:53,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [897008088] [2020-08-18 19:27:53,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:27:53,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-18 19:27:53,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323314662] [2020-08-18 19:27:53,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-18 19:27:53,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:53,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-18 19:27:53,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-18 19:27:53,689 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-18 19:27:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:53,875 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-18 19:27:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-18 19:27:53,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-18 19:27:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:53,880 INFO L225 Difference]: With dead ends: 186 [2020-08-18 19:27:53,880 INFO L226 Difference]: Without dead ends: 182 [2020-08-18 19:27:53,881 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-18 19:27:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-18 19:27:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-18 19:27:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-18 19:27:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-18 19:27:53,904 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-18 19:27:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:53,905 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-18 19:27:53,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-18 19:27:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-18 19:27:53,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-18 19:27:53,910 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:53,911 INFO L422 BasicCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:27:53,911 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-18 19:27:53,911 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:53,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:53,912 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-18 19:27:53,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:53,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104217367] [2020-08-18 19:27:53,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:27:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 19:27:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 19:27:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:27:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 19:27:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 1358 proven. 1342 refuted. 0 times theorem prover too weak. 3339 trivial. 0 not checked. [2020-08-18 19:27:54,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104217367] [2020-08-18 19:27:54,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:27:54,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-18 19:27:54,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683069805] [2020-08-18 19:27:54,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-18 19:27:54,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:54,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-18 19:27:54,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-18 19:27:54,850 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-18 19:27:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:55,668 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-18 19:27:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-18 19:27:55,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-18 19:27:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:55,671 INFO L225 Difference]: With dead ends: 281 [2020-08-18 19:27:55,671 INFO L226 Difference]: Without dead ends: 125 [2020-08-18 19:27:55,674 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2020-08-18 19:27:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-18 19:27:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-18 19:27:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-18 19:27:55,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-18 19:27:55,697 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-18 19:27:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:55,699 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-18 19:27:55,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-18 19:27:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-18 19:27:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-18 19:27:55,713 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:55,714 INFO L422 BasicCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:27:55,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-18 19:27:55,714 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:55,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:55,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-18 19:27:55,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:55,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1772656775] [2020-08-18 19:27:55,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:55,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:55,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:27:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 19:27:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 19:27:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:27:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 19:27:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:27:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:56,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 19:27:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 19:27:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-18 19:27:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3272 proven. 3796 refuted. 0 times theorem prover too weak. 13923 trivial. 0 not checked. [2020-08-18 19:27:57,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1772656775] [2020-08-18 19:27:57,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:27:57,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-18 19:27:57,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201897215] [2020-08-18 19:27:57,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-18 19:27:57,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:27:57,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-18 19:27:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-18 19:27:57,546 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-18 19:27:58,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:27:58,507 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-18 19:27:58,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-18 19:27:58,509 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-18 19:27:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:27:58,515 INFO L225 Difference]: With dead ends: 226 [2020-08-18 19:27:58,515 INFO L226 Difference]: Without dead ends: 136 [2020-08-18 19:27:58,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2020-08-18 19:27:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-18 19:27:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-18 19:27:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-18 19:27:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-18 19:27:58,533 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-18 19:27:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:27:58,534 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-18 19:27:58,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-18 19:27:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-18 19:27:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-18 19:27:58,559 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:27:58,559 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:27:58,559 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-18 19:27:58,560 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:27:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:27:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-18 19:27:58,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:27:58,561 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [246255281] [2020-08-18 19:27:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:27:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:58,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-18 19:27:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:58,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-18 19:27:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:27:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 19:27:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 19:27:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:27:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:27:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:27:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:27:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:27:59,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:27:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:28:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-18 19:28:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:28:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:28:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:28:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:28:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 19:28:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:28:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:28:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-18 19:28:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:28:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:28:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:28:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:28:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-18 19:28:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:28:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:28:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-18 19:28:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:28:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-18 19:28:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-18 19:28:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-18 19:28:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-18 19:28:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:00,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-18 19:28:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-18 19:28:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-08-18 19:28:01,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [246255281] [2020-08-18 19:28:01,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-18 19:28:01,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-18 19:28:01,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696991429] [2020-08-18 19:28:01,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-18 19:28:01,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-18 19:28:01,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-18 19:28:01,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-18 19:28:01,675 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-18 19:28:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-18 19:28:02,007 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-18 19:28:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-18 19:28:02,008 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-18 19:28:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-18 19:28:02,016 INFO L225 Difference]: With dead ends: 486 [2020-08-18 19:28:02,016 INFO L226 Difference]: Without dead ends: 482 [2020-08-18 19:28:02,018 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-18 19:28:02,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-18 19:28:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-18 19:28:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-18 19:28:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-18 19:28:02,058 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-18 19:28:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-18 19:28:02,059 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-18 19:28:02,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-18 19:28:02,059 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-18 19:28:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-18 19:28:02,073 INFO L414 BasicCegarLoop]: Found error trace [2020-08-18 19:28:02,074 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-18 19:28:02,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-18 19:28:02,074 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-18 19:28:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-18 19:28:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-18 19:28:02,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-18 19:28:02,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1956015256] [2020-08-18 19:28:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-18 19:28:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-18 19:28:02,675 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-18 19:28:02,675 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-18 19:28:02,686 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-18 19:28:02,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.08 07:28:02 BoogieIcfgContainer [2020-08-18 19:28:02,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-18 19:28:02,820 INFO L168 Benchmark]: Toolchain (without parser) took 13704.79 ms. Allocated memory was 140.5 MB in the beginning and 837.3 MB in the end (delta: 696.8 MB). Free memory was 103.7 MB in the beginning and 130.6 MB in the end (delta: -26.9 MB). Peak memory consumption was 669.9 MB. Max. memory is 7.1 GB. [2020-08-18 19:28:02,821 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-18 19:28:02,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.94 ms. Allocated memory is still 140.5 MB. Free memory was 103.5 MB in the beginning and 94.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-18 19:28:02,824 INFO L168 Benchmark]: Boogie Preprocessor took 23.71 ms. Allocated memory is still 140.5 MB. Free memory was 94.2 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-08-18 19:28:02,824 INFO L168 Benchmark]: RCFGBuilder took 358.47 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.9 MB in the beginning and 171.7 MB in the end (delta: -78.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-08-18 19:28:02,830 INFO L168 Benchmark]: TraceAbstraction took 13087.42 ms. Allocated memory was 203.4 MB in the beginning and 837.3 MB in the end (delta: 633.9 MB). Free memory was 171.0 MB in the beginning and 130.6 MB in the end (delta: 40.4 MB). Peak memory consumption was 674.3 MB. Max. memory is 7.1 GB. [2020-08-18 19:28:02,835 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.18 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 218.94 ms. Allocated memory is still 140.5 MB. Free memory was 103.5 MB in the beginning and 94.2 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.71 ms. Allocated memory is still 140.5 MB. Free memory was 94.2 MB in the beginning and 92.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 358.47 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.9 MB in the beginning and 171.7 MB in the end (delta: -78.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13087.42 ms. Allocated memory was 203.4 MB in the beginning and 837.3 MB in the end (delta: 633.9 MB). Free memory was 171.0 MB in the beginning and 130.6 MB in the end (delta: 40.4 MB). Peak memory consumption was 674.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; [L25] CALL, EXPR fibo(x) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1805 SolverSat, 740 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 3443 NumberOfCodeBlocks, 3443 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1448155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 52623/63131 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...