/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 false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-eb0fd7c [2020-09-21 10:19:33,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-21 10:19:33,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-21 10:19:33,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-21 10:19:33,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-21 10:19:33,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-21 10:19:33,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-21 10:19:33,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-21 10:19:33,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-21 10:19:33,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-21 10:19:33,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-21 10:19:33,420 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-21 10:19:33,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-21 10:19:33,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-21 10:19:33,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-21 10:19:33,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-21 10:19:33,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-21 10:19:33,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-21 10:19:33,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-21 10:19:33,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-21 10:19:33,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-21 10:19:33,447 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-21 10:19:33,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-21 10:19:33,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-21 10:19:33,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-21 10:19:33,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-21 10:19:33,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-21 10:19:33,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-21 10:19:33,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-21 10:19:33,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-21 10:19:33,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-21 10:19:33,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-21 10:19:33,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-21 10:19:33,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-21 10:19:33,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-21 10:19:33,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-21 10:19:33,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-21 10:19:33,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-21 10:19:33,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-21 10:19:33,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-21 10:19:33,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-21 10:19:33,480 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-09-21 10:19:33,532 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-21 10:19:33,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-21 10:19:33,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-21 10:19:33,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-21 10:19:33,535 INFO L138 SettingsManager]: * Use SBE=true [2020-09-21 10:19:33,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-21 10:19:33,535 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-21 10:19:33,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-21 10:19:33,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-21 10:19:33,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-21 10:19:33,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-21 10:19:33,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-21 10:19:33,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-21 10:19:33,538 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-21 10:19:33,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-21 10:19:33,538 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-21 10:19:33,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-21 10:19:33,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-21 10:19:33,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-21 10:19:33,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-21 10:19:33,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-21 10:19:33,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-21 10:19:33,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-21 10:19:33,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-21 10:19:33,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-21 10:19:33,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-21 10:19:33,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-21 10:19:33,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-21 10:19:33,541 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-21 10:19:33,541 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 -> false [2020-09-21 10:19:33,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-21 10:19:33,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-21 10:19:33,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-21 10:19:33,998 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-21 10:19:33,998 INFO L275 PluginConnector]: CDTParser initialized [2020-09-21 10:19:34,000 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-09-21 10:19:34,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/14102cee3/86cac2a43bf54922a8110967dcae08c9/FLAGc97b19391 [2020-09-21 10:19:34,625 INFO L306 CDTParser]: Found 1 translation units. [2020-09-21 10:19:34,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-09-21 10:19:34,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/14102cee3/86cac2a43bf54922a8110967dcae08c9/FLAGc97b19391 [2020-09-21 10:19:34,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/14102cee3/86cac2a43bf54922a8110967dcae08c9 [2020-09-21 10:19:34,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-21 10:19:34,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-21 10:19:34,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:34,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-21 10:19:35,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-21 10:19:35,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:34" (1/1) ... [2020-09-21 10:19:35,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b86a7e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35, skipping insertion in model container [2020-09-21 10:19:35,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 10:19:34" (1/1) ... [2020-09-21 10:19:35,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-21 10:19:35,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-21 10:19:35,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:35,241 INFO L203 MainTranslator]: Completed pre-run [2020-09-21 10:19:35,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-21 10:19:35,279 INFO L208 MainTranslator]: Completed translation [2020-09-21 10:19:35,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35 WrapperNode [2020-09-21 10:19:35,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-21 10:19:35,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-21 10:19:35,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-21 10:19:35,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-21 10:19:35,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35" (1/1) ... [2020-09-21 10:19:35,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35" (1/1) ... [2020-09-21 10:19:35,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35" (1/1) ... [2020-09-21 10:19:35,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35" (1/1) ... [2020-09-21 10:19:35,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35" (1/1) ... [2020-09-21 10:19:35,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35" (1/1) ... [2020-09-21 10:19:35,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35" (1/1) ... [2020-09-21 10:19:35,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-21 10:19:35,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-21 10:19:35,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-21 10:19:35,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-21 10:19:35,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35" (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-09-21 10:19:35,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-21 10:19:35,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-21 10:19:35,467 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-21 10:19:35,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-21 10:19:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-21 10:19:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-21 10:19:35,467 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-21 10:19:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-21 10:19:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-21 10:19:35,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-21 10:19:35,653 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-21 10:19:35,653 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-21 10:19:35,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:35 BoogieIcfgContainer [2020-09-21 10:19:35,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-21 10:19:35,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-21 10:19:35,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-21 10:19:35,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-21 10:19:35,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 10:19:34" (1/3) ... [2020-09-21 10:19:35,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d4d895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:35, skipping insertion in model container [2020-09-21 10:19:35,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 10:19:35" (2/3) ... [2020-09-21 10:19:35,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d4d895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 10:19:35, skipping insertion in model container [2020-09-21 10:19:35,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 10:19:35" (3/3) ... [2020-09-21 10:19:35,668 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2020-09-21 10:19:35,679 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-21 10:19:35,688 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-21 10:19:35,711 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-21 10:19:35,743 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-21 10:19:35,743 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-21 10:19:35,743 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-21 10:19:35,744 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-21 10:19:35,744 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-21 10:19:35,744 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-21 10:19:35,744 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-21 10:19:35,744 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-21 10:19:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-09-21 10:19:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-21 10:19:35,773 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:35,775 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:35,775 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:35,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:35,784 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-09-21 10:19:35,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:35,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [273527564] [2020-09-21 10:19:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-21 10:19:36,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [273527564] [2020-09-21 10:19:36,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-21 10:19:36,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-21 10:19:36,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850756271] [2020-09-21 10:19:36,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-21 10:19:36,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:36,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-21 10:19:36,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-21 10:19:36,172 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-09-21 10:19:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:36,257 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-09-21 10:19:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-21 10:19:36,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-21 10:19:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:36,273 INFO L225 Difference]: With dead ends: 30 [2020-09-21 10:19:36,273 INFO L226 Difference]: Without dead ends: 18 [2020-09-21 10:19:36,278 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-09-21 10:19:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-09-21 10:19:36,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-09-21 10:19:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-09-21 10:19:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-09-21 10:19:36,333 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-09-21 10:19:36,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:36,334 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-09-21 10:19:36,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-21 10:19:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-09-21 10:19:36,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-21 10:19:36,336 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:36,337 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:36,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-21 10:19:36,337 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-09-21 10:19:36,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:36,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2035931698] [2020-09-21 10:19:36,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-21 10:19:36,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2035931698] [2020-09-21 10:19:36,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:36,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-21 10:19:36,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862372481] [2020-09-21 10:19:36,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-21 10:19:36,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-21 10:19:36,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-21 10:19:36,473 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-09-21 10:19:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:36,532 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-09-21 10:19:36,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-21 10:19:36,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-09-21 10:19:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:36,535 INFO L225 Difference]: With dead ends: 25 [2020-09-21 10:19:36,535 INFO L226 Difference]: Without dead ends: 21 [2020-09-21 10:19:36,536 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-09-21 10:19:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-21 10:19:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-21 10:19:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-21 10:19:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-09-21 10:19:36,544 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-09-21 10:19:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:36,545 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-09-21 10:19:36,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-21 10:19:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-09-21 10:19:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-21 10:19:36,546 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:36,547 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:36,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-21 10:19:36,547 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-09-21 10:19:36,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:36,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [134339424] [2020-09-21 10:19:36,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:36,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-21 10:19:36,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [134339424] [2020-09-21 10:19:36,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:36,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-21 10:19:36,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828519697] [2020-09-21 10:19:36,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-21 10:19:36,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:36,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-21 10:19:36,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-21 10:19:36,745 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-09-21 10:19:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:36,821 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-09-21 10:19:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-21 10:19:36,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-09-21 10:19:36,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:36,823 INFO L225 Difference]: With dead ends: 28 [2020-09-21 10:19:36,823 INFO L226 Difference]: Without dead ends: 24 [2020-09-21 10:19:36,824 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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-09-21 10:19:36,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-09-21 10:19:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-09-21 10:19:36,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-09-21 10:19:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-09-21 10:19:36,831 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-09-21 10:19:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:36,831 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-09-21 10:19:36,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-21 10:19:36,832 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-09-21 10:19:36,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-21 10:19:36,833 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:36,833 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:36,833 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-21 10:19:36,833 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:36,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:36,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-09-21 10:19:36,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:36,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1597078230] [2020-09-21 10:19:36,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:36,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-21 10:19:37,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1597078230] [2020-09-21 10:19:37,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:37,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-21 10:19:37,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293633766] [2020-09-21 10:19:37,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-21 10:19:37,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:37,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-21 10:19:37,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-21 10:19:37,021 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-09-21 10:19:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:37,114 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-09-21 10:19:37,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-21 10:19:37,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-09-21 10:19:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:37,116 INFO L225 Difference]: With dead ends: 31 [2020-09-21 10:19:37,116 INFO L226 Difference]: Without dead ends: 27 [2020-09-21 10:19:37,117 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 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-09-21 10:19:37,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-09-21 10:19:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-09-21 10:19:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-09-21 10:19:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-09-21 10:19:37,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-09-21 10:19:37,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:37,125 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-09-21 10:19:37,125 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-21 10:19:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-09-21 10:19:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-21 10:19:37,127 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:37,127 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:37,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-21 10:19:37,128 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:37,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-09-21 10:19:37,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:37,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [708855598] [2020-09-21 10:19:37,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-21 10:19:37,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [708855598] [2020-09-21 10:19:37,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:37,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-21 10:19:37,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810522668] [2020-09-21 10:19:37,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-21 10:19:37,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:37,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-21 10:19:37,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-21 10:19:37,368 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-09-21 10:19:37,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:37,464 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-09-21 10:19:37,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-21 10:19:37,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-09-21 10:19:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:37,466 INFO L225 Difference]: With dead ends: 34 [2020-09-21 10:19:37,467 INFO L226 Difference]: Without dead ends: 30 [2020-09-21 10:19:37,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 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-09-21 10:19:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-21 10:19:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-21 10:19:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-21 10:19:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-21 10:19:37,487 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-09-21 10:19:37,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:37,488 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-21 10:19:37,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-21 10:19:37,488 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-21 10:19:37,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-21 10:19:37,489 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:37,490 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:37,491 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-21 10:19:37,492 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:37,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:37,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-09-21 10:19:37,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:37,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1765380258] [2020-09-21 10:19:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-21 10:19:37,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1765380258] [2020-09-21 10:19:37,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:37,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-21 10:19:37,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489111735] [2020-09-21 10:19:37,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-21 10:19:37,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-21 10:19:37,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-21 10:19:37,689 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-09-21 10:19:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:37,782 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-09-21 10:19:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-21 10:19:37,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-09-21 10:19:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:37,784 INFO L225 Difference]: With dead ends: 37 [2020-09-21 10:19:37,784 INFO L226 Difference]: Without dead ends: 33 [2020-09-21 10:19:37,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:19:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-21 10:19:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-21 10:19:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-21 10:19:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-09-21 10:19:37,792 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-09-21 10:19:37,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:37,793 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-09-21 10:19:37,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-21 10:19:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-09-21 10:19:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-09-21 10:19:37,795 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:37,795 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:37,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-21 10:19:37,795 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:37,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:37,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-09-21 10:19:37,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:37,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349570832] [2020-09-21 10:19:37,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:37,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-21 10:19:38,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349570832] [2020-09-21 10:19:38,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:38,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-21 10:19:38,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215596649] [2020-09-21 10:19:38,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-21 10:19:38,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:38,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-21 10:19:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-21 10:19:38,038 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-09-21 10:19:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:38,139 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-09-21 10:19:38,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-21 10:19:38,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-09-21 10:19:38,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:38,141 INFO L225 Difference]: With dead ends: 40 [2020-09-21 10:19:38,142 INFO L226 Difference]: Without dead ends: 36 [2020-09-21 10:19:38,142 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 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-09-21 10:19:38,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-09-21 10:19:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-09-21 10:19:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-09-21 10:19:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-09-21 10:19:38,149 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-09-21 10:19:38,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:38,150 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-09-21 10:19:38,150 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-21 10:19:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-09-21 10:19:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-21 10:19:38,151 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:38,151 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:38,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-21 10:19:38,152 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:38,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-09-21 10:19:38,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:38,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [49875242] [2020-09-21 10:19:38,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-21 10:19:38,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [49875242] [2020-09-21 10:19:38,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:38,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-09-21 10:19:38,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750784246] [2020-09-21 10:19:38,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-21 10:19:38,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:38,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-21 10:19:38,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-21 10:19:38,403 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-09-21 10:19:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:38,526 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-09-21 10:19:38,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-21 10:19:38,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-09-21 10:19:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:38,528 INFO L225 Difference]: With dead ends: 43 [2020-09-21 10:19:38,528 INFO L226 Difference]: Without dead ends: 39 [2020-09-21 10:19:38,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-21 10:19:38,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-21 10:19:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-09-21 10:19:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-21 10:19:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-09-21 10:19:38,535 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-09-21 10:19:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:38,536 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-09-21 10:19:38,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-21 10:19:38,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-09-21 10:19:38,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-09-21 10:19:38,538 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:38,538 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:38,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-21 10:19:38,538 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-09-21 10:19:38,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:38,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2095032900] [2020-09-21 10:19:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-21 10:19:38,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2095032900] [2020-09-21 10:19:38,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:38,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-21 10:19:38,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782848153] [2020-09-21 10:19:38,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-21 10:19:38,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:38,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-21 10:19:38,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-21 10:19:38,879 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-09-21 10:19:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:39,007 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-21 10:19:39,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-21 10:19:39,008 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-09-21 10:19:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:39,009 INFO L225 Difference]: With dead ends: 46 [2020-09-21 10:19:39,009 INFO L226 Difference]: Without dead ends: 42 [2020-09-21 10:19:39,010 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-21 10:19:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-21 10:19:39,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-21 10:19:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-21 10:19:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-09-21 10:19:39,017 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-09-21 10:19:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:39,018 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-09-21 10:19:39,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-21 10:19:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-09-21 10:19:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-21 10:19:39,019 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:39,019 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:39,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-21 10:19:39,020 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-09-21 10:19:39,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:39,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213060337] [2020-09-21 10:19:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-21 10:19:39,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213060337] [2020-09-21 10:19:39,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:39,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-21 10:19:39,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659136495] [2020-09-21 10:19:39,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-21 10:19:39,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-21 10:19:39,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-21 10:19:39,370 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-09-21 10:19:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:39,522 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-09-21 10:19:39,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-21 10:19:39,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-09-21 10:19:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:39,524 INFO L225 Difference]: With dead ends: 49 [2020-09-21 10:19:39,524 INFO L226 Difference]: Without dead ends: 45 [2020-09-21 10:19:39,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-21 10:19:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-21 10:19:39,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-21 10:19:39,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-21 10:19:39,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-21 10:19:39,531 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-09-21 10:19:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:39,532 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-21 10:19:39,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-21 10:19:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-21 10:19:39,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-21 10:19:39,533 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:39,534 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:39,534 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-21 10:19:39,534 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:39,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-09-21 10:19:39,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:39,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1303046765] [2020-09-21 10:19:39,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-21 10:19:39,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1303046765] [2020-09-21 10:19:39,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:39,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-21 10:19:39,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086358283] [2020-09-21 10:19:39,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-21 10:19:39,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:39,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-21 10:19:39,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-21 10:19:39,949 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-09-21 10:19:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:40,131 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-09-21 10:19:40,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-21 10:19:40,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2020-09-21 10:19:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:40,133 INFO L225 Difference]: With dead ends: 52 [2020-09-21 10:19:40,133 INFO L226 Difference]: Without dead ends: 48 [2020-09-21 10:19:40,135 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-21 10:19:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-09-21 10:19:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-09-21 10:19:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-21 10:19:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-09-21 10:19:40,149 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-09-21 10:19:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:40,151 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-09-21 10:19:40,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-21 10:19:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-09-21 10:19:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-21 10:19:40,152 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:40,152 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:40,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-21 10:19:40,153 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:40,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:40,153 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-09-21 10:19:40,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:40,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [869383152] [2020-09-21 10:19:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-21 10:19:40,663 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [869383152] [2020-09-21 10:19:40,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:40,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-21 10:19:40,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919495898] [2020-09-21 10:19:40,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-21 10:19:40,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-21 10:19:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-21 10:19:40,665 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-09-21 10:19:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:40,848 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-09-21 10:19:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-21 10:19:40,848 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-09-21 10:19:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:40,850 INFO L225 Difference]: With dead ends: 55 [2020-09-21 10:19:40,850 INFO L226 Difference]: Without dead ends: 51 [2020-09-21 10:19:40,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-21 10:19:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-09-21 10:19:40,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-09-21 10:19:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-09-21 10:19:40,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2020-09-21 10:19:40,857 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2020-09-21 10:19:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:40,858 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2020-09-21 10:19:40,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-21 10:19:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2020-09-21 10:19:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2020-09-21 10:19:40,859 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:40,859 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:40,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-21 10:19:40,860 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:40,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2020-09-21 10:19:40,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:40,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [216126406] [2020-09-21 10:19:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:40,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-21 10:19:41,390 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [216126406] [2020-09-21 10:19:41,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:41,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-21 10:19:41,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840357151] [2020-09-21 10:19:41,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-21 10:19:41,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:41,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-21 10:19:41,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-21 10:19:41,393 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 17 states. [2020-09-21 10:19:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:41,596 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2020-09-21 10:19:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-21 10:19:41,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 85 [2020-09-21 10:19:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:41,598 INFO L225 Difference]: With dead ends: 58 [2020-09-21 10:19:41,598 INFO L226 Difference]: Without dead ends: 54 [2020-09-21 10:19:41,599 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-21 10:19:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-21 10:19:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-09-21 10:19:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-21 10:19:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-09-21 10:19:41,606 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2020-09-21 10:19:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:41,606 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-09-21 10:19:41,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-21 10:19:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-09-21 10:19:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-09-21 10:19:41,608 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:41,608 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:41,608 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-21 10:19:41,608 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2020-09-21 10:19:41,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:41,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1034536431] [2020-09-21 10:19:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:41,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-21 10:19:42,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1034536431] [2020-09-21 10:19:42,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:42,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-09-21 10:19:42,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131251468] [2020-09-21 10:19:42,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-21 10:19:42,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:42,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-21 10:19:42,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-21 10:19:42,185 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 18 states. [2020-09-21 10:19:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:42,401 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-21 10:19:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-21 10:19:42,402 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2020-09-21 10:19:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:42,404 INFO L225 Difference]: With dead ends: 61 [2020-09-21 10:19:42,404 INFO L226 Difference]: Without dead ends: 57 [2020-09-21 10:19:42,405 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-09-21 10:19:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-09-21 10:19:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-09-21 10:19:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-21 10:19:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-09-21 10:19:42,411 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2020-09-21 10:19:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:42,411 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-09-21 10:19:42,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-21 10:19:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-09-21 10:19:42,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-09-21 10:19:42,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:42,413 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:42,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-21 10:19:42,413 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2020-09-21 10:19:42,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:42,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1394204527] [2020-09-21 10:19:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-21 10:19:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-21 10:19:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:42,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:43,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:43,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-21 10:19:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-21 10:19:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-21 10:19:43,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1394204527] [2020-09-21 10:19:43,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-21 10:19:43,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-21 10:19:43,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663552989] [2020-09-21 10:19:43,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-21 10:19:43,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-21 10:19:43,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-21 10:19:43,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-21 10:19:43,106 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2020-09-21 10:19:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-21 10:19:43,346 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-09-21 10:19:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-21 10:19:43,347 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2020-09-21 10:19:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-21 10:19:43,348 INFO L225 Difference]: With dead ends: 64 [2020-09-21 10:19:43,348 INFO L226 Difference]: Without dead ends: 60 [2020-09-21 10:19:43,354 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-21 10:19:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-21 10:19:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-21 10:19:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-21 10:19:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-21 10:19:43,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2020-09-21 10:19:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-21 10:19:43,364 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-21 10:19:43,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-21 10:19:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-21 10:19:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-09-21 10:19:43,367 INFO L414 BasicCegarLoop]: Found error trace [2020-09-21 10:19:43,367 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-21 10:19:43,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-21 10:19:43,368 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-21 10:19:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-21 10:19:43,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2020-09-21 10:19:43,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-21 10:19:43,370 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [299951627] [2020-09-21 10:19:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-21 10:19:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-21 10:19:43,406 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-21 10:19:43,408 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-21 10:19:43,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-21 10:19:43,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 10:19:43 BoogieIcfgContainer [2020-09-21 10:19:43,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-21 10:19:43,484 INFO L168 Benchmark]: Toolchain (without parser) took 8489.75 ms. Allocated memory was 141.6 MB in the beginning and 338.2 MB in the end (delta: 196.6 MB). Free memory was 104.2 MB in the beginning and 111.8 MB in the end (delta: -7.6 MB). Peak memory consumption was 189.0 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:43,485 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.6 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-21 10:19:43,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.78 ms. Allocated memory is still 141.6 MB. Free memory was 103.6 MB in the beginning and 94.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:43,490 INFO L168 Benchmark]: Boogie Preprocessor took 35.95 ms. Allocated memory is still 141.6 MB. Free memory was 94.4 MB in the beginning and 93.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:43,492 INFO L168 Benchmark]: RCFGBuilder took 341.33 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 93.1 MB in the beginning and 173.8 MB in the end (delta: -80.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:43,493 INFO L168 Benchmark]: TraceAbstraction took 7820.30 ms. Allocated memory was 205.0 MB in the beginning and 338.2 MB in the end (delta: 133.2 MB). Free memory was 173.2 MB in the beginning and 111.8 MB in the end (delta: 61.4 MB). Peak memory consumption was 194.6 MB. Max. memory is 7.1 GB. [2020-09-21 10:19:43,499 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.25 ms. Allocated memory is still 141.6 MB. Free memory was 121.9 MB in the beginning and 121.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.78 ms. Allocated memory is still 141.6 MB. Free memory was 103.6 MB in the beginning and 94.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.95 ms. Allocated memory is still 141.6 MB. Free memory was 94.4 MB in the beginning and 93.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 341.33 ms. Allocated memory was 141.6 MB in the beginning and 205.0 MB in the end (delta: 63.4 MB). Free memory was 93.1 MB in the beginning and 173.8 MB in the end (delta: -80.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7820.30 ms. Allocated memory was 205.0 MB in the beginning and 338.2 MB in the end (delta: 133.2 MB). Free memory was 173.2 MB in the beginning and 111.8 MB in the end (delta: 61.4 MB). Peak memory consumption was 194.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 15; [L11] CALL, EXPR id(input) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND FALSE !(x==0) [L6] CALL, EXPR id(x-1) [L5] COND TRUE x==0 [L5] return 0; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 15 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.6s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 199 SDtfs, 318 SDslu, 762 SDs, 0 SdLazy, 455 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 555 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 928 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 810 ConstructedInterpolants, 0 QuantifiedInterpolants, 133800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 1575/3150 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...