/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=5000 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=1.0 --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-177f698 [2020-08-22 02:11:37,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 02:11:37,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 02:11:37,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 02:11:37,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 02:11:37,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 02:11:37,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 02:11:37,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 02:11:37,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 02:11:37,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 02:11:37,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 02:11:37,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 02:11:37,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 02:11:37,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 02:11:37,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 02:11:37,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 02:11:37,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 02:11:37,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 02:11:37,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 02:11:37,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 02:11:37,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 02:11:37,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 02:11:37,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 02:11:37,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 02:11:37,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 02:11:37,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 02:11:37,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 02:11:37,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 02:11:37,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 02:11:37,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 02:11:37,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 02:11:37,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 02:11:37,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 02:11:37,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 02:11:37,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 02:11:37,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 02:11:37,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 02:11:37,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 02:11:37,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 02:11:37,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 02:11:37,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 02:11:37,219 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-22 02:11:37,241 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 02:11:37,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 02:11:37,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 02:11:37,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 02:11:37,243 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 02:11:37,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 02:11:37,243 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 02:11:37,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 02:11:37,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 02:11:37,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 02:11:37,244 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 02:11:37,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 02:11:37,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 02:11:37,245 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 02:11:37,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 02:11:37,245 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 02:11:37,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 02:11:37,245 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 02:11:37,245 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 02:11:37,246 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 02:11:37,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 02:11:37,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 02:11:37,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 02:11:37,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 02:11:37,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 02:11:37,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 02:11:37,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 02:11:37,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 02:11:37,248 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 02:11:37,248 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=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5000;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=1.0;log-additional-information=true; [2020-08-22 02:11:37,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 02:11:37,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 02:11:37,559 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 02:11:37,564 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 02:11:37,564 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 02:11:37,565 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 02:11:37,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7534c5534/68d4d64ee495434da7fd6392552439b1/FLAG854c2086d [2020-08-22 02:11:38,097 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 02:11:38,098 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 02:11:38,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7534c5534/68d4d64ee495434da7fd6392552439b1/FLAG854c2086d [2020-08-22 02:11:38,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7534c5534/68d4d64ee495434da7fd6392552439b1 [2020-08-22 02:11:38,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 02:11:38,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 02:11:38,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 02:11:38,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 02:11:38,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 02:11:38,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 02:11:38" (1/1) ... [2020-08-22 02:11:38,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d96e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38, skipping insertion in model container [2020-08-22 02:11:38,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 02:11:38" (1/1) ... [2020-08-22 02:11:38,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 02:11:38,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 02:11:38,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 02:11:38,780 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 02:11:38,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 02:11:38,805 INFO L208 MainTranslator]: Completed translation [2020-08-22 02:11:38,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38 WrapperNode [2020-08-22 02:11:38,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 02:11:38,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 02:11:38,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 02:11:38,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 02:11:38,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38" (1/1) ... [2020-08-22 02:11:38,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38" (1/1) ... [2020-08-22 02:11:38,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38" (1/1) ... [2020-08-22 02:11:38,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38" (1/1) ... [2020-08-22 02:11:38,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38" (1/1) ... [2020-08-22 02:11:38,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38" (1/1) ... [2020-08-22 02:11:38,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38" (1/1) ... [2020-08-22 02:11:38,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 02:11:38,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 02:11:38,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 02:11:38,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 02:11:38,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38" (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-22 02:11:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 02:11:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 02:11:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-22 02:11:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 02:11:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 02:11:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 02:11:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-22 02:11:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 02:11:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 02:11:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 02:11:39,134 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 02:11:39,135 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 02:11:39,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 02:11:39 BoogieIcfgContainer [2020-08-22 02:11:39,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 02:11:39,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 02:11:39,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 02:11:39,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 02:11:39,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 02:11:38" (1/3) ... [2020-08-22 02:11:39,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b55d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 02:11:39, skipping insertion in model container [2020-08-22 02:11:39,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 02:11:38" (2/3) ... [2020-08-22 02:11:39,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b55d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 02:11:39, skipping insertion in model container [2020-08-22 02:11:39,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 02:11:39" (3/3) ... [2020-08-22 02:11:39,151 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-22 02:11:39,162 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 02:11:39,170 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 02:11:39,185 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 02:11:39,215 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 02:11:39,215 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 02:11:39,215 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 02:11:39,216 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 02:11:39,216 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 02:11:39,216 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 02:11:39,216 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 02:11:39,216 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 02:11:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-22 02:11:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 02:11:39,257 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:39,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:11:39,259 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:39,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-22 02:11:39,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:39,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114389290] [2020-08-22 02:11:39,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:39,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:39,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:39,507 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-22 02:11:39,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114389290] [2020-08-22 02:11:39,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 02:11:39,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 02:11:39,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682818148] [2020-08-22 02:11:39,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 02:11:39,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:39,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 02:11:39,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 02:11:39,533 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-22 02:11:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:39,660 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-22 02:11:39,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 02:11:39,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 02:11:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:39,673 INFO L225 Difference]: With dead ends: 35 [2020-08-22 02:11:39,674 INFO L226 Difference]: Without dead ends: 21 [2020-08-22 02:11:39,678 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-22 02:11:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-22 02:11:39,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-22 02:11:39,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 02:11:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 02:11:39,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-22 02:11:39,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:39,728 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 02:11:39,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 02:11:39,728 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 02:11:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 02:11:39,730 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:39,730 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:11:39,731 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 02:11:39,731 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-22 02:11:39,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:39,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719953467] [2020-08-22 02:11:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:39,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:39,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:39,805 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-22 02:11:39,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719953467] [2020-08-22 02:11:39,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 02:11:39,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 02:11:39,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218084888] [2020-08-22 02:11:39,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 02:11:39,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:39,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 02:11:39,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 02:11:39,810 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-22 02:11:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:39,881 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-22 02:11:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 02:11:39,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 02:11:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:39,884 INFO L225 Difference]: With dead ends: 27 [2020-08-22 02:11:39,884 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 02:11:39,885 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-22 02:11:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 02:11:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-22 02:11:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 02:11:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 02:11:39,892 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-22 02:11:39,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:39,893 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 02:11:39,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 02:11:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 02:11:39,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 02:11:39,895 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:39,895 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-22 02:11:39,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 02:11:39,896 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:39,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-22 02:11:39,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:39,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [132731423] [2020-08-22 02:11:39,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:39,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:39,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:39,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 02:11:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,017 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-22 02:11:40,017 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [132731423] [2020-08-22 02:11:40,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:40,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 02:11:40,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606605283] [2020-08-22 02:11:40,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 02:11:40,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:40,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 02:11:40,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 02:11:40,020 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-22 02:11:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:40,111 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-22 02:11:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 02:11:40,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-22 02:11:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:40,113 INFO L225 Difference]: With dead ends: 38 [2020-08-22 02:11:40,113 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 02:11:40,114 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-08-22 02:11:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 02:11:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-22 02:11:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-22 02:11:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-22 02:11:40,122 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-22 02:11:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:40,123 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-22 02:11:40,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 02:11:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-22 02:11:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 02:11:40,124 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:40,125 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-22 02:11:40,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 02:11:40,125 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-22 02:11:40,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:40,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316423424] [2020-08-22 02:11:40,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,260 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-22 02:11:40,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [316423424] [2020-08-22 02:11:40,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:40,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 02:11:40,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358862270] [2020-08-22 02:11:40,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 02:11:40,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:40,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 02:11:40,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 02:11:40,265 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-22 02:11:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:40,410 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-22 02:11:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 02:11:40,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-22 02:11:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:40,416 INFO L225 Difference]: With dead ends: 41 [2020-08-22 02:11:40,416 INFO L226 Difference]: Without dead ends: 37 [2020-08-22 02:11:40,417 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-22 02:11:40,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-22 02:11:40,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-22 02:11:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 02:11:40,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-22 02:11:40,437 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-22 02:11:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:40,438 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-22 02:11:40,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 02:11:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-22 02:11:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 02:11:40,444 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:40,444 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-22 02:11:40,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 02:11:40,445 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:40,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:40,445 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-22 02:11:40,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:40,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345137816] [2020-08-22 02:11:40,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,609 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-22 02:11:40,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345137816] [2020-08-22 02:11:40,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:40,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 02:11:40,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535292559] [2020-08-22 02:11:40,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 02:11:40,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:40,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 02:11:40,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 02:11:40,612 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-22 02:11:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:40,728 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-22 02:11:40,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 02:11:40,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-22 02:11:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:40,731 INFO L225 Difference]: With dead ends: 76 [2020-08-22 02:11:40,731 INFO L226 Difference]: Without dead ends: 45 [2020-08-22 02:11:40,733 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 02:11:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-22 02:11:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-22 02:11:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-22 02:11:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-22 02:11:40,745 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-22 02:11:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:40,745 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-22 02:11:40,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 02:11:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-22 02:11:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-22 02:11:40,747 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:40,748 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-22 02:11:40,748 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 02:11:40,748 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:40,749 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-22 02:11:40,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:40,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [234435183] [2020-08-22 02:11:40,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:40,906 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-22 02:11:40,907 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [234435183] [2020-08-22 02:11:40,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:40,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 02:11:40,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429822554] [2020-08-22 02:11:40,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 02:11:40,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:40,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 02:11:40,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-22 02:11:40,909 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-22 02:11:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:41,017 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-22 02:11:41,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 02:11:41,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-22 02:11:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:41,020 INFO L225 Difference]: With dead ends: 62 [2020-08-22 02:11:41,021 INFO L226 Difference]: Without dead ends: 58 [2020-08-22 02:11:41,021 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-22 02:11:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-22 02:11:41,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-22 02:11:41,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-22 02:11:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-22 02:11:41,036 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-22 02:11:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:41,037 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-22 02:11:41,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 02:11:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-22 02:11:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-22 02:11:41,041 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:41,042 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:11:41,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 02:11:41,042 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-22 02:11:41,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:41,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496400047] [2020-08-22 02:11:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-08-22 02:11:41,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496400047] [2020-08-22 02:11:41,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:41,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 02:11:41,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376976746] [2020-08-22 02:11:41,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 02:11:41,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:41,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 02:11:41,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-22 02:11:41,301 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-22 02:11:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:41,463 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-22 02:11:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 02:11:41,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-22 02:11:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:41,469 INFO L225 Difference]: With dead ends: 97 [2020-08-22 02:11:41,469 INFO L226 Difference]: Without dead ends: 93 [2020-08-22 02:11:41,470 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-22 02:11:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-22 02:11:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-22 02:11:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-22 02:11:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-22 02:11:41,490 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-22 02:11:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:41,491 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-22 02:11:41,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 02:11:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-22 02:11:41,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-22 02:11:41,496 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:41,496 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:11:41,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 02:11:41,496 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:41,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:41,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-22 02:11:41,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:41,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144375668] [2020-08-22 02:11:41,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 02:11:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 02:11:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 381 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2020-08-22 02:11:41,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144375668] [2020-08-22 02:11:41,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:41,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-22 02:11:41,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682015201] [2020-08-22 02:11:41,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 02:11:41,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 02:11:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-22 02:11:41,958 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-22 02:11:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:42,386 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-22 02:11:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 02:11:42,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-22 02:11:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:42,389 INFO L225 Difference]: With dead ends: 153 [2020-08-22 02:11:42,390 INFO L226 Difference]: Without dead ends: 71 [2020-08-22 02:11:42,397 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2020-08-22 02:11:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-22 02:11:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-22 02:11:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-22 02:11:42,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-22 02:11:42,418 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-22 02:11:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:42,420 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-22 02:11:42,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 02:11:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-22 02:11:42,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-22 02:11:42,423 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:42,424 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:11:42,424 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 02:11:42,424 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:42,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:42,424 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-22 02:11:42,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:42,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [662200786] [2020-08-22 02:11:42,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 02:11:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-22 02:11:42,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [662200786] [2020-08-22 02:11:42,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:42,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 02:11:42,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068070855] [2020-08-22 02:11:42,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 02:11:42,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:42,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 02:11:42,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-22 02:11:42,676 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-22 02:11:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:42,846 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-22 02:11:42,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 02:11:42,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-22 02:11:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:42,848 INFO L225 Difference]: With dead ends: 68 [2020-08-22 02:11:42,848 INFO L226 Difference]: Without dead ends: 64 [2020-08-22 02:11:42,849 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-22 02:11:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-22 02:11:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-22 02:11:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-22 02:11:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-22 02:11:42,858 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-22 02:11:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:42,858 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-22 02:11:42,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 02:11:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-22 02:11:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-22 02:11:42,861 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:42,862 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-22 02:11:42,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 02:11:42,862 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:42,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-22 02:11:42,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:42,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [201577305] [2020-08-22 02:11:42,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:42,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 02:11:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 02:11:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,272 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-22 02:11:43,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [201577305] [2020-08-22 02:11:43,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:43,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 02:11:43,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219364878] [2020-08-22 02:11:43,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 02:11:43,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:43,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 02:11:43,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 02:11:43,275 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-22 02:11:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:43,511 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-22 02:11:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 02:11:43,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-22 02:11:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:43,514 INFO L225 Difference]: With dead ends: 180 [2020-08-22 02:11:43,514 INFO L226 Difference]: Without dead ends: 176 [2020-08-22 02:11:43,515 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-22 02:11:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-22 02:11:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-22 02:11:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-22 02:11:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-22 02:11:43,536 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-22 02:11:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:43,537 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-22 02:11:43,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 02:11:43,537 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-22 02:11:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-22 02:11:43,542 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:43,542 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:11:43,542 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 02:11:43,542 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-22 02:11:43,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:43,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1791201631] [2020-08-22 02:11:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 02:11:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 02:11:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:43,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 02:11:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 02:11:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:44,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-08-22 02:11:44,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1791201631] [2020-08-22 02:11:44,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:44,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 02:11:44,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778674125] [2020-08-22 02:11:44,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 02:11:44,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:44,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 02:11:44,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-22 02:11:44,217 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-22 02:11:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:44,577 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-22 02:11:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 02:11:44,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-22 02:11:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:44,584 INFO L225 Difference]: With dead ends: 410 [2020-08-22 02:11:44,584 INFO L226 Difference]: Without dead ends: 406 [2020-08-22 02:11:44,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-08-22 02:11:44,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-22 02:11:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-22 02:11:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-22 02:11:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-22 02:11:44,636 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-22 02:11:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:44,637 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-22 02:11:44,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 02:11:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-22 02:11:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-22 02:11:44,649 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:44,650 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:11:44,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 02:11:44,650 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:44,650 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-22 02:11:44,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:44,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1614189715] [2020-08-22 02:11:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 02:11:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:44,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 02:11:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 02:11:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 02:11:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 02:11:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 02:11:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-22 02:11:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 02:11:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:45,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 02:11:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 02:11:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 02:11:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 02:11:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 02:11:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 02:11:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 02:11:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-08-22 02:11:46,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1614189715] [2020-08-22 02:11:46,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 02:11:46,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-22 02:11:46,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081459478] [2020-08-22 02:11:46,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-22 02:11:46,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 02:11:46,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-22 02:11:46,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-22 02:11:46,531 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-22 02:11:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 02:11:47,454 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-22 02:11:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 02:11:47,455 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-22 02:11:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 02:11:47,458 INFO L225 Difference]: With dead ends: 531 [2020-08-22 02:11:47,458 INFO L226 Difference]: Without dead ends: 148 [2020-08-22 02:11:47,462 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-22 02:11:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-22 02:11:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-22 02:11:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-22 02:11:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-22 02:11:47,474 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-22 02:11:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 02:11:47,475 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-22 02:11:47,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-22 02:11:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-22 02:11:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-22 02:11:47,482 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 02:11:47,483 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 02:11:47,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-22 02:11:47,483 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 02:11:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 02:11:47,484 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-22 02:11:47,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 02:11:47,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1053112909] [2020-08-22 02:11:47,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 02:11:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 02:11:47,580 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-22 02:11:47,580 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 02:11:47,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 02:11:47,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 02:11:47 BoogieIcfgContainer [2020-08-22 02:11:47,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 02:11:47,631 INFO L168 Benchmark]: Toolchain (without parser) took 9096.53 ms. Allocated memory was 140.5 MB in the beginning and 496.0 MB in the end (delta: 355.5 MB). Free memory was 102.6 MB in the beginning and 128.1 MB in the end (delta: -25.5 MB). Peak memory consumption was 330.0 MB. Max. memory is 7.1 GB. [2020-08-22 02:11:47,632 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-08-22 02:11:47,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.86 ms. Allocated memory is still 140.5 MB. Free memory was 102.4 MB in the beginning and 92.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-08-22 02:11:47,634 INFO L168 Benchmark]: Boogie Preprocessor took 103.21 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.6 MB in the beginning and 182.3 MB in the end (delta: -89.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2020-08-22 02:11:47,634 INFO L168 Benchmark]: RCFGBuilder took 229.42 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 170.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2020-08-22 02:11:47,635 INFO L168 Benchmark]: TraceAbstraction took 8488.32 ms. Allocated memory was 203.4 MB in the beginning and 496.0 MB in the end (delta: 292.6 MB). Free memory was 169.4 MB in the beginning and 128.1 MB in the end (delta: 41.4 MB). Peak memory consumption was 333.9 MB. Max. memory is 7.1 GB. [2020-08-22 02:11:47,638 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.17 ms. Allocated memory is still 140.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.86 ms. Allocated memory is still 140.5 MB. Free memory was 102.4 MB in the beginning and 92.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.21 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 92.6 MB in the beginning and 182.3 MB in the end (delta: -89.6 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 229.42 ms. Allocated memory is still 203.4 MB. Free memory was 181.2 MB in the beginning and 170.1 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8488.32 ms. Allocated memory was 203.4 MB in the beginning and 496.0 MB in the end (delta: 292.6 MB). Free memory was 169.4 MB in the beginning and 128.1 MB in the end (delta: 41.4 MB). Peak memory consumption was 333.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND FALSE !(n < 1) [L17] COND FALSE !(n == 1) [L20] CALL, EXPR fibonacci(n-1) [L15] COND FALSE !(n < 1) [L17] COND TRUE n == 1 [L18] return 1; [L20] RET, EXPR fibonacci(n-1) [L20] CALL, EXPR fibonacci(n-2) [L15] COND TRUE n < 1 [L16] return 0; [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) [L31] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.3s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1355 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 90 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1973 NumberOfCodeBlocks, 1973 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1498 ConstructedInterpolants, 0 QuantifiedInterpolants, 657826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 19463/24904 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...