/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.6 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 01:06:37,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 01:06:37,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 01:06:37,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 01:06:37,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 01:06:37,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 01:06:37,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 01:06:37,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 01:06:37,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 01:06:37,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 01:06:37,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 01:06:37,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 01:06:37,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 01:06:37,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 01:06:37,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 01:06:37,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 01:06:37,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 01:06:37,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 01:06:37,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 01:06:37,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 01:06:37,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 01:06:37,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 01:06:37,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 01:06:37,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 01:06:37,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 01:06:37,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 01:06:37,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 01:06:37,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 01:06:37,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 01:06:37,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 01:06:37,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 01:06:37,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 01:06:37,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 01:06:37,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 01:06:37,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 01:06:37,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 01:06:37,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 01:06:37,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 01:06:37,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 01:06:37,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 01:06:37,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 01:06:37,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 01:06:37,353 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 01:06:37,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 01:06:37,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 01:06:37,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 01:06:37,355 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 01:06:37,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 01:06:37,356 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 01:06:37,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 01:06:37,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 01:06:37,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 01:06:37,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 01:06:37,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 01:06:37,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 01:06:37,357 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 01:06:37,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 01:06:37,357 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 01:06:37,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 01:06:37,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 01:06:37,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 01:06:37,358 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 01:06:37,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 01:06:37,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 01:06:37,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 01:06:37,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 01:06:37,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 01:06:37,359 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 01:06:37,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 01:06:37,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 01:06:37,360 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 01:06:37,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.6; [2020-08-19 01:06:37,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 01:06:37,705 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 01:06:37,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 01:06:37,711 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 01:06:37,712 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 01:06:37,713 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-19 01:06:37,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/93fb6b8dc/f4b0bfac7c0f4fac80a3c53fd0c65d9c/FLAGce4da0b99 [2020-08-19 01:06:38,295 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 01:06:38,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-19 01:06:38,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/93fb6b8dc/f4b0bfac7c0f4fac80a3c53fd0c65d9c/FLAGce4da0b99 [2020-08-19 01:06:38,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/93fb6b8dc/f4b0bfac7c0f4fac80a3c53fd0c65d9c [2020-08-19 01:06:38,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 01:06:38,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 01:06:38,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 01:06:38,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 01:06:38,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 01:06:38,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 01:06:38" (1/1) ... [2020-08-19 01:06:38,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c4d5a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38, skipping insertion in model container [2020-08-19 01:06:38,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 01:06:38" (1/1) ... [2020-08-19 01:06:38,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 01:06:38,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 01:06:38,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 01:06:38,921 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 01:06:38,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 01:06:38,954 INFO L208 MainTranslator]: Completed translation [2020-08-19 01:06:38,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38 WrapperNode [2020-08-19 01:06:38,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 01:06:38,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 01:06:38,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 01:06:38,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 01:06:38,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38" (1/1) ... [2020-08-19 01:06:38,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38" (1/1) ... [2020-08-19 01:06:38,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38" (1/1) ... [2020-08-19 01:06:38,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38" (1/1) ... [2020-08-19 01:06:38,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38" (1/1) ... [2020-08-19 01:06:38,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38" (1/1) ... [2020-08-19 01:06:38,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38" (1/1) ... [2020-08-19 01:06:38,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 01:06:38,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 01:06:38,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 01:06:38,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 01:06:38,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06: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-19 01:06:39,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 01:06:39,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 01:06:39,141 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-19 01:06:39,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 01:06:39,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 01:06:39,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 01:06:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-19 01:06:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 01:06:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 01:06:39,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 01:06:39,327 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 01:06:39,327 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-19 01:06:39,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 01:06:39 BoogieIcfgContainer [2020-08-19 01:06:39,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 01:06:39,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 01:06:39,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 01:06:39,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 01:06:39,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 01:06:38" (1/3) ... [2020-08-19 01:06:39,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124489e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 01:06:39, skipping insertion in model container [2020-08-19 01:06:39,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 01:06:38" (2/3) ... [2020-08-19 01:06:39,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124489e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 01:06:39, skipping insertion in model container [2020-08-19 01:06:39,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 01:06:39" (3/3) ... [2020-08-19 01:06:39,340 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-19 01:06:39,350 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 01:06:39,358 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 01:06:39,372 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 01:06:39,396 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 01:06:39,397 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 01:06:39,397 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 01:06:39,397 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 01:06:39,397 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 01:06:39,397 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 01:06:39,398 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 01:06:39,398 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 01:06:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-19 01:06:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-19 01:06:39,419 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:39,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:06:39,420 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:39,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:39,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-19 01:06:39,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:39,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1617410455] [2020-08-19 01:06:39,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:39,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:39,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 01:06:39,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1617410455] [2020-08-19 01:06:39,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 01:06:39,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 01:06:39,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715901049] [2020-08-19 01:06:39,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 01:06:39,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:39,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 01:06:39,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 01:06:39,771 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-19 01:06:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:39,902 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-19 01:06:39,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 01:06:39,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-19 01:06:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:39,915 INFO L225 Difference]: With dead ends: 35 [2020-08-19 01:06:39,915 INFO L226 Difference]: Without dead ends: 21 [2020-08-19 01:06:39,918 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 01:06:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-19 01:06:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-19 01:06:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 01:06:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 01:06:39,959 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-19 01:06:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:39,960 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 01:06:39,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 01:06:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 01:06:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-19 01:06:39,962 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:39,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:06:39,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 01:06:39,963 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:39,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:39,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-19 01:06:39,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:39,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1274679768] [2020-08-19 01:06:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:39,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:39,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 01:06:40,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1274679768] [2020-08-19 01:06:40,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 01:06:40,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-19 01:06:40,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278673771] [2020-08-19 01:06:40,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-19 01:06:40,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:40,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-19 01:06:40,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-19 01:06:40,052 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-19 01:06:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:40,127 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-19 01:06:40,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-19 01:06:40,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-19 01:06:40,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:40,130 INFO L225 Difference]: With dead ends: 27 [2020-08-19 01:06:40,130 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 01:06:40,132 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-19 01:06:40,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 01:06:40,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-19 01:06:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-19 01:06:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-19 01:06:40,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-19 01:06:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:40,141 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-19 01:06:40,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-19 01:06:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-19 01:06:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-19 01:06:40,143 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:40,143 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:06:40,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 01:06:40,144 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:40,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-19 01:06:40,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:40,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [52165331] [2020-08-19 01:06:40,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-19 01:06:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-19 01:06:40,281 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [52165331] [2020-08-19 01:06:40,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:40,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 01:06:40,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233832297] [2020-08-19 01:06:40,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 01:06:40,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:40,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 01:06:40,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 01:06:40,283 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 6 states. [2020-08-19 01:06:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:40,373 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-19 01:06:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-19 01:06:40,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-08-19 01:06:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:40,375 INFO L225 Difference]: With dead ends: 38 [2020-08-19 01:06:40,375 INFO L226 Difference]: Without dead ends: 23 [2020-08-19 01:06:40,377 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-19 01:06:40,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-19 01:06:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-19 01:06:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-19 01:06:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-19 01:06:40,385 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-19 01:06:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:40,386 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-19 01:06:40,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 01:06:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-19 01:06:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-19 01:06:40,388 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:40,388 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:06:40,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 01:06:40,389 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:40,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-19 01:06:40,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:40,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1778578507] [2020-08-19 01:06:40,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-19 01:06:40,562 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1778578507] [2020-08-19 01:06:40,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:40,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-19 01:06:40,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62543939] [2020-08-19 01:06:40,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-19 01:06:40,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:40,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-19 01:06:40,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-19 01:06:40,567 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-08-19 01:06:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:40,719 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-19 01:06:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 01:06:40,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-08-19 01:06:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:40,724 INFO L225 Difference]: With dead ends: 41 [2020-08-19 01:06:40,725 INFO L226 Difference]: Without dead ends: 37 [2020-08-19 01:06:40,725 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-19 01:06:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-19 01:06:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-19 01:06:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-19 01:06:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-19 01:06:40,737 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-19 01:06:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:40,737 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-19 01:06:40,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-19 01:06:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-19 01:06:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-19 01:06:40,740 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:40,740 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:06:40,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 01:06:40,740 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-19 01:06:40,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:40,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2065259706] [2020-08-19 01:06:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-19 01:06:40,913 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2065259706] [2020-08-19 01:06:40,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:40,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 01:06:40,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002763790] [2020-08-19 01:06:40,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 01:06:40,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:40,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 01:06:40,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-19 01:06:40,915 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 7 states. [2020-08-19 01:06:41,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:41,054 INFO L93 Difference]: Finished difference Result 76 states and 119 transitions. [2020-08-19 01:06:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-19 01:06:41,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-08-19 01:06:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:41,062 INFO L225 Difference]: With dead ends: 76 [2020-08-19 01:06:41,063 INFO L226 Difference]: Without dead ends: 45 [2020-08-19 01:06:41,064 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-19 01:06:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-19 01:06:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2020-08-19 01:06:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-19 01:06:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2020-08-19 01:06:41,092 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 40 [2020-08-19 01:06:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:41,092 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2020-08-19 01:06:41,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 01:06:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2020-08-19 01:06:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-19 01:06:41,095 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:41,097 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:06:41,097 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 01:06:41,097 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:41,099 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2020-08-19 01:06:41,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:41,100 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1014984816] [2020-08-19 01:06:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-19 01:06:41,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1014984816] [2020-08-19 01:06:41,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:41,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-19 01:06:41,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802928816] [2020-08-19 01:06:41,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 01:06:41,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 01:06:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 01:06:41,320 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 7 states. [2020-08-19 01:06:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:41,459 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2020-08-19 01:06:41,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-19 01:06:41,460 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-08-19 01:06:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:41,462 INFO L225 Difference]: With dead ends: 62 [2020-08-19 01:06:41,463 INFO L226 Difference]: Without dead ends: 58 [2020-08-19 01:06:41,464 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 01:06:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-08-19 01:06:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-08-19 01:06:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-08-19 01:06:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2020-08-19 01:06:41,479 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 41 [2020-08-19 01:06:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:41,480 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2020-08-19 01:06:41,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 01:06:41,480 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2020-08-19 01:06:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-08-19 01:06:41,484 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:41,484 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-19 01:06:41,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 01:06:41,485 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:41,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:41,485 INFO L82 PathProgramCache]: Analyzing trace with hash -987229488, now seen corresponding path program 4 times [2020-08-19 01:06:41,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:41,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517023106] [2020-08-19 01:06:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:41,885 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-19 01:06:41,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517023106] [2020-08-19 01:06:41,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:41,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-19 01:06:41,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253133158] [2020-08-19 01:06:41,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 01:06:41,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:41,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 01:06:41,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-19 01:06:41,891 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand 8 states. [2020-08-19 01:06:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:42,071 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2020-08-19 01:06:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-19 01:06:42,074 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2020-08-19 01:06:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:42,085 INFO L225 Difference]: With dead ends: 97 [2020-08-19 01:06:42,085 INFO L226 Difference]: Without dead ends: 93 [2020-08-19 01:06:42,089 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-19 01:06:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-08-19 01:06:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2020-08-19 01:06:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-08-19 01:06:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2020-08-19 01:06:42,131 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 96 [2020-08-19 01:06:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:42,132 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2020-08-19 01:06:42,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 01:06:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2020-08-19 01:06:42,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-08-19 01:06:42,139 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:42,139 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-19 01:06:42,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 01:06:42,140 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:42,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:42,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1110256604, now seen corresponding path program 5 times [2020-08-19 01:06:42,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:42,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1482929009] [2020-08-19 01:06:42,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:42,566 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-19 01:06:42,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1482929009] [2020-08-19 01:06:42,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:42,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-19 01:06:42,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209958187] [2020-08-19 01:06:42,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-19 01:06:42,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-19 01:06:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-08-19 01:06:42,569 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand 12 states. [2020-08-19 01:06:43,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:43,021 INFO L93 Difference]: Finished difference Result 153 states and 266 transitions. [2020-08-19 01:06:43,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-19 01:06:43,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 150 [2020-08-19 01:06:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:43,024 INFO L225 Difference]: With dead ends: 153 [2020-08-19 01:06:43,024 INFO L226 Difference]: Without dead ends: 71 [2020-08-19 01:06:43,027 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-19 01:06:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-08-19 01:06:43,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2020-08-19 01:06:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-08-19 01:06:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2020-08-19 01:06:43,037 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 150 [2020-08-19 01:06:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:43,038 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2020-08-19 01:06:43,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-19 01:06:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-08-19 01:06:43,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-19 01:06:43,040 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:43,041 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-19 01:06:43,041 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 01:06:43,041 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:43,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 6 times [2020-08-19 01:06:43,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:43,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1437705662] [2020-08-19 01:06:43,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,365 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-19 01:06:43,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1437705662] [2020-08-19 01:06:43,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:43,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-19 01:06:43,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197594932] [2020-08-19 01:06:43,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 01:06:43,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 01:06:43,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-19 01:06:43,373 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2020-08-19 01:06:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:43,533 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2020-08-19 01:06:43,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 01:06:43,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2020-08-19 01:06:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:43,535 INFO L225 Difference]: With dead ends: 68 [2020-08-19 01:06:43,535 INFO L226 Difference]: Without dead ends: 64 [2020-08-19 01:06:43,536 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-08-19 01:06:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-08-19 01:06:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-08-19 01:06:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-08-19 01:06:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2020-08-19 01:06:43,545 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 109 [2020-08-19 01:06:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:43,546 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2020-08-19 01:06:43,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 01:06:43,546 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2020-08-19 01:06:43,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-19 01:06:43,548 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:43,549 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 01:06:43,549 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 01:06:43,549 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:43,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 7 times [2020-08-19 01:06:43,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:43,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1180941894] [2020-08-19 01:06:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:06:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-19 01:06:43,928 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1180941894] [2020-08-19 01:06:43,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:43,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-19 01:06:43,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389507381] [2020-08-19 01:06:43,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 01:06:43,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:43,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 01:06:43,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-19 01:06:43,931 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 10 states. [2020-08-19 01:06:44,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:44,143 INFO L93 Difference]: Finished difference Result 180 states and 254 transitions. [2020-08-19 01:06:44,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-19 01:06:44,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2020-08-19 01:06:44,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:44,147 INFO L225 Difference]: With dead ends: 180 [2020-08-19 01:06:44,147 INFO L226 Difference]: Without dead ends: 176 [2020-08-19 01:06:44,148 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-08-19 01:06:44,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-08-19 01:06:44,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2020-08-19 01:06:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-08-19 01:06:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2020-08-19 01:06:44,169 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 177 [2020-08-19 01:06:44,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:44,170 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2020-08-19 01:06:44,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 01:06:44,171 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2020-08-19 01:06:44,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-08-19 01:06:44,175 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:44,176 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-19 01:06:44,176 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 01:06:44,176 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:44,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash -902141708, now seen corresponding path program 8 times [2020-08-19 01:06:44,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:44,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1194863411] [2020-08-19 01:06:44,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:06:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 01:06:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:44,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:45,042 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-19 01:06:45,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1194863411] [2020-08-19 01:06:45,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:45,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-19 01:06:45,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449848384] [2020-08-19 01:06:45,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 01:06:45,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:45,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 01:06:45,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-19 01:06:45,045 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand 11 states. [2020-08-19 01:06:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:45,330 INFO L93 Difference]: Finished difference Result 410 states and 640 transitions. [2020-08-19 01:06:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 01:06:45,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 286 [2020-08-19 01:06:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:45,338 INFO L225 Difference]: With dead ends: 410 [2020-08-19 01:06:45,338 INFO L226 Difference]: Without dead ends: 406 [2020-08-19 01:06:45,339 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-19 01:06:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2020-08-19 01:06:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 391. [2020-08-19 01:06:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2020-08-19 01:06:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 615 transitions. [2020-08-19 01:06:45,396 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 615 transitions. Word has length 286 [2020-08-19 01:06:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:45,397 INFO L479 AbstractCegarLoop]: Abstraction has 391 states and 615 transitions. [2020-08-19 01:06:45,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 01:06:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 615 transitions. [2020-08-19 01:06:45,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-08-19 01:06:45,409 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:45,409 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-19 01:06:45,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 01:06:45,410 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash 15696592, now seen corresponding path program 9 times [2020-08-19 01:06:45,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:45,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [72201183] [2020-08-19 01:06:45,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:45,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 01:06:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:45,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-19 01:06:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:45,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:06:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 01:06:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-19 01:06:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-19 01:06:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 01:06:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-19 01:06:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-19 01:06:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-19 01:06:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 01:06:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:46,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 01:06:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 01:06:47,138 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-19 01:06:47,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [72201183] [2020-08-19 01:06:47,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-19 01:06:47,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-08-19 01:06:47,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387936610] [2020-08-19 01:06:47,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-08-19 01:06:47,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 01:06:47,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-08-19 01:06:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-08-19 01:06:47,141 INFO L87 Difference]: Start difference. First operand 391 states and 615 transitions. Second operand 18 states. [2020-08-19 01:06:48,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 01:06:48,229 INFO L93 Difference]: Finished difference Result 531 states and 942 transitions. [2020-08-19 01:06:48,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-19 01:06:48,230 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 531 [2020-08-19 01:06:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 01:06:48,237 INFO L225 Difference]: With dead ends: 531 [2020-08-19 01:06:48,237 INFO L226 Difference]: Without dead ends: 148 [2020-08-19 01:06:48,241 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=423, Invalid=1647, Unknown=0, NotChecked=0, Total=2070 [2020-08-19 01:06:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-19 01:06:48,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 112. [2020-08-19 01:06:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-19 01:06:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-19 01:06:48,254 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 531 [2020-08-19 01:06:48,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 01:06:48,256 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-19 01:06:48,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-08-19 01:06:48,256 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-19 01:06:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-19 01:06:48,264 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 01:06:48,264 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-19 01:06:48,265 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 01:06:48,265 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 01:06:48,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 01:06:48,266 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 10 times [2020-08-19 01:06:48,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 01:06:48,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703011316] [2020-08-19 01:06:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 01:06:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 01:06:48,370 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 01:06:48,370 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 01:06:48,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 01:06:48,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 01:06:48 BoogieIcfgContainer [2020-08-19 01:06:48,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 01:06:48,477 INFO L168 Benchmark]: Toolchain (without parser) took 9822.30 ms. Allocated memory was 145.8 MB in the beginning and 550.0 MB in the end (delta: 404.2 MB). Free memory was 102.2 MB in the beginning and 409.6 MB in the end (delta: -307.4 MB). Peak memory consumption was 96.9 MB. Max. memory is 7.1 GB. [2020-08-19 01:06:48,482 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 145.8 MB. Free memory was 120.3 MB in the beginning and 119.9 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-08-19 01:06:48,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.83 ms. Allocated memory is still 145.8 MB. Free memory was 101.8 MB in the beginning and 92.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-19 01:06:48,484 INFO L168 Benchmark]: Boogie Preprocessor took 31.00 ms. Allocated memory is still 145.8 MB. Free memory was 92.7 MB in the beginning and 91.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-08-19 01:06:48,485 INFO L168 Benchmark]: RCFGBuilder took 344.46 ms. Allocated memory was 145.8 MB in the beginning and 201.3 MB in the end (delta: 55.6 MB). Free memory was 91.0 MB in the beginning and 168.7 MB in the end (delta: -77.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-08-19 01:06:48,490 INFO L168 Benchmark]: TraceAbstraction took 9138.90 ms. Allocated memory was 201.3 MB in the beginning and 550.0 MB in the end (delta: 348.7 MB). Free memory was 167.8 MB in the beginning and 409.6 MB in the end (delta: -241.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 7.1 GB. [2020-08-19 01:06:48,495 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.32 ms. Allocated memory is still 145.8 MB. Free memory was 120.3 MB in the beginning and 119.9 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 302.83 ms. Allocated memory is still 145.8 MB. Free memory was 101.8 MB in the beginning and 92.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.00 ms. Allocated memory is still 145.8 MB. Free memory was 92.7 MB in the beginning and 91.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 344.46 ms. Allocated memory was 145.8 MB in the beginning and 201.3 MB in the end (delta: 55.6 MB). Free memory was 91.0 MB in the beginning and 168.7 MB in the end (delta: -77.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9138.90 ms. Allocated memory was 201.3 MB in the beginning and 550.0 MB in the end (delta: 348.7 MB). Free memory was 167.8 MB in the beginning and 409.6 MB in the end (delta: -241.8 MB). Peak memory consumption was 106.8 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.9s, OverallIterations: 13, TraceHistogramMax: 77, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 489 SDslu, 698 SDs, 0 SdLazy, 1352 SolverSat, 481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 632 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.8s 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.4s 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...