java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:23:03,990 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:23:03,992 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:23:04,017 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:23:04,017 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:23:04,018 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:23:04,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:23:04,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:23:04,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:23:04,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:23:04,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:23:04,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:23:04,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:23:04,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:23:04,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:23:04,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:23:04,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:23:04,052 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:23:04,056 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:23:04,058 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:23:04,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:23:04,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:23:04,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:23:04,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:23:04,063 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:23:04,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:23:04,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:23:04,071 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:23:04,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:23:04,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:23:04,072 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:23:04,073 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:23:04,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:23:04,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:23:04,087 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:23:04,087 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:23:04,087 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:23:04,088 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:23:04,088 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:23:04,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:23:04,091 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:23:04,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:23:04,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:23:04,091 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:23:04,091 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:23:04,091 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:23:04,092 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:23:04,092 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:23:04,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:23:04,092 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:23:04,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:23:04,093 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:23:04,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:23:04,093 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:23:04,093 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:23:04,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:23:04,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:23:04,094 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:23:04,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:23:04,095 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:23:04,095 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:23:04,096 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:23:04,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:23:04,096 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:23:04,097 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:23:04,097 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:23:04,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:23:04,150 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:23:04,153 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:23:04,155 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:23:04,155 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:23:04,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:23:04,339 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:23:04,349 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:23:04,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:23:04,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:23:04,357 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:23:04,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:23:04" (1/1) ... [2018-01-31 08:23:04,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f4f4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04, skipping insertion in model container [2018-01-31 08:23:04,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:23:04" (1/1) ... [2018-01-31 08:23:04,381 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:23:04,444 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:23:04,618 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:23:04,644 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:23:04,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04 WrapperNode [2018-01-31 08:23:04,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:23:04,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:23:04,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:23:04,653 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:23:04,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04" (1/1) ... [2018-01-31 08:23:04,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04" (1/1) ... [2018-01-31 08:23:04,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04" (1/1) ... [2018-01-31 08:23:04,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04" (1/1) ... [2018-01-31 08:23:04,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04" (1/1) ... [2018-01-31 08:23:04,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04" (1/1) ... [2018-01-31 08:23:04,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04" (1/1) ... [2018-01-31 08:23:04,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:23:04,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:23:04,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:23:04,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:23:04,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04" (1/1) ... No working directory specified, using /storage/ultimate/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 [2018-01-31 08:23:04,755 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:23:04,755 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:23:04,755 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-31 08:23:04,755 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:23:04,756 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:23:04,756 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:23:04,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:23:04,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:23:04,756 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:23:04,756 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:23:04,757 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-31 08:23:04,757 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:23:04,757 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:23:04,757 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:23:05,353 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:23:05,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:23:05 BoogieIcfgContainer [2018-01-31 08:23:05,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:23:05,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:23:05,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:23:05,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:23:05,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:23:04" (1/3) ... [2018-01-31 08:23:05,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41190647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:23:05, skipping insertion in model container [2018-01-31 08:23:05,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:23:04" (2/3) ... [2018-01-31 08:23:05,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41190647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:23:05, skipping insertion in model container [2018-01-31 08:23:05,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:23:05" (3/3) ... [2018-01-31 08:23:05,362 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:23:05,372 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:23:05,381 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-31 08:23:05,436 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:23:05,436 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:23:05,436 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:23:05,437 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:23:05,437 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:23:05,437 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:23:05,437 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:23:05,437 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:23:05,438 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:23:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-01-31 08:23:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:23:05,470 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:05,471 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:05,471 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash 328973023, now seen corresponding path program 1 times [2018-01-31 08:23:05,478 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:05,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:05,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:05,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:05,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:05,585 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:05,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:05,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:05,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:23:05,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:23:05,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:23:05,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:23:05,803 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-01-31 08:23:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:06,238 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-01-31 08:23:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:23:06,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-31 08:23:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:06,280 INFO L225 Difference]: With dead ends: 147 [2018-01-31 08:23:06,281 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:23:06,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:23:06,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:23:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-31 08:23:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 08:23:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-31 08:23:06,326 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 19 [2018-01-31 08:23:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:06,326 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-31 08:23:06,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:23:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-31 08:23:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-31 08:23:06,327 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:06,327 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:06,327 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 328973024, now seen corresponding path program 1 times [2018-01-31 08:23:06,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:06,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:06,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:06,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:06,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:06,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:06,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:06,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:23:06,592 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:23:06,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:23:06,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:23:06,593 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 6 states. [2018-01-31 08:23:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:06,804 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-31 08:23:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:23:06,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-31 08:23:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:06,806 INFO L225 Difference]: With dead ends: 86 [2018-01-31 08:23:06,806 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 08:23:06,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:23:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 08:23:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 08:23:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:23:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-31 08:23:06,819 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 19 [2018-01-31 08:23:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:06,820 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-31 08:23:06,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:23:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-31 08:23:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:23:06,821 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:06,821 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:06,821 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1608229205, now seen corresponding path program 1 times [2018-01-31 08:23:06,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:06,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:06,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:06,823 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:06,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:06,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:06,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:06,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:23:06,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:23:06,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:23:06,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:23:06,903 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 4 states. [2018-01-31 08:23:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:06,973 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-01-31 08:23:06,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:23:06,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-31 08:23:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:06,975 INFO L225 Difference]: With dead ends: 85 [2018-01-31 08:23:06,975 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 08:23:06,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:23:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 08:23:06,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 08:23:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 08:23:06,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-31 08:23:06,987 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 20 [2018-01-31 08:23:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:06,988 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-31 08:23:06,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:23:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-31 08:23:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:23:06,989 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:06,989 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:06,989 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:06,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1608229206, now seen corresponding path program 1 times [2018-01-31 08:23:06,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:06,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:06,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:06,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:06,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:07,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:07,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:07,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:23:07,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:23:07,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:23:07,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:23:07,145 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 5 states. [2018-01-31 08:23:07,453 WARN L143 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:23:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:07,493 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-31 08:23:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:23:07,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-31 08:23:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:07,496 INFO L225 Difference]: With dead ends: 84 [2018-01-31 08:23:07,496 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 08:23:07,497 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:23:07,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 08:23:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-31 08:23:07,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 08:23:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-31 08:23:07,505 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 20 [2018-01-31 08:23:07,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:07,505 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-31 08:23:07,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:23:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-31 08:23:07,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:23:07,506 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:07,507 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:07,507 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:07,507 INFO L82 PathProgramCache]: Analyzing trace with hash -39877229, now seen corresponding path program 1 times [2018-01-31 08:23:07,507 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:07,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:07,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:07,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:07,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:07,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:07,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:07,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:23:07,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:23:07,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:23:07,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:23:07,599 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-01-31 08:23:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:07,742 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-31 08:23:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:23:07,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-31 08:23:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:07,744 INFO L225 Difference]: With dead ends: 87 [2018-01-31 08:23:07,744 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 08:23:07,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:23:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 08:23:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-01-31 08:23:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 08:23:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-31 08:23:07,753 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 29 [2018-01-31 08:23:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:07,753 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-31 08:23:07,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:23:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-31 08:23:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:23:07,754 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:07,755 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:07,755 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:07,755 INFO L82 PathProgramCache]: Analyzing trace with hash -39877228, now seen corresponding path program 1 times [2018-01-31 08:23:07,755 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:07,755 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:07,756 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:07,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:07,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:07,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:07,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:07,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:23:07,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:23:07,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:23:07,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:23:07,956 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 9 states. [2018-01-31 08:23:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:08,535 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-01-31 08:23:08,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:23:08,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-31 08:23:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:08,539 INFO L225 Difference]: With dead ends: 125 [2018-01-31 08:23:08,539 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 08:23:08,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:23:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 08:23:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 88. [2018-01-31 08:23:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:23:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-31 08:23:08,552 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 29 [2018-01-31 08:23:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:08,552 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-31 08:23:08,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:23:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-31 08:23:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:23:08,553 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:08,554 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:08,554 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:08,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1160902392, now seen corresponding path program 1 times [2018-01-31 08:23:08,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:08,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:08,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:08,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:08,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:08,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:08,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:08,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:23:08,639 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:23:08,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:23:08,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:23:08,639 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-01-31 08:23:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:08,768 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-01-31 08:23:08,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:23:08,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-31 08:23:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:08,769 INFO L225 Difference]: With dead ends: 96 [2018-01-31 08:23:08,770 INFO L226 Difference]: Without dead ends: 93 [2018-01-31 08:23:08,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:23:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-31 08:23:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-01-31 08:23:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-31 08:23:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-31 08:23:08,780 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 37 [2018-01-31 08:23:08,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:08,781 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-31 08:23:08,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:23:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-31 08:23:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:23:08,783 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:08,783 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:08,783 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1160902393, now seen corresponding path program 1 times [2018-01-31 08:23:08,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:08,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:08,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:08,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:08,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:08,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:09,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:09,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:23:09,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:23:09,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:23:09,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:23:09,012 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 9 states. [2018-01-31 08:23:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:09,292 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-01-31 08:23:09,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:23:09,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-31 08:23:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:09,294 INFO L225 Difference]: With dead ends: 123 [2018-01-31 08:23:09,294 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 08:23:09,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:23:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 08:23:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2018-01-31 08:23:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 08:23:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-31 08:23:09,302 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 37 [2018-01-31 08:23:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:09,302 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-31 08:23:09,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:23:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-31 08:23:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 08:23:09,304 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:09,304 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:09,304 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:09,304 INFO L82 PathProgramCache]: Analyzing trace with hash -442191989, now seen corresponding path program 1 times [2018-01-31 08:23:09,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:09,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:09,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:09,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:09,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:09,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:09,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:09,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:23:09,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:23:09,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:23:09,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:23:09,429 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-01-31 08:23:09,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:09,645 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-01-31 08:23:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:23:09,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-31 08:23:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:09,646 INFO L225 Difference]: With dead ends: 97 [2018-01-31 08:23:09,646 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 08:23:09,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:23:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 08:23:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-31 08:23:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 08:23:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-31 08:23:09,655 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 41 [2018-01-31 08:23:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:09,655 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-31 08:23:09,655 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:23:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-31 08:23:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-31 08:23:09,657 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:09,657 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:09,657 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1890808931, now seen corresponding path program 1 times [2018-01-31 08:23:09,657 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:09,657 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:09,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:09,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:09,658 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:09,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:09,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:09,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:23:09,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:23:09,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:23:09,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:23:09,740 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 3 states. [2018-01-31 08:23:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:09,843 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-01-31 08:23:09,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:23:09,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-31 08:23:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:09,844 INFO L225 Difference]: With dead ends: 133 [2018-01-31 08:23:09,844 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 08:23:09,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:23:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 08:23:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-31 08:23:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:23:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-31 08:23:09,851 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 48 [2018-01-31 08:23:09,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:09,852 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-31 08:23:09,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:23:09,852 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-31 08:23:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:23:09,854 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:09,854 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:09,854 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:09,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1028999776, now seen corresponding path program 1 times [2018-01-31 08:23:09,854 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:09,854 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:09,855 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:09,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:09,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:09,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:23:10,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:10,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:23:10,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:23:10,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:23:10,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:23:10,377 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 7 states. [2018-01-31 08:23:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:10,505 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-01-31 08:23:10,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:23:10,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-31 08:23:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:10,506 INFO L225 Difference]: With dead ends: 85 [2018-01-31 08:23:10,506 INFO L226 Difference]: Without dead ends: 84 [2018-01-31 08:23:10,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:23:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-31 08:23:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-31 08:23:10,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 08:23:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-31 08:23:10,513 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 50 [2018-01-31 08:23:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:10,513 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-31 08:23:10,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:23:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-31 08:23:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:23:10,515 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:10,515 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:10,515 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:10,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1028999775, now seen corresponding path program 1 times [2018-01-31 08:23:10,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:10,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:10,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:10,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:10,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:10,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:11,193 WARN L143 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:23:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:11,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:23:11,395 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:23:11,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:11,452 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:23:11,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:23:11,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-31 08:23:11,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:11,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:11,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:23:11,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-31 08:23:11,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-31 08:23:11,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:23:11,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:23:11,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:23:12,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:23:12,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-31 08:23:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:12,266 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:23:12,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-31 08:23:12,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:23:12,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:23:12,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:23:12,267 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 22 states. [2018-01-31 08:23:13,367 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-01-31 08:23:13,596 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 54 DAG size of output 46 [2018-01-31 08:23:14,662 WARN L146 SmtUtils]: Spent 234ms on a formula simplification. DAG size of input: 42 DAG size of output 38 [2018-01-31 08:23:15,395 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 62 DAG size of output 52 [2018-01-31 08:23:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:15,582 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2018-01-31 08:23:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:23:15,582 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-01-31 08:23:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:15,584 INFO L225 Difference]: With dead ends: 199 [2018-01-31 08:23:15,584 INFO L226 Difference]: Without dead ends: 196 [2018-01-31 08:23:15,585 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=319, Invalid=1403, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:23:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-31 08:23:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 97. [2018-01-31 08:23:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 08:23:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-31 08:23:15,598 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 50 [2018-01-31 08:23:15,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:15,599 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-31 08:23:15,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:23:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-31 08:23:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 08:23:15,600 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:15,600 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:15,600 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1520251311, now seen corresponding path program 1 times [2018-01-31 08:23:15,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:15,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:15,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:15,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:15,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:15,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:15,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:15,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:23:15,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:23:15,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:23:15,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:23:15,684 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 10 states. [2018-01-31 08:23:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:16,108 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2018-01-31 08:23:16,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-31 08:23:16,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-01-31 08:23:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:16,110 INFO L225 Difference]: With dead ends: 170 [2018-01-31 08:23:16,110 INFO L226 Difference]: Without dead ends: 102 [2018-01-31 08:23:16,110 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:23:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-31 08:23:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-01-31 08:23:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-31 08:23:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-31 08:23:16,121 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 51 [2018-01-31 08:23:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:16,121 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-31 08:23:16,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:23:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-31 08:23:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-31 08:23:16,122 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:16,123 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:16,123 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash 362292428, now seen corresponding path program 1 times [2018-01-31 08:23:16,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:16,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:16,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:16,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:16,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:16,141 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:23:16,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:23:16,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:23:16,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:23:16,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:23:16,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:23:16,574 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 7 states. [2018-01-31 08:23:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:16,715 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-01-31 08:23:16,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:23:16,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-01-31 08:23:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:16,717 INFO L225 Difference]: With dead ends: 100 [2018-01-31 08:23:16,717 INFO L226 Difference]: Without dead ends: 99 [2018-01-31 08:23:16,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:23:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-31 08:23:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-31 08:23:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-31 08:23:16,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-31 08:23:16,727 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 53 [2018-01-31 08:23:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:16,728 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-31 08:23:16,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:23:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-31 08:23:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-31 08:23:16,730 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:16,730 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:16,730 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 362292429, now seen corresponding path program 1 times [2018-01-31 08:23:16,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:16,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:16,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:16,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:16,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:16,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:17,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:23:17,114 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:23:17,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:17,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:23:17,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:23:17,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:17,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:17,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:23:17,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:23:17,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:23:17,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:23:17,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:17,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:17,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:23:17,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:23:17,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-31 08:23:17,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:17,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:17,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:23:17,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-31 08:23:17,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-31 08:23:17,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-31 08:23:17,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:17,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:17,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:23:17,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-31 08:23:19,935 WARN L143 SmtUtils]: Spent 2045ms on a formula simplification that was a NOOP. DAG size: 46 [2018-01-31 08:23:20,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-01-31 08:23:20,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-01-31 08:23:20,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-31 08:23:20,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-01-31 08:23:20,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-31 08:23:20,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-01-31 08:23:20,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:20,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-01-31 08:23:20,438 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:20,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-01-31 08:23:20,441 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:20,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-01-31 08:23:20,443 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:20,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-01-31 08:23:20,522 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:20,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-01-31 08:23:20,635 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-31 08:23:20,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2018-01-31 08:23:20,720 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-31 08:23:20,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-01-31 08:23:20,804 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:20,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-01-31 08:23:20,815 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:20,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-31 08:23:20,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-31 08:23:20,972 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-01-31 08:23:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:21,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:23:21,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 32 [2018-01-31 08:23:21,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 08:23:21,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 08:23:21,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:23:21,140 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 33 states. [2018-01-31 08:23:29,295 WARN L146 SmtUtils]: Spent 4104ms on a formula simplification. DAG size of input: 90 DAG size of output 73 [2018-01-31 08:23:29,579 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 90 DAG size of output 70 [2018-01-31 08:23:38,508 WARN L146 SmtUtils]: Spent 5650ms on a formula simplification. DAG size of input: 88 DAG size of output 71 [2018-01-31 08:23:38,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:38,642 INFO L93 Difference]: Finished difference Result 219 states and 232 transitions. [2018-01-31 08:23:38,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-31 08:23:38,642 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-01-31 08:23:38,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:38,644 INFO L225 Difference]: With dead ends: 219 [2018-01-31 08:23:38,644 INFO L226 Difference]: Without dead ends: 217 [2018-01-31 08:23:38,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=484, Invalid=2706, Unknown=2, NotChecked=0, Total=3192 [2018-01-31 08:23:38,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-31 08:23:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 153. [2018-01-31 08:23:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-31 08:23:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2018-01-31 08:23:38,664 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 53 [2018-01-31 08:23:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:38,664 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2018-01-31 08:23:38,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 08:23:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2018-01-31 08:23:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-31 08:23:38,665 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:38,665 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:38,666 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1117583367, now seen corresponding path program 2 times [2018-01-31 08:23:38,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:38,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:38,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:38,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:38,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:38,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:39,259 WARN L146 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 17 DAG size of output 13 [2018-01-31 08:23:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:39,576 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:23:39,576 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:23:39,582 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:23:39,595 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:23:39,603 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:23:39,605 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:23:39,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:23:39,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:23:39,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:39,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:39,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:23:39,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:23:39,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-31 08:23:39,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:39,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:39,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:39,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-31 08:23:39,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-31 08:23:40,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:23:40,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:23:40,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:23:40,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:23:40,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-31 08:23:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:40,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:23:40,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-01-31 08:23:40,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 08:23:40,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 08:23:40,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:23:40,248 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand 25 states. [2018-01-31 08:23:42,162 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 73 DAG size of output 59 [2018-01-31 08:23:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:42,244 INFO L93 Difference]: Finished difference Result 213 states and 226 transitions. [2018-01-31 08:23:42,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-31 08:23:42,244 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-01-31 08:23:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:42,245 INFO L225 Difference]: With dead ends: 213 [2018-01-31 08:23:42,245 INFO L226 Difference]: Without dead ends: 205 [2018-01-31 08:23:42,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=324, Invalid=1568, Unknown=0, NotChecked=0, Total=1892 [2018-01-31 08:23:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-31 08:23:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2018-01-31 08:23:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-31 08:23:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-01-31 08:23:42,258 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 63 [2018-01-31 08:23:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:42,258 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-01-31 08:23:42,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 08:23:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-01-31 08:23:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-31 08:23:42,259 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:42,259 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:42,259 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash 874834182, now seen corresponding path program 2 times [2018-01-31 08:23:42,260 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:42,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:42,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:42,260 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:23:42,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:42,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:42,798 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 22 DAG size of output 13 [2018-01-31 08:23:43,062 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:43,062 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:23:43,062 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:23:43,067 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:23:43,081 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:23:43,109 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:23:43,119 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:23:43,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:23:43,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:23:43,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:23:43,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:23:43,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:23:43,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:23:43,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:23:43,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-31 08:23:43,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-31 08:23:43,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:23:43,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-31 08:23:43,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-31 08:23:43,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-31 08:23:43,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-31 08:23:43,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:43,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-31 08:23:44,698 WARN L143 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:23:45,476 WARN L143 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-31 08:23:45,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-31 08:23:45,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-31 08:23:45,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:45,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:23:45,867 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:23:45,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:23:45,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:23:45,891 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-01-31 08:23:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:23:46,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:23:46,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 39 [2018-01-31 08:23:46,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-31 08:23:46,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-31 08:23:46,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 08:23:46,207 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 40 states. [2018-01-31 08:23:47,469 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 96 DAG size of output 79 [2018-01-31 08:23:47,626 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 96 DAG size of output 75 [2018-01-31 08:23:48,971 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 112 DAG size of output 85 [2018-01-31 08:23:50,000 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 122 DAG size of output 84 [2018-01-31 08:23:50,704 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 120 DAG size of output 81 [2018-01-31 08:23:50,981 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 126 DAG size of output 83 [2018-01-31 08:23:51,224 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 134 DAG size of output 95 [2018-01-31 08:23:51,402 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 129 DAG size of output 93 [2018-01-31 08:23:52,031 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 115 DAG size of output 83 [2018-01-31 08:23:52,504 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 120 DAG size of output 85 [2018-01-31 08:23:53,251 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 118 DAG size of output 82 [2018-01-31 08:23:53,426 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 127 DAG size of output 84 [2018-01-31 08:23:53,622 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 127 DAG size of output 84 [2018-01-31 08:23:53,796 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 116 DAG size of output 81 [2018-01-31 08:23:53,990 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 135 DAG size of output 96 [2018-01-31 08:23:55,558 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 110 DAG size of output 83 [2018-01-31 08:23:55,733 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 108 DAG size of output 80 [2018-01-31 08:23:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:23:56,195 INFO L93 Difference]: Finished difference Result 240 states and 252 transitions. [2018-01-31 08:23:56,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-31 08:23:56,195 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2018-01-31 08:23:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:23:56,197 INFO L225 Difference]: With dead ends: 240 [2018-01-31 08:23:56,197 INFO L226 Difference]: Without dead ends: 238 [2018-01-31 08:23:56,200 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1607, Invalid=9735, Unknown=0, NotChecked=0, Total=11342 [2018-01-31 08:23:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-31 08:23:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 129. [2018-01-31 08:23:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-31 08:23:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-01-31 08:23:56,222 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 77 [2018-01-31 08:23:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:23:56,223 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-01-31 08:23:56,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-31 08:23:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-01-31 08:23:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-31 08:23:56,224 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:23:56,224 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:23:56,225 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:23:56,225 INFO L82 PathProgramCache]: Analyzing trace with hash -683356349, now seen corresponding path program 1 times [2018-01-31 08:23:56,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:23:56,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:23:56,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:56,226 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:23:56,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:23:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:56,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:23:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-31 08:23:56,980 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:23:56,980 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:23:56,985 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:23:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:23:57,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:23:57,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:23:57,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:23:57,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:23:57,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:23:57,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:23:57,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:23:57,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-31 08:23:57,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-31 08:23:57,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:23:57,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-31 08:23:57,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:23:57,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-31 08:23:57,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-31 08:23:57,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-31 08:23:57,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:23:57,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 08:23:57,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-31 08:24:00,392 WARN L143 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 46 [2018-01-31 08:24:00,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-01-31 08:24:00,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-01-31 08:24:00,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:24:00,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2018-01-31 08:24:00,604 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:24:00,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-01-31 08:24:00,649 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:24:00,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 39 [2018-01-31 08:24:00,702 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-31 08:24:00,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 36 [2018-01-31 08:24:00,775 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-31 08:24:00,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-01-31 08:24:00,861 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-01-31 08:24:00,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-01-31 08:24:00,955 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-31 08:24:00,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2018-01-31 08:24:00,957 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-31 08:24:01,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-01-31 08:24:01,045 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-31 08:24:01,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-01-31 08:24:01,047 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-31 08:24:01,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-31 08:24:01,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-31 08:24:01,159 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:67, output treesize:106 [2018-01-31 08:24:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 81 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:24:01,691 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:24:01,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 39 [2018-01-31 08:24:01,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-31 08:24:01,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-31 08:24:01,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1401, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 08:24:01,710 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 40 states. [2018-01-31 08:24:02,363 WARN L146 SmtUtils]: Spent 305ms on a formula simplification. DAG size of input: 51 DAG size of output 43 [2018-01-31 08:24:04,951 WARN L146 SmtUtils]: Spent 2312ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-01-31 08:24:08,106 WARN L146 SmtUtils]: Spent 3049ms on a formula simplification. DAG size of input: 73 DAG size of output 61 [2018-01-31 08:24:09,447 WARN L146 SmtUtils]: Spent 1187ms on a formula simplification. DAG size of input: 67 DAG size of output 55 [2018-01-31 08:24:11,742 WARN L146 SmtUtils]: Spent 2091ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-01-31 08:24:13,970 WARN L146 SmtUtils]: Spent 2151ms on a formula simplification. DAG size of input: 74 DAG size of output 61 [2018-01-31 08:24:16,528 WARN L146 SmtUtils]: Spent 2354ms on a formula simplification. DAG size of input: 67 DAG size of output 55 [2018-01-31 08:24:18,689 WARN L146 SmtUtils]: Spent 2111ms on a formula simplification. DAG size of input: 59 DAG size of output 48 [2018-01-31 08:24:20,066 WARN L146 SmtUtils]: Spent 1323ms on a formula simplification. DAG size of input: 62 DAG size of output 51 [2018-01-31 08:24:20,487 WARN L146 SmtUtils]: Spent 215ms on a formula simplification. DAG size of input: 62 DAG size of output 51 [2018-01-31 08:24:23,525 WARN L146 SmtUtils]: Spent 2936ms on a formula simplification. DAG size of input: 68 DAG size of output 57 [2018-01-31 08:24:28,697 WARN L146 SmtUtils]: Spent 5113ms on a formula simplification. DAG size of input: 75 DAG size of output 64 [2018-01-31 08:24:31,352 WARN L146 SmtUtils]: Spent 2599ms on a formula simplification. DAG size of input: 75 DAG size of output 61 [2018-01-31 08:24:35,276 WARN L146 SmtUtils]: Spent 3802ms on a formula simplification. DAG size of input: 70 DAG size of output 59 [2018-01-31 08:24:39,862 WARN L146 SmtUtils]: Spent 2422ms on a formula simplification. DAG size of input: 68 DAG size of output 57 [2018-01-31 08:24:42,050 WARN L146 SmtUtils]: Spent 2112ms on a formula simplification. DAG size of input: 75 DAG size of output 60 [2018-01-31 08:24:46,572 WARN L146 SmtUtils]: Spent 4138ms on a formula simplification. DAG size of input: 85 DAG size of output 69 [2018-01-31 08:24:50,441 WARN L146 SmtUtils]: Spent 3812ms on a formula simplification. DAG size of input: 76 DAG size of output 62 [2018-01-31 08:24:52,709 WARN L146 SmtUtils]: Spent 2139ms on a formula simplification. DAG size of input: 59 DAG size of output 49 [2018-01-31 08:24:54,907 WARN L146 SmtUtils]: Spent 2135ms on a formula simplification. DAG size of input: 69 DAG size of output 56 [2018-01-31 08:24:55,115 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 61 DAG size of output 49 [2018-01-31 08:24:55,299 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 64 DAG size of output 52 [2018-01-31 08:24:55,493 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 66 DAG size of output 54 [2018-01-31 08:24:55,719 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 64 DAG size of output 52 [2018-01-31 08:24:55,930 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 70 DAG size of output 58 [2018-01-31 08:25:00,167 WARN L146 SmtUtils]: Spent 4156ms on a formula simplification. DAG size of input: 77 DAG size of output 65 [2018-01-31 08:25:02,385 WARN L146 SmtUtils]: Spent 2140ms on a formula simplification. DAG size of input: 77 DAG size of output 62 [2018-01-31 08:25:02,959 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-01-31 08:25:06,920 WARN L146 SmtUtils]: Spent 1929ms on a formula simplification. DAG size of input: 70 DAG size of output 58 [2018-01-31 08:25:07,196 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 75 DAG size of output 60 [2018-01-31 08:25:07,460 WARN L146 SmtUtils]: Spent 192ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-01-31 08:25:09,277 WARN L146 SmtUtils]: Spent 1703ms on a formula simplification. DAG size of input: 87 DAG size of output 70 [2018-01-31 08:25:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:25:09,296 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-01-31 08:25:09,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-31 08:25:09,296 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2018-01-31 08:25:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:25:09,297 INFO L225 Difference]: With dead ends: 182 [2018-01-31 08:25:09,297 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:25:09,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 68.8s TimeCoverageRelationStatistics Valid=1312, Invalid=5660, Unknown=0, NotChecked=0, Total=6972 [2018-01-31 08:25:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:25:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:25:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:25:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:25:09,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2018-01-31 08:25:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:25:09,300 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:25:09,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-31 08:25:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:25:09,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:25:09,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:25:09,435 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:25:09,476 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:25:09,999 WARN L146 SmtUtils]: Spent 636ms on a formula simplification. DAG size of input: 290 DAG size of output 282 [2018-01-31 08:25:10,017 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:25:10,020 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:25:10,025 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:25:10,031 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-31 08:25:10,358 WARN L146 SmtUtils]: Spent 357ms on a formula simplification. DAG size of input: 276 DAG size of output 262 [2018-01-31 08:25:11,216 WARN L146 SmtUtils]: Spent 853ms on a formula simplification. DAG size of input: 92 DAG size of output 60 [2018-01-31 08:25:24,854 WARN L146 SmtUtils]: Spent 13597ms on a formula simplification. DAG size of input: 308 DAG size of output 184 Received shutdown request... [2018-01-31 08:25:38,533 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-01-31 08:25:38,535 INFO L168 Benchmark]: Toolchain (without parser) took 154194.67 ms. Allocated memory was 306.7 MB in the beginning and 641.7 MB in the end (delta: 335.0 MB). Free memory was 265.6 MB in the beginning and 490.8 MB in the end (delta: -225.2 MB). Peak memory consumption was 320.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:25:38,536 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 306.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:25:38,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.18 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:25:38,536 INFO L168 Benchmark]: Boogie Preprocessor took 39.93 ms. Allocated memory is still 306.7 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:25:38,536 INFO L168 Benchmark]: RCFGBuilder took 660.37 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 230.6 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:25:38,537 INFO L168 Benchmark]: TraceAbstraction took 153179.80 ms. Allocated memory was 306.7 MB in the beginning and 641.7 MB in the end (delta: 335.0 MB). Free memory was 230.6 MB in the beginning and 490.8 MB in the end (delta: -260.2 MB). Peak memory consumption was 285.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:25:38,542 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 306.7 MB. Free memory is still 271.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 302.18 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 255.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.93 ms. Allocated memory is still 306.7 MB. Free memory was 255.5 MB in the beginning and 253.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 660.37 ms. Allocated memory is still 306.7 MB. Free memory was 253.5 MB in the beginning and 230.6 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 153179.80 ms. Allocated memory was 306.7 MB in the beginning and 641.7 MB in the end (delta: 335.0 MB). Free memory was 230.6 MB in the beginning and 490.8 MB in the end (delta: -260.2 MB). Peak memory consumption was 285.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 290. RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-25-38-549.csv Completed graceful shutdown