/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_i10_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:49:49,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:49:49,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:49:49,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:49:49,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:49:49,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:49:49,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:49:49,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:49:49,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:49:49,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:49:49,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:49:49,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:49:49,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:49:49,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:49:49,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:49:49,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:49:49,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:49:49,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:49:49,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:49:49,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:49:49,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:49:49,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:49:49,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:49:49,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:49:49,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:49:49,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:49:49,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:49:49,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:49:49,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:49:49,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:49:49,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:49:49,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:49:49,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:49:49,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:49:49,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:49:49,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:49:49,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:49:49,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:49:49,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:49:49,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:49:49,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:49:49,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-27 21:49:49,489 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:49:49,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:49:49,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:49:49,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:49:49,491 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:49:49,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:49:49,492 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:49:49,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:49:49,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:49:49,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:49:49,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:49:49,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:49:49,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:49:49,493 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:49:49,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:49:49,497 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:49:49,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:49:49,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:49:49,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:49:49,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:49:49,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:49:49,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:49,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:49:49,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:49:49,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:49:49,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:49:49,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:49:49,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:49:49,503 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:49:49,503 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-08-27 21:49:50,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:49:50,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:49:50,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:49:50,040 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:49:50,040 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:49:50,043 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-08-27 21:49:50,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7351717bd/be0cffb8fb4c4caab2a20090399eb41f/FLAGd68bfebee [2020-08-27 21:49:50,725 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:49:50,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-08-27 21:49:50,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7351717bd/be0cffb8fb4c4caab2a20090399eb41f/FLAGd68bfebee [2020-08-27 21:49:51,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7351717bd/be0cffb8fb4c4caab2a20090399eb41f [2020-08-27 21:49:51,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:49:51,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:49:51,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:51,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:49:51,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:49:51,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:51" (1/1) ... [2020-08-27 21:49:51,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd8ad23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51, skipping insertion in model container [2020-08-27 21:49:51,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:51" (1/1) ... [2020-08-27 21:49:51,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:49:51,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:49:51,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:51,383 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:49:51,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:51,416 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:49:51,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51 WrapperNode [2020-08-27 21:49:51,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:51,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:49:51,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:49:51,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:49:51,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51" (1/1) ... [2020-08-27 21:49:51,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51" (1/1) ... [2020-08-27 21:49:51,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51" (1/1) ... [2020-08-27 21:49:51,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51" (1/1) ... [2020-08-27 21:49:51,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51" (1/1) ... [2020-08-27 21:49:51,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51" (1/1) ... [2020-08-27 21:49:51,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51" (1/1) ... [2020-08-27 21:49:51,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:49:51,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:49:51,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:49:51,448 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:49:51,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:49:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:49:51,615 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-08-27 21:49:51,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:49:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:49:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:49:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-08-27 21:49:51,616 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:49:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:49:51,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:49:51,797 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:49:51,798 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-27 21:49:51,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:51 BoogieIcfgContainer [2020-08-27 21:49:51,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:49:51,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:49:51,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:49:51,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:49:51,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:49:51" (1/3) ... [2020-08-27 21:49:51,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e3b609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:51, skipping insertion in model container [2020-08-27 21:49:51,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:51" (2/3) ... [2020-08-27 21:49:51,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e3b609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:51, skipping insertion in model container [2020-08-27 21:49:51,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:51" (3/3) ... [2020-08-27 21:49:51,812 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2020-08-27 21:49:51,823 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:49:51,831 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:49:51,851 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:49:51,879 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:49:51,880 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:49:51,880 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:49:51,880 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:49:51,880 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:49:51,880 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:49:51,880 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:49:51,881 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:49:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-08-27 21:49:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-27 21:49:51,910 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:51,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:51,912 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:51,919 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2020-08-27 21:49:51,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:51,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1509561441] [2020-08-27 21:49:51,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:49:52,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1509561441] [2020-08-27 21:49:52,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:49:52,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:49:52,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965354710] [2020-08-27 21:49:52,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:49:52,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:52,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:49:52,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:49:52,309 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-08-27 21:49:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:52,405 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-08-27 21:49:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:49:52,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-27 21:49:52,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:52,423 INFO L225 Difference]: With dead ends: 30 [2020-08-27 21:49:52,423 INFO L226 Difference]: Without dead ends: 18 [2020-08-27 21:49:52,427 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-08-27 21:49:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-08-27 21:49:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-08-27 21:49:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-08-27 21:49:52,476 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-08-27 21:49:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:52,476 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-08-27 21:49:52,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:49:52,477 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-08-27 21:49:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-27 21:49:52,479 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:52,479 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:52,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:49:52,480 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:52,481 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2020-08-27 21:49:52,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:52,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322796822] [2020-08-27 21:49:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-27 21:49:52,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322796822] [2020-08-27 21:49:52,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:52,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-27 21:49:52,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440655006] [2020-08-27 21:49:52,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:49:52,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:52,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:49:52,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:52,630 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2020-08-27 21:49:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:52,695 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-08-27 21:49:52,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-27 21:49:52,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-08-27 21:49:52,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:52,697 INFO L225 Difference]: With dead ends: 25 [2020-08-27 21:49:52,697 INFO L226 Difference]: Without dead ends: 21 [2020-08-27 21:49:52,699 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-08-27 21:49:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-27 21:49:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-27 21:49:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-27 21:49:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-08-27 21:49:52,710 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-08-27 21:49:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:52,710 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-08-27 21:49:52,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:49:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-08-27 21:49:52,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-08-27 21:49:52,713 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:52,713 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:52,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:49:52,714 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:52,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2020-08-27 21:49:52,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:52,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1179151591] [2020-08-27 21:49:52,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-08-27 21:49:52,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1179151591] [2020-08-27 21:49:52,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:52,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:49:52,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758293750] [2020-08-27 21:49:52,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:49:52,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:49:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:49:52,904 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2020-08-27 21:49:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:53,015 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-08-27 21:49:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:49:53,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-08-27 21:49:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:53,019 INFO L225 Difference]: With dead ends: 28 [2020-08-27 21:49:53,019 INFO L226 Difference]: Without dead ends: 24 [2020-08-27 21:49:53,021 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-08-27 21:49:53,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-08-27 21:49:53,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-08-27 21:49:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-08-27 21:49:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-08-27 21:49:53,035 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2020-08-27 21:49:53,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:53,035 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-08-27 21:49:53,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:49:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-08-27 21:49:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-08-27 21:49:53,038 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:53,039 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:53,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:49:53,039 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:53,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2020-08-27 21:49:53,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:53,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1623348663] [2020-08-27 21:49:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-27 21:49:53,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1623348663] [2020-08-27 21:49:53,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:53,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:49:53,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064475915] [2020-08-27 21:49:53,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:49:53,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:49:53,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:53,261 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2020-08-27 21:49:53,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:53,372 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-08-27 21:49:53,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:49:53,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2020-08-27 21:49:53,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:53,374 INFO L225 Difference]: With dead ends: 31 [2020-08-27 21:49:53,374 INFO L226 Difference]: Without dead ends: 27 [2020-08-27 21:49:53,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-08-27 21:49:53,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-08-27 21:49:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-08-27 21:49:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-08-27 21:49:53,382 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2020-08-27 21:49:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:53,383 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-08-27 21:49:53,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:49:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-08-27 21:49:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-27 21:49:53,385 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:53,385 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:53,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:49:53,386 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:53,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:53,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2020-08-27 21:49:53,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:53,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [672281931] [2020-08-27 21:49:53,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-08-27 21:49:53,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [672281931] [2020-08-27 21:49:53,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:53,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-27 21:49:53,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493351097] [2020-08-27 21:49:53,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-27 21:49:53,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:53,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-27 21:49:53,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:49:53,641 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-08-27 21:49:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:53,753 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2020-08-27 21:49:53,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:49:53,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-08-27 21:49:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:53,756 INFO L225 Difference]: With dead ends: 34 [2020-08-27 21:49:53,756 INFO L226 Difference]: Without dead ends: 30 [2020-08-27 21:49:53,759 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-08-27 21:49:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-27 21:49:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-27 21:49:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-27 21:49:53,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-08-27 21:49:53,766 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2020-08-27 21:49:53,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:53,766 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-08-27 21:49:53,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-27 21:49:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-08-27 21:49:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-27 21:49:53,768 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:53,768 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:53,769 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:49:53,769 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:53,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2020-08-27 21:49:53,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:53,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1850367832] [2020-08-27 21:49:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-27 21:49:53,976 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1850367832] [2020-08-27 21:49:53,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:53,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:49:53,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330622933] [2020-08-27 21:49:53,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:49:53,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:53,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:49:53,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:53,979 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2020-08-27 21:49:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,077 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2020-08-27 21:49:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:49:54,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2020-08-27 21:49:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,080 INFO L225 Difference]: With dead ends: 37 [2020-08-27 21:49:54,080 INFO L226 Difference]: Without dead ends: 33 [2020-08-27 21:49:54,081 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-08-27 21:49:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-27 21:49:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-27 21:49:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-27 21:49:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2020-08-27 21:49:54,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2020-08-27 21:49:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:54,088 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2020-08-27 21:49:54,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:49:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2020-08-27 21:49:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-08-27 21:49:54,090 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,090 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:54,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:49:54,091 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2020-08-27 21:49:54,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [923395064] [2020-08-27 21:49:54,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-08-27 21:49:54,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [923395064] [2020-08-27 21:49:54,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:54,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-27 21:49:54,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630751703] [2020-08-27 21:49:54,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-27 21:49:54,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-27 21:49:54,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:49:54,338 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2020-08-27 21:49:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,473 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-08-27 21:49:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:49:54,475 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2020-08-27 21:49:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,478 INFO L225 Difference]: With dead ends: 40 [2020-08-27 21:49:54,478 INFO L226 Difference]: Without dead ends: 36 [2020-08-27 21:49:54,479 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-08-27 21:49:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-08-27 21:49:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-08-27 21:49:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-08-27 21:49:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2020-08-27 21:49:54,486 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2020-08-27 21:49:54,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:54,487 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2020-08-27 21:49:54,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-27 21:49:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2020-08-27 21:49:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-27 21:49:54,488 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,488 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:54,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:49:54,489 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2020-08-27 21:49:54,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1063654527] [2020-08-27 21:49:54,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-27 21:49:54,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1063654527] [2020-08-27 21:49:54,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:54,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-27 21:49:54,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215860775] [2020-08-27 21:49:54,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:49:54,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:54,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:49:54,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:54,769 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2020-08-27 21:49:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:54,892 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-08-27 21:49:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-27 21:49:54,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2020-08-27 21:49:54,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:54,894 INFO L225 Difference]: With dead ends: 43 [2020-08-27 21:49:54,894 INFO L226 Difference]: Without dead ends: 39 [2020-08-27 21:49:54,895 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-08-27 21:49:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-27 21:49:54,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-27 21:49:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-27 21:49:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-08-27 21:49:54,903 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2020-08-27 21:49:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:54,903 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-08-27 21:49:54,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:49:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-08-27 21:49:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-08-27 21:49:54,905 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:54,905 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:54,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:49:54,905 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:54,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:54,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2020-08-27 21:49:54,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:54,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999335675] [2020-08-27 21:49:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:54,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-08-27 21:49:55,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999335675] [2020-08-27 21:49:55,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-27 21:49:55,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982586618] [2020-08-27 21:49:55,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-27 21:49:55,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-27 21:49:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-08-27 21:49:55,248 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2020-08-27 21:49:55,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,384 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-08-27 21:49:55,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-27 21:49:55,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2020-08-27 21:49:55,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,387 INFO L225 Difference]: With dead ends: 46 [2020-08-27 21:49:55,387 INFO L226 Difference]: Without dead ends: 42 [2020-08-27 21:49:55,388 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-08-27 21:49:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-08-27 21:49:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-08-27 21:49:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-27 21:49:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-08-27 21:49:55,395 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2020-08-27 21:49:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,396 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-08-27 21:49:55,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-27 21:49:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-08-27 21:49:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-27 21:49:55,397 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,397 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,398 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:49:55,398 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2020-08-27 21:49:55,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1657964278] [2020-08-27 21:49:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-08-27 21:49:55,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1657964278] [2020-08-27 21:49:55,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:55,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-27 21:49:55,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058626674] [2020-08-27 21:49:55,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-27 21:49:55,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-27 21:49:55,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:55,752 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 14 states. [2020-08-27 21:49:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:55,906 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-08-27 21:49:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-27 21:49:55,907 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2020-08-27 21:49:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:55,908 INFO L225 Difference]: With dead ends: 49 [2020-08-27 21:49:55,908 INFO L226 Difference]: Without dead ends: 45 [2020-08-27 21:49:55,909 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-08-27 21:49:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-27 21:49:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-27 21:49:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-27 21:49:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-08-27 21:49:55,915 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2020-08-27 21:49:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:55,916 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-08-27 21:49:55,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-27 21:49:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-08-27 21:49:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-27 21:49:55,917 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:55,918 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:55,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:49:55,918 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2020-08-27 21:49:55,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:55,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2144392006] [2020-08-27 21:49:55,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:55,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-08-27 21:49:56,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2144392006] [2020-08-27 21:49:56,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:56,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-08-27 21:49:56,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413626237] [2020-08-27 21:49:56,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-08-27 21:49:56,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:56,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-08-27 21:49:56,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-08-27 21:49:56,737 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 25 states. [2020-08-27 21:49:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,063 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2020-08-27 21:49:57,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-08-27 21:49:57,064 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 73 [2020-08-27 21:49:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,065 INFO L225 Difference]: With dead ends: 52 [2020-08-27 21:49:57,066 INFO L226 Difference]: Without dead ends: 48 [2020-08-27 21:49:57,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-08-27 21:49:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-08-27 21:49:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-08-27 21:49:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-27 21:49:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2020-08-27 21:49:57,073 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2020-08-27 21:49:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,074 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2020-08-27 21:49:57,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-08-27 21:49:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2020-08-27 21:49:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-27 21:49:57,075 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:57,075 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:57,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:49:57,076 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:57,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:57,076 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2020-08-27 21:49:57,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:57,077 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [668557038] [2020-08-27 21:49:57,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-08-27 21:49:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 165 proven. 22 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-08-27 21:49:57,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [668557038] [2020-08-27 21:49:57,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:57,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-27 21:49:57,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074885045] [2020-08-27 21:49:57,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-27 21:49:57,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:57,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-27 21:49:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-08-27 21:49:57,544 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2020-08-27 21:49:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:57,793 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2020-08-27 21:49:57,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-27 21:49:57,793 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2020-08-27 21:49:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:57,794 INFO L225 Difference]: With dead ends: 48 [2020-08-27 21:49:57,794 INFO L226 Difference]: Without dead ends: 0 [2020-08-27 21:49:57,796 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2020-08-27 21:49:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-27 21:49:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-27 21:49:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-27 21:49:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-27 21:49:57,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2020-08-27 21:49:57,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:57,797 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-27 21:49:57,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-27 21:49:57,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-27 21:49:57,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-27 21:49:57,798 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-27 21:49:57,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-27 21:49:57,834 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-27 21:49:57,835 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:49:57,835 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:49:57,835 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-27 21:49:57,835 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-27 21:49:57,836 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-27 21:49:57,836 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2020-08-27 21:49:57,836 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 9 15) the Hoare annotation is: true [2020-08-27 21:49:57,836 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 9 15) no Hoare annotation was computed. [2020-08-27 21:49:57,836 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-08-27 21:49:57,836 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-08-27 21:49:57,837 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (<= 10 main_~input~0) (<= main_~input~0 10)) [2020-08-27 21:49:57,837 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-08-27 21:49:57,837 INFO L268 CegarLoopResult]: For program point L12-2(lines 9 15) no Hoare annotation was computed. [2020-08-27 21:49:57,838 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 7) no Hoare annotation was computed. [2020-08-27 21:49:57,838 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 7) no Hoare annotation was computed. [2020-08-27 21:49:57,838 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 7) the Hoare annotation is: true [2020-08-27 21:49:57,838 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-08-27 21:49:57,838 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-08-27 21:49:57,839 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-08-27 21:49:57,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:49:57 BoogieIcfgContainer [2020-08-27 21:49:57,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:49:57,852 INFO L168 Benchmark]: Toolchain (without parser) took 6780.60 ms. Allocated memory was 146.3 MB in the beginning and 287.8 MB in the end (delta: 141.6 MB). Free memory was 102.6 MB in the beginning and 108.1 MB in the end (delta: -5.5 MB). Peak memory consumption was 136.0 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:57,853 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 146.3 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-27 21:49:57,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.79 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 93.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:57,854 INFO L168 Benchmark]: Boogie Preprocessor took 30.09 ms. Allocated memory is still 146.3 MB. Free memory was 93.1 MB in the beginning and 91.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:57,855 INFO L168 Benchmark]: RCFGBuilder took 354.51 ms. Allocated memory was 146.3 MB in the beginning and 201.3 MB in the end (delta: 55.1 MB). Free memory was 91.8 MB in the beginning and 170.1 MB in the end (delta: -78.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:57,856 INFO L168 Benchmark]: TraceAbstraction took 6043.98 ms. Allocated memory was 201.3 MB in the beginning and 287.8 MB in the end (delta: 86.5 MB). Free memory was 169.4 MB in the beginning and 108.1 MB in the end (delta: 61.3 MB). Peak memory consumption was 147.8 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:57,865 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.28 ms. Allocated memory is still 146.3 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 346.79 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 93.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.09 ms. Allocated memory is still 146.3 MB. Free memory was 93.1 MB in the beginning and 91.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 354.51 ms. Allocated memory was 146.3 MB in the beginning and 201.3 MB in the end (delta: 55.1 MB). Free memory was 91.8 MB in the beginning and 170.1 MB in the end (delta: -78.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6043.98 ms. Allocated memory was 201.3 MB in the beginning and 287.8 MB in the end (delta: 86.5 MB). Free memory was 169.4 MB in the beginning and 108.1 MB in the end (delta: 61.3 MB). Peak memory consumption was 147.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.9s, OverallIterations: 12, TraceHistogramMax: 12, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 200 SDtfs, 167 SDslu, 1215 SDs, 0 SdLazy, 702 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 15 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 540 ConstructedInterpolants, 0 QuantifiedInterpolants, 78096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 1 PerfectInterpolantSequences, 957/1584 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 correct! Received shutdown request...