/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=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.6 -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-19 01:06:50,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 01:06:50,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 01:06:50,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 01:06:50,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 01:06:50,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 01:06:50,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 01:06:50,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 01:06:50,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 01:06:50,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 01:06:50,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 01:06:50,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 01:06:50,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 01:06:50,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 01:06:50,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 01:06:50,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 01:06:50,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 01:06:50,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 01:06:50,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 01:06:50,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 01:06:50,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 01:06:50,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 01:06:50,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 01:06:50,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 01:06:50,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 01:06:50,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 01:06:50,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 01:06:50,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 01:06:50,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 01:06:50,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 01:06:50,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 01:06:50,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 01:06:50,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 01:06:50,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 01:06:50,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 01:06:50,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 01:06:50,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 01:06:50,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 01:06:50,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 01:06:50,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 01:06:50,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 01:06:50,948 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-19 01:06:50,970 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 01:06:50,971 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 01:06:50,972 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 01:06:50,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 01:06:50,972 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 01:06:50,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 01:06:50,973 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 01:06:50,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 01:06:50,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 01:06:50,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 01:06:50,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 01:06:50,974 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 01:06:50,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 01:06:50,974 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 01:06:50,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 01:06:50,974 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 01:06:50,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 01:06:50,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 01:06:50,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 01:06:50,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 01:06:50,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 01:06:50,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 01:06:50,976 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 01:06:50,976 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 01:06:50,976 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 01:06:50,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 01:06:50,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 01:06:50,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 01:06:50,977 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 01:06:50,977 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=WIDESTAMONGSMALL;tolerance=0.6; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6; [2020-08-19 01:06:51,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 01:06:51,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 01:06:51,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 01:06:51,326 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 01:06:51,327 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 01:06:51,327 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-19 01:06:51,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9eae6d40/de057fac7556426087e17db01ccfafdf/FLAGb24528967 [2020-08-19 01:06:51,916 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 01:06:51,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-08-19 01:06:51,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9eae6d40/de057fac7556426087e17db01ccfafdf/FLAGb24528967 [2020-08-19 01:06:52,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9eae6d40/de057fac7556426087e17db01ccfafdf [2020-08-19 01:06:52,414 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 01:06:52,416 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 01:06:52,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 01:06:52,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 01:06:52,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 01:06:52,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 01:06:52" (1/1) ... [2020-08-19 01:06:52,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b5b388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52, skipping insertion in model container [2020-08-19 01:06:52,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 01:06:52" (1/1) ... [2020-08-19 01:06:52,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 01:06:52,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 01:06:52,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 01:06:52,706 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 01:06:52,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 01:06:52,734 INFO L208 MainTranslator]: Completed translation [2020-08-19 01:06:52,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52 WrapperNode [2020-08-19 01:06:52,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 01:06:52,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 01:06:52,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 01:06:52,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 01:06:52,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52" (1/1) ... [2020-08-19 01:06:52,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52" (1/1) ... [2020-08-19 01:06:52,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52" (1/1) ... [2020-08-19 01:06:52,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52" (1/1) ... [2020-08-19 01:06:52,839 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52" (1/1) ... [2020-08-19 01:06:52,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52" (1/1) ... [2020-08-19 01:06:52,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52" (1/1) ... [2020-08-19 01:06:52,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 01:06:52,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 01:06:52,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 01:06:52,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 01:06:52,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 01:06:52,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 01:06:52,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 01:06:52,916 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-08-19 01:06:52,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 01:06:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 01:06:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 01:06:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-08-19 01:06:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 01:06:52,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 01:06:52,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 01:06:53,128 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 01:06:53,128 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 01:06:53,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 01:06:53 BoogieIcfgContainer [2020-08-19 01:06:53,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 01:06:53,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 01:06:53,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 01:06:53,139 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 01:06:53,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 01:06:52" (1/3) ... [2020-08-19 01:06:53,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1726b90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 01:06:53, skipping insertion in model container [2020-08-19 01:06:53,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:52" (2/3) ... [2020-08-19 01:06:53,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1726b90b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 01:06:53, skipping insertion in model container [2020-08-19 01:06:53,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 01:06:53" (3/3) ... [2020-08-19 01:06:53,151 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-08-19 01:06:53,197 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 01:06:53,210 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 01:06:53,241 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 01:06:53,288 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 01:06:53,288 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 01:06:53,290 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 01:06:53,290 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 01:06:53,290 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 01:06:53,290 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 01:06:53,290 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 01:06:53,290 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 01:06:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-08-19 01:06:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 01:06:53,313 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:53,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:06:53,315 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-08-19 01:06:53,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:53,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1898000520] [2020-08-19 01:06:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:53,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:53,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:53,547 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-19 01:06:53,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1898000520] [2020-08-19 01:06:53,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 01:06:53,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 01:06:53,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200991794] [2020-08-19 01:06:53,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 01:06:53,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:53,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 01:06:53,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 01:06:53,570 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-08-19 01:06:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:53,676 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-19 01:06:53,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 01:06:53,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 01:06:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:53,690 INFO L225 Difference]: With dead ends: 35 [2020-08-19 01:06:53,691 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 01:06:53,694 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-19 01:06:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 01:06:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 01:06:53,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 01:06:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 01:06:53,748 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-19 01:06:53,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:53,749 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 01:06:53,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 01:06:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 01:06:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 01:06:53,751 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:53,751 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:06:53,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 01:06:53,752 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:53,752 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-08-19 01:06:53,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:53,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [745757542] [2020-08-19 01:06:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:53,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:53,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 01:06:53,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [745757542] [2020-08-19 01:06:53,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 01:06:53,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 01:06:53,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615734026] [2020-08-19 01:06:53,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 01:06:53,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 01:06:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 01:06:53,829 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-19 01:06:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:53,889 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-19 01:06:53,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 01:06:53,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 01:06:53,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:53,892 INFO L225 Difference]: With dead ends: 27 [2020-08-19 01:06:53,892 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 01:06:53,893 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-19 01:06:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 01:06:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-19 01:06:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 01:06:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 01:06:53,902 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-19 01:06:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:53,902 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 01:06:53,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 01:06:53,902 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 01:06:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 01:06:53,904 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:53,904 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-19 01:06:53,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 01:06:53,905 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-08-19 01:06:53,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:53,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [860365997] [2020-08-19 01:06:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:53,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:53,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 01:06:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,049 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-19 01:06:54,050 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [860365997] [2020-08-19 01:06:54,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:54,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 01:06:54,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633927996] [2020-08-19 01:06:54,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 01:06:54,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 01:06:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 01:06:54,053 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 7 states. [2020-08-19 01:06:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:54,154 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-19 01:06:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 01:06:54,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-19 01:06:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:54,156 INFO L225 Difference]: With dead ends: 38 [2020-08-19 01:06:54,156 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 01:06:54,158 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-19 01:06:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 01:06:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-19 01:06:54,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-19 01:06:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-19 01:06:54,166 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-19 01:06:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:54,167 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-19 01:06:54,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 01:06:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-19 01:06:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 01:06:54,169 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:54,169 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-19 01:06:54,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 01:06:54,170 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-08-19 01:06:54,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:54,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1994772489] [2020-08-19 01:06:54,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,297 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-19 01:06:54,297 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1994772489] [2020-08-19 01:06:54,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:54,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 01:06:54,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646318080] [2020-08-19 01:06:54,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 01:06:54,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:54,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 01:06:54,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 01:06:54,300 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-19 01:06:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:54,418 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-19 01:06:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 01:06:54,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 01:06:54,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:54,423 INFO L225 Difference]: With dead ends: 41 [2020-08-19 01:06:54,423 INFO L226 Difference]: Without dead ends: 37 [2020-08-19 01:06:54,424 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-19 01:06:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-19 01:06:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-19 01:06:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-19 01:06:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-19 01:06:54,455 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-19 01:06:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:54,455 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-19 01:06:54,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 01:06:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-19 01:06:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 01:06:54,462 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:54,462 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-19 01:06:54,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 01:06:54,463 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:54,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:54,464 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-08-19 01:06:54,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:54,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [655223712] [2020-08-19 01:06:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,666 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-19 01:06:54,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [655223712] [2020-08-19 01:06:54,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:54,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 01:06:54,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144535721] [2020-08-19 01:06:54,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 01:06:54,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 01:06:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-19 01:06:54,669 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 8 states. [2020-08-19 01:06:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:54,814 INFO L93 Difference]: Finished difference Result 79 states and 124 transitions. [2020-08-19 01:06:54,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 01:06:54,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-19 01:06:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:54,817 INFO L225 Difference]: With dead ends: 79 [2020-08-19 01:06:54,818 INFO L226 Difference]: Without dead ends: 48 [2020-08-19 01:06:54,819 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-19 01:06:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-19 01:06:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-08-19 01:06:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-19 01:06:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2020-08-19 01:06:54,832 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 40 [2020-08-19 01:06:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:54,833 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2020-08-19 01:06:54,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 01:06:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2020-08-19 01:06:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 01:06:54,835 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:54,835 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-19 01:06:54,835 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 01:06:54,835 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1111873851, now seen corresponding path program 3 times [2020-08-19 01:06:54,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:54,837 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484239099] [2020-08-19 01:06:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:54,949 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-19 01:06:54,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484239099] [2020-08-19 01:06:54,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:54,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 01:06:54,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805960896] [2020-08-19 01:06:54,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 01:06:54,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:54,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 01:06:54,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 01:06:54,952 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand 7 states. [2020-08-19 01:06:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:55,078 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2020-08-19 01:06:55,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 01:06:55,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-19 01:06:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:55,081 INFO L225 Difference]: With dead ends: 65 [2020-08-19 01:06:55,082 INFO L226 Difference]: Without dead ends: 61 [2020-08-19 01:06:55,083 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-19 01:06:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-08-19 01:06:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2020-08-19 01:06:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-08-19 01:06:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2020-08-19 01:06:55,097 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 41 [2020-08-19 01:06:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:55,098 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2020-08-19 01:06:55,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 01:06:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2020-08-19 01:06:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-19 01:06:55,101 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:55,102 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-19 01:06:55,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 01:06:55,102 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1986920854, now seen corresponding path program 4 times [2020-08-19 01:06:55,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:55,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [861689843] [2020-08-19 01:06:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,446 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-19 01:06:55,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [861689843] [2020-08-19 01:06:55,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:55,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 01:06:55,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973179590] [2020-08-19 01:06:55,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 01:06:55,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:55,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 01:06:55,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-08-19 01:06:55,449 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand 11 states. [2020-08-19 01:06:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:55,867 INFO L93 Difference]: Finished difference Result 107 states and 178 transitions. [2020-08-19 01:06:55,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-19 01:06:55,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 82 [2020-08-19 01:06:55,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:55,871 INFO L225 Difference]: With dead ends: 107 [2020-08-19 01:06:55,871 INFO L226 Difference]: Without dead ends: 57 [2020-08-19 01:06:55,873 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-19 01:06:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-19 01:06:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-19 01:06:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-19 01:06:55,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2020-08-19 01:06:55,886 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 82 [2020-08-19 01:06:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:55,886 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2020-08-19 01:06:55,886 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 01:06:55,887 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2020-08-19 01:06:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-19 01:06:55,890 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:55,891 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-19 01:06:55,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 01:06:55,891 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:55,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1040445716, now seen corresponding path program 5 times [2020-08-19 01:06:55,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:55,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275354539] [2020-08-19 01:06:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:55,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,280 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-19 01:06:56,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275354539] [2020-08-19 01:06:56,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:56,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-19 01:06:56,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284402762] [2020-08-19 01:06:56,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-19 01:06:56,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-19 01:06:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-08-19 01:06:56,284 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand 13 states. [2020-08-19 01:06:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:56,796 INFO L93 Difference]: Finished difference Result 115 states and 189 transitions. [2020-08-19 01:06:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-08-19 01:06:56,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 136 [2020-08-19 01:06:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:56,802 INFO L225 Difference]: With dead ends: 115 [2020-08-19 01:06:56,802 INFO L226 Difference]: Without dead ends: 74 [2020-08-19 01:06:56,804 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-19 01:06:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-08-19 01:06:56,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2020-08-19 01:06:56,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-19 01:06:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 92 transitions. [2020-08-19 01:06:56,829 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 92 transitions. Word has length 136 [2020-08-19 01:06:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:56,830 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 92 transitions. [2020-08-19 01:06:56,830 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-19 01:06:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 92 transitions. [2020-08-19 01:06:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 01:06:56,841 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:56,842 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-19 01:06:56,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 01:06:56,842 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 259499213, now seen corresponding path program 6 times [2020-08-19 01:06:56,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:56,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1471394714] [2020-08-19 01:06:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:56,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:06:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,294 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-19 01:06:57,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1471394714] [2020-08-19 01:06:57,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:57,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 01:06:57,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574253387] [2020-08-19 01:06:57,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 01:06:57,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 01:06:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 01:06:57,297 INFO L87 Difference]: Start difference. First operand 70 states and 92 transitions. Second operand 10 states. [2020-08-19 01:06:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:57,526 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2020-08-19 01:06:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 01:06:57,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-19 01:06:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:57,531 INFO L225 Difference]: With dead ends: 186 [2020-08-19 01:06:57,531 INFO L226 Difference]: Without dead ends: 182 [2020-08-19 01:06:57,532 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-19 01:06:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-08-19 01:06:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2020-08-19 01:06:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-08-19 01:06:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 250 transitions. [2020-08-19 01:06:57,562 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 250 transitions. Word has length 177 [2020-08-19 01:06:57,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:57,566 INFO L479 AbstractCegarLoop]: Abstraction has 170 states and 250 transitions. [2020-08-19 01:06:57,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 01:06:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 250 transitions. [2020-08-19 01:06:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2020-08-19 01:06:57,574 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:57,574 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-19 01:06:57,575 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 01:06:57,575 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:57,575 INFO L82 PathProgramCache]: Analyzing trace with hash -530192014, now seen corresponding path program 7 times [2020-08-19 01:06:57,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:57,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [476382593] [2020-08-19 01:06:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:57,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:06:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 01:06:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:06:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:58,682 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-19 01:06:58,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [476382593] [2020-08-19 01:06:58,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:58,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-19 01:06:58,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268057766] [2020-08-19 01:06:58,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-19 01:06:58,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:58,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-19 01:06:58,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2020-08-19 01:06:58,687 INFO L87 Difference]: Start difference. First operand 170 states and 250 transitions. Second operand 17 states. [2020-08-19 01:06:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:59,687 INFO L93 Difference]: Finished difference Result 281 states and 495 transitions. [2020-08-19 01:06:59,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-08-19 01:06:59,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 327 [2020-08-19 01:06:59,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:59,691 INFO L225 Difference]: With dead ends: 281 [2020-08-19 01:06:59,692 INFO L226 Difference]: Without dead ends: 125 [2020-08-19 01:06:59,694 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-19 01:06:59,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-08-19 01:06:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2020-08-19 01:06:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-19 01:06:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2020-08-19 01:06:59,710 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 327 [2020-08-19 01:06:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:59,711 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2020-08-19 01:06:59,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-19 01:06:59,711 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2020-08-19 01:06:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2020-08-19 01:06:59,725 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:59,725 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-19 01:06:59,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 01:06:59,726 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1569959394, now seen corresponding path program 8 times [2020-08-19 01:06:59,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:59,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100028651] [2020-08-19 01:06:59,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:59,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:59,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:07:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:07:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:07:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 01:07:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:07:00,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:00,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-19 01:07:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:07:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:07:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 01:07:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2020-08-19 01:07:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:01,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:02,412 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-19 01:07:02,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100028651] [2020-08-19 01:07:02,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:07:02,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-08-19 01:07:02,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285439019] [2020-08-19 01:07:02,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-19 01:07:02,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:07:02,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-19 01:07:02,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-08-19 01:07:02,416 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand 19 states. [2020-08-19 01:07:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:07:03,474 INFO L93 Difference]: Finished difference Result 226 states and 393 transitions. [2020-08-19 01:07:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-08-19 01:07:03,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 599 [2020-08-19 01:07:03,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:07:03,482 INFO L225 Difference]: With dead ends: 226 [2020-08-19 01:07:03,482 INFO L226 Difference]: Without dead ends: 136 [2020-08-19 01:07:03,484 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=442, Invalid=1814, Unknown=0, NotChecked=0, Total=2256 [2020-08-19 01:07:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-08-19 01:07:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 121. [2020-08-19 01:07:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-08-19 01:07:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2020-08-19 01:07:03,503 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 599 [2020-08-19 01:07:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:07:03,505 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2020-08-19 01:07:03,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-19 01:07:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2020-08-19 01:07:03,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2020-08-19 01:07:03,527 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:07:03,528 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-19 01:07:03,528 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 01:07:03,528 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:07:03,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:07:03,529 INFO L82 PathProgramCache]: Analyzing trace with hash -127293739, now seen corresponding path program 9 times [2020-08-19 01:07:03,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:07:03,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [141064802] [2020-08-19 01:07:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:07:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:03,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:07:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:03,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:07:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:07:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:07:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 01:07:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:07:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:04,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-19 01:07:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:07:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:07:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-08-19 01:07:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:07:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:07:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 01:07:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:07:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:07:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:07:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:07:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:05,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:07:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:07:06,185 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-19 01:07:06,185 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [141064802] [2020-08-19 01:07:06,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:07:06,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-19 01:07:06,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305259355] [2020-08-19 01:07:06,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-19 01:07:06,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:07:06,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-19 01:07:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-19 01:07:06,188 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand 13 states. [2020-08-19 01:07:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:07:06,553 INFO L93 Difference]: Finished difference Result 486 states and 772 transitions. [2020-08-19 01:07:06,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-19 01:07:06,554 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 749 [2020-08-19 01:07:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:07:06,568 INFO L225 Difference]: With dead ends: 486 [2020-08-19 01:07:06,569 INFO L226 Difference]: Without dead ends: 482 [2020-08-19 01:07:06,570 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-19 01:07:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-08-19 01:07:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 461. [2020-08-19 01:07:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2020-08-19 01:07:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 725 transitions. [2020-08-19 01:07:06,649 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 725 transitions. Word has length 749 [2020-08-19 01:07:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:07:06,650 INFO L479 AbstractCegarLoop]: Abstraction has 461 states and 725 transitions. [2020-08-19 01:07:06,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-19 01:07:06,651 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 725 transitions. [2020-08-19 01:07:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-08-19 01:07:06,666 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:07:06,667 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-19 01:07:06,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 01:07:06,668 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:07:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:07:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-08-19 01:07:06,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:07:06,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [92759164] [2020-08-19 01:07:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:07:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 01:07:07,245 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 01:07:07,245 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 01:07:07,259 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 01:07:07,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 01:07:07 BoogieIcfgContainer [2020-08-19 01:07:07,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 01:07:07,417 INFO L168 Benchmark]: Toolchain (without parser) took 14994.20 ms. Allocated memory was 136.3 MB in the beginning and 967.8 MB in the end (delta: 831.5 MB). Free memory was 99.7 MB in the beginning and 711.0 MB in the end (delta: -611.2 MB). Peak memory consumption was 730.2 MB. Max. memory is 7.1 GB. [2020-08-19 01:07:07,418 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 136.3 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-19 01:07:07,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.79 ms. Allocated memory is still 136.3 MB. Free memory was 99.5 MB in the beginning and 89.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-08-19 01:07:07,420 INFO L168 Benchmark]: Boogie Preprocessor took 108.98 ms. Allocated memory was 136.3 MB in the beginning and 197.7 MB in the end (delta: 61.3 MB). Free memory was 89.1 MB in the beginning and 176.6 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-08-19 01:07:07,421 INFO L168 Benchmark]: RCFGBuilder took 288.57 ms. Allocated memory is still 197.7 MB. Free memory was 176.6 MB in the beginning and 164.4 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-08-19 01:07:07,431 INFO L168 Benchmark]: TraceAbstraction took 14272.65 ms. Allocated memory was 197.7 MB in the beginning and 967.8 MB in the end (delta: 770.2 MB). Free memory was 164.4 MB in the beginning and 711.0 MB in the end (delta: -546.5 MB). Peak memory consumption was 733.5 MB. Max. memory is 7.1 GB. [2020-08-19 01:07:07,437 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.23 ms. Allocated memory is still 136.3 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 314.79 ms. Allocated memory is still 136.3 MB. Free memory was 99.5 MB in the beginning and 89.1 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.98 ms. Allocated memory was 136.3 MB in the beginning and 197.7 MB in the end (delta: 61.3 MB). Free memory was 89.1 MB in the beginning and 176.6 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 288.57 ms. Allocated memory is still 197.7 MB. Free memory was 176.6 MB in the beginning and 164.4 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14272.65 ms. Allocated memory was 197.7 MB in the beginning and 967.8 MB in the end (delta: 770.2 MB). Free memory was 164.4 MB in the beginning and 711.0 MB in the end (delta: -546.5 MB). Peak memory consumption was 733.5 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: 13.9s, OverallIterations: 13, TraceHistogramMax: 177, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 271 SDtfs, 753 SDslu, 879 SDs, 0 SdLazy, 1810 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 87 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.4s 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...