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-acfac67 [2018-01-28 21:04:32,534 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:04:32,536 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:04:32,552 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:04:32,552 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:04:32,553 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:04:32,554 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:04:32,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:04:32,558 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:04:32,559 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:04:32,560 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:04:32,560 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:04:32,561 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:04:32,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:04:32,563 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:04:32,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:04:32,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:04:32,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:04:32,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:04:32,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:04:32,575 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:04:32,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:04:32,576 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:04:32,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:04:32,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:04:32,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:04:32,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:04:32,580 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:04:32,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:04:32,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:04:32,581 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:04:32,581 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-28 21:04:32,590 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:04:32,590 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:04:32,591 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:04:32,591 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:04:32,591 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:04:32,591 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:04:32,591 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:04:32,592 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:04:32,592 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:04:32,592 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:04:32,592 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:04:32,592 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:04:32,592 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:04:32,593 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:04:32,593 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:04:32,593 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:04:32,593 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:04:32,593 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:04:32,593 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:04:32,593 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:04:32,593 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:04:32,594 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:04:32,594 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:04:32,594 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:04:32,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:04:32,594 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:04:32,595 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:04:32,595 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:04:32,595 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:04:32,595 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:04:32,595 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:04:32,595 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:04:32,596 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:04:32,596 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:04:32,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:04:32,639 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:04:32,642 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:04:32,644 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:04:32,644 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:04:32,645 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-28 21:04:32,835 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:04:32,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:04:32,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:04:32,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:04:32,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:04:32,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:04:32" (1/1) ... [2018-01-28 21:04:32,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f82e41d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:32, skipping insertion in model container [2018-01-28 21:04:32,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:04:32" (1/1) ... [2018-01-28 21:04:32,866 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:04:32,903 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:04:33,021 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:04:33,045 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:04:33,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33 WrapperNode [2018-01-28 21:04:33,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:04:33,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:04:33,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:04:33,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:04:33,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33" (1/1) ... [2018-01-28 21:04:33,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33" (1/1) ... [2018-01-28 21:04:33,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33" (1/1) ... [2018-01-28 21:04:33,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33" (1/1) ... [2018-01-28 21:04:33,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33" (1/1) ... [2018-01-28 21:04:33,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33" (1/1) ... [2018-01-28 21:04:33,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33" (1/1) ... [2018-01-28 21:04:33,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:04:33,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:04:33,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:04:33,095 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:04:33,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33" (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-28 21:04:33,149 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:04:33,150 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:04:33,150 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-28 21:04:33,150 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:04:33,150 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:04:33,150 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:04:33,151 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:04:33,151 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:04:33,151 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:04:33,151 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:04:33,151 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-28 21:04:33,151 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:04:33,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:04:33,152 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:04:33,445 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:04:33,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:04:33 BoogieIcfgContainer [2018-01-28 21:04:33,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:04:33,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:04:33,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:04:33,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:04:33,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:04:32" (1/3) ... [2018-01-28 21:04:33,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adc28e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:04:33, skipping insertion in model container [2018-01-28 21:04:33,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:04:33" (2/3) ... [2018-01-28 21:04:33,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adc28e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:04:33, skipping insertion in model container [2018-01-28 21:04:33,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:04:33" (3/3) ... [2018-01-28 21:04:33,451 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:04:33,458 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:04:33,463 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-28 21:04:33,509 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:04:33,509 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:04:33,509 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:04:33,509 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:04:33,509 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:04:33,509 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:04:33,510 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:04:33,510 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:04:33,511 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:04:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-01-28 21:04:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:04:33,539 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:33,540 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:04:33,540 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:33,545 INFO L82 PathProgramCache]: Analyzing trace with hash 328973023, now seen corresponding path program 1 times [2018-01-28 21:04:33,547 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:33,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:33,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:33,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:33,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:33,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:33,800 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-28 21:04:33,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:33,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:04:33,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:04:33,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:04:33,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:04:33,890 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-01-28 21:04:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:34,024 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2018-01-28 21:04:34,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:04:34,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:04:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:34,037 INFO L225 Difference]: With dead ends: 147 [2018-01-28 21:04:34,038 INFO L226 Difference]: Without dead ends: 86 [2018-01-28 21:04:34,041 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:04:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-28 21:04:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-28 21:04:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 21:04:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-28 21:04:34,084 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 19 [2018-01-28 21:04:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:34,084 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-28 21:04:34,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:04:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-28 21:04:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:04:34,085 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:34,086 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:04:34,086 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:34,086 INFO L82 PathProgramCache]: Analyzing trace with hash 328973024, now seen corresponding path program 1 times [2018-01-28 21:04:34,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:34,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:34,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:34,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:34,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:34,243 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-28 21:04:34,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:34,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:04:34,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:04:34,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:04:34,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:04:34,247 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 6 states. [2018-01-28 21:04:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:34,321 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-28 21:04:34,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:04:34,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-28 21:04:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:34,323 INFO L225 Difference]: With dead ends: 86 [2018-01-28 21:04:34,324 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:04:34,324 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:04:34,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:04:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-28 21:04:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:04:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-01-28 21:04:34,332 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 19 [2018-01-28 21:04:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:34,332 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-01-28 21:04:34,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:04:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-01-28 21:04:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:04:34,333 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:34,333 INFO L330 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-28 21:04:34,333 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1608229205, now seen corresponding path program 1 times [2018-01-28 21:04:34,334 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:34,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:34,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:34,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:34,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:34,393 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-28 21:04:34,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:34,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:04:34,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:04:34,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:04:34,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:04:34,395 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 4 states. [2018-01-28 21:04:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:34,473 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-01-28 21:04:34,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:04:34,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 21:04:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:34,475 INFO L225 Difference]: With dead ends: 85 [2018-01-28 21:04:34,475 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 21:04:34,476 INFO L533 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-28 21:04:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 21:04:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-28 21:04:34,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 21:04:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-28 21:04:34,485 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 20 [2018-01-28 21:04:34,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:34,485 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-28 21:04:34,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:04:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-28 21:04:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:04:34,486 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:34,486 INFO L330 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-28 21:04:34,487 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1608229206, now seen corresponding path program 1 times [2018-01-28 21:04:34,487 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:34,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:34,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:34,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:34,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:34,556 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-28 21:04:34,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:34,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:04:34,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:04:34,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:04:34,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:04:34,557 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 5 states. [2018-01-28 21:04:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:34,625 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-28 21:04:34,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:04:34,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-28 21:04:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:34,626 INFO L225 Difference]: With dead ends: 84 [2018-01-28 21:04:34,626 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 21:04:34,626 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:04:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 21:04:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-28 21:04:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 21:04:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-28 21:04:34,632 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 20 [2018-01-28 21:04:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:34,633 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-28 21:04:34,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:04:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-28 21:04:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 21:04:34,634 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:34,634 INFO L330 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-28 21:04:34,634 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:34,634 INFO L82 PathProgramCache]: Analyzing trace with hash -39877229, now seen corresponding path program 1 times [2018-01-28 21:04:34,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:34,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:34,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:34,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:34,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:34,708 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-28 21:04:34,708 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:34,708 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:04:34,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:04:34,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:04:34,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:04:34,709 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 6 states. [2018-01-28 21:04:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:34,810 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-28 21:04:34,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:04:34,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-28 21:04:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:34,812 INFO L225 Difference]: With dead ends: 87 [2018-01-28 21:04:34,812 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:04:34,813 INFO L533 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-28 21:04:34,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:04:34,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-01-28 21:04:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 21:04:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-28 21:04:34,821 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 29 [2018-01-28 21:04:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:34,822 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-28 21:04:34,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:04:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-28 21:04:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 21:04:34,823 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:34,823 INFO L330 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-28 21:04:34,823 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:34,824 INFO L82 PathProgramCache]: Analyzing trace with hash -39877228, now seen corresponding path program 1 times [2018-01-28 21:04:34,824 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:34,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:34,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:34,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:34,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:34,980 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-28 21:04:34,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:34,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:04:34,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:04:34,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:04:34,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:04:34,982 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 9 states. [2018-01-28 21:04:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:35,148 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-01-28 21:04:35,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:04:35,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-28 21:04:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:35,153 INFO L225 Difference]: With dead ends: 125 [2018-01-28 21:04:35,153 INFO L226 Difference]: Without dead ends: 123 [2018-01-28 21:04:35,154 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:04:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-28 21:04:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 88. [2018-01-28 21:04:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 21:04:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-01-28 21:04:35,163 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 29 [2018-01-28 21:04:35,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:35,164 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-01-28 21:04:35,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:04:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-01-28 21:04:35,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:04:35,165 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:35,165 INFO L330 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-28 21:04:35,166 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:35,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1160902392, now seen corresponding path program 1 times [2018-01-28 21:04:35,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:35,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:35,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:35,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:35,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:35,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:35,238 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-28 21:04:35,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:35,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:04:35,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:04:35,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:04:35,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:04:35,240 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 6 states. [2018-01-28 21:04:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:35,368 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-01-28 21:04:35,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:04:35,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-01-28 21:04:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:35,370 INFO L225 Difference]: With dead ends: 96 [2018-01-28 21:04:35,370 INFO L226 Difference]: Without dead ends: 93 [2018-01-28 21:04:35,370 INFO L533 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-28 21:04:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-28 21:04:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-01-28 21:04:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 21:04:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-01-28 21:04:35,385 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 37 [2018-01-28 21:04:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:35,385 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-01-28 21:04:35,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:04:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-01-28 21:04:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-28 21:04:35,386 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:35,386 INFO L330 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-28 21:04:35,386 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1160902393, now seen corresponding path program 1 times [2018-01-28 21:04:35,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:35,386 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:35,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:35,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:35,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:35,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:35,574 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-28 21:04:35,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:35,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:04:35,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:04:35,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:04:35,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:04:35,576 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 9 states. [2018-01-28 21:04:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:35,821 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2018-01-28 21:04:35,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:04:35,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-01-28 21:04:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:35,822 INFO L225 Difference]: With dead ends: 123 [2018-01-28 21:04:35,822 INFO L226 Difference]: Without dead ends: 120 [2018-01-28 21:04:35,822 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:04:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-28 21:04:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2018-01-28 21:04:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-28 21:04:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-28 21:04:35,831 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 37 [2018-01-28 21:04:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:35,831 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-28 21:04:35,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:04:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-28 21:04:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:04:35,833 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:35,833 INFO L330 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-28 21:04:35,833 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:35,833 INFO L82 PathProgramCache]: Analyzing trace with hash -442191989, now seen corresponding path program 1 times [2018-01-28 21:04:35,834 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:35,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:35,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:35,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:35,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:35,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:35,987 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-28 21:04:35,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:35,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:04:35,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:04:35,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:04:35,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:04:35,988 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 6 states. [2018-01-28 21:04:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:36,237 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2018-01-28 21:04:36,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:04:36,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-01-28 21:04:36,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:36,238 INFO L225 Difference]: With dead ends: 97 [2018-01-28 21:04:36,239 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 21:04:36,239 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:04:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 21:04:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-28 21:04:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 21:04:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-28 21:04:36,246 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 41 [2018-01-28 21:04:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:36,246 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-28 21:04:36,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:04:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-28 21:04:36,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 21:04:36,248 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:36,248 INFO L330 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-28 21:04:36,249 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:36,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1890808931, now seen corresponding path program 1 times [2018-01-28 21:04:36,249 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:36,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:36,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:36,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:36,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:36,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:36,294 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-28 21:04:36,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:36,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:04:36,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:04:36,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:04:36,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:04:36,295 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 3 states. [2018-01-28 21:04:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:36,307 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-01-28 21:04:36,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:04:36,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-01-28 21:04:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:36,309 INFO L225 Difference]: With dead ends: 133 [2018-01-28 21:04:36,309 INFO L226 Difference]: Without dead ends: 85 [2018-01-28 21:04:36,310 INFO L533 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-28 21:04:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-28 21:04:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-28 21:04:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 21:04:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-28 21:04:36,317 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 48 [2018-01-28 21:04:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:36,318 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-28 21:04:36,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:04:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-28 21:04:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:04:36,319 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:36,319 INFO L330 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-28 21:04:36,319 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:36,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1028999776, now seen corresponding path program 1 times [2018-01-28 21:04:36,320 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:36,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:36,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:36,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:36,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:36,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:36,419 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-28 21:04:36,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:36,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:04:36,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:04:36,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:04:36,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:04:36,421 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 7 states. [2018-01-28 21:04:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:36,508 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-01-28 21:04:36,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:04:36,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-01-28 21:04:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:36,510 INFO L225 Difference]: With dead ends: 85 [2018-01-28 21:04:36,510 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 21:04:36,510 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:04:36,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 21:04:36,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-28 21:04:36,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 21:04:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-28 21:04:36,516 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 50 [2018-01-28 21:04:36,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:36,517 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-28 21:04:36,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:04:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-28 21:04:36,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:04:36,518 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:36,518 INFO L330 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-28 21:04:36,518 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:36,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1028999775, now seen corresponding path program 1 times [2018-01-28 21:04:36,519 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:36,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:36,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:36,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:36,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:36,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:36,847 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-28 21:04:36,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:36,847 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-28 21:04:36,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:36,899 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:36,964 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-28 21:04:36,968 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-28 21:04:36,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:36,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:36,990 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-28 21:04:36,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 21:04:37,186 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-28 21:04:37,196 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-28 21:04:37,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:04:37,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:04:37,231 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-28 21:04:37,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-28 21:04:37,446 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-28 21:04:37,471 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:37,471 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2018-01-28 21:04:37,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-28 21:04:37,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-28 21:04:37,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-01-28 21:04:37,472 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 22 states. [2018-01-28 21:04:39,332 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 62 DAG size of output 52 [2018-01-28 21:04:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:39,533 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2018-01-28 21:04:39,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 21:04:39,534 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-01-28 21:04:39,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:39,536 INFO L225 Difference]: With dead ends: 199 [2018-01-28 21:04:39,536 INFO L226 Difference]: Without dead ends: 196 [2018-01-28 21:04:39,537 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=319, Invalid=1403, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 21:04:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-28 21:04:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 97. [2018-01-28 21:04:39,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-28 21:04:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-01-28 21:04:39,547 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 50 [2018-01-28 21:04:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:39,547 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-01-28 21:04:39,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-28 21:04:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-01-28 21:04:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-28 21:04:39,548 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:39,548 INFO L330 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-28 21:04:39,548 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1520251311, now seen corresponding path program 1 times [2018-01-28 21:04:39,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:39,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:39,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:39,550 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:39,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:39,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:39,637 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-28 21:04:39,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:39,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 21:04:39,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:04:39,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:04:39,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:04:39,638 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 10 states. [2018-01-28 21:04:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:39,822 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2018-01-28 21:04:39,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:04:39,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-01-28 21:04:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:39,824 INFO L225 Difference]: With dead ends: 170 [2018-01-28 21:04:39,824 INFO L226 Difference]: Without dead ends: 102 [2018-01-28 21:04:39,825 INFO L533 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-28 21:04:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-28 21:04:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-01-28 21:04:39,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-28 21:04:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-28 21:04:39,834 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 51 [2018-01-28 21:04:39,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:39,835 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-28 21:04:39,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:04:39,835 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-28 21:04:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-28 21:04:39,836 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:39,836 INFO L330 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-28 21:04:39,836 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:39,836 INFO L82 PathProgramCache]: Analyzing trace with hash 362292428, now seen corresponding path program 1 times [2018-01-28 21:04:39,836 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:39,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:39,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:39,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:39,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:39,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:39,909 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-28 21:04:39,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:04:39,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:04:39,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:04:39,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:04:39,910 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:04:39,911 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 7 states. [2018-01-28 21:04:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:40,016 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-01-28 21:04:40,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:04:40,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-01-28 21:04:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:40,017 INFO L225 Difference]: With dead ends: 100 [2018-01-28 21:04:40,017 INFO L226 Difference]: Without dead ends: 99 [2018-01-28 21:04:40,017 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:04:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-28 21:04:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-01-28 21:04:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 21:04:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2018-01-28 21:04:40,027 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 53 [2018-01-28 21:04:40,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:40,027 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2018-01-28 21:04:40,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:04:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2018-01-28 21:04:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-28 21:04:40,028 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:40,028 INFO L330 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-28 21:04:40,028 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:40,028 INFO L82 PathProgramCache]: Analyzing trace with hash 362292429, now seen corresponding path program 1 times [2018-01-28 21:04:40,029 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:40,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:40,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:40,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:40,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:40,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:40,338 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-28 21:04:40,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:40,338 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-28 21:04:40,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:40,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:40,377 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-28 21:04:40,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:40,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:40,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:04:40,408 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:40,409 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:04:40,411 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-28 21:04:40,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:40,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:40,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 21:04:40,445 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-28 21:04:40,447 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-28 21:04:40,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:40,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:40,454 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-28 21:04:40,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-28 21:04:40,478 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-28 21:04:40,480 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-28 21:04:40,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:40,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:40,491 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-28 21:04:40,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-28 21:04:42,934 WARN L143 SmtUtils]: Spent 2035ms on a formula simplification that was a NOOP. DAG size: 46 [2018-01-28 21:04:43,012 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-28 21:04:43,033 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-28 21:04:43,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-01-28 21:04:43,119 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-28 21:04:43,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-28 21:04:43,204 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-28 21:04:43,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,281 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-28 21:04:43,281 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,283 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-28 21:04:43,284 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,285 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-28 21:04:43,286 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,361 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-28 21:04:43,362 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,442 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-28 21:04:43,443 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-01-28 21:04:43,520 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-28 21:04:43,521 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-01-28 21:04:43,598 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-28 21:04:43,598 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,600 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-28 21:04:43,601 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:43,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-28 21:04:43,709 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-28 21:04:43,709 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-01-28 21:04:43,835 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-28 21:04:43,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:43,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 21] total 32 [2018-01-28 21:04:43,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 21:04:43,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 21:04:43,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:04:43,866 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 33 states. [2018-01-28 21:04:50,384 WARN L146 SmtUtils]: Spent 4136ms on a formula simplification. DAG size of input: 90 DAG size of output 73 [2018-01-28 21:04:58,109 WARN L146 SmtUtils]: Spent 5415ms on a formula simplification. DAG size of input: 88 DAG size of output 71 [2018-01-28 21:04:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:04:58,240 INFO L93 Difference]: Finished difference Result 219 states and 232 transitions. [2018-01-28 21:04:58,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-28 21:04:58,241 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-01-28 21:04:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:04:58,242 INFO L225 Difference]: With dead ends: 219 [2018-01-28 21:04:58,242 INFO L226 Difference]: Without dead ends: 217 [2018-01-28 21:04:58,244 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=486, Invalid=2706, Unknown=0, NotChecked=0, Total=3192 [2018-01-28 21:04:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-01-28 21:04:58,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 153. [2018-01-28 21:04:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-28 21:04:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2018-01-28 21:04:58,264 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 53 [2018-01-28 21:04:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:04:58,264 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2018-01-28 21:04:58,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 21:04:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2018-01-28 21:04:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-28 21:04:58,265 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:04:58,266 INFO L330 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-28 21:04:58,266 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:04:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1117583367, now seen corresponding path program 2 times [2018-01-28 21:04:58,266 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:04:58,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:04:58,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:58,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:04:58,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:04:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:04:58,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:04:58,605 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-28 21:04:58,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:04:58,606 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-28 21:04:58,611 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:04:58,623 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:04:58,629 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:04:58,631 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:04:58,634 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:04:58,637 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-28 21:04:58,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:58,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:58,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:04:58,679 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-28 21:04:58,681 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-28 21:04:58,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:04:58,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:58,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:04:58,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-28 21:04:58,877 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-28 21:04:58,908 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-28 21:04:58,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:04:58,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:04:58,921 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-28 21:04:58,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49 [2018-01-28 21:04:59,020 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-28 21:04:59,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:04:59,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-01-28 21:04:59,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 21:04:59,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 21:04:59,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-01-28 21:04:59,041 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand 25 states. [2018-01-28 21:05:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:05:00,432 INFO L93 Difference]: Finished difference Result 213 states and 226 transitions. [2018-01-28 21:05:00,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 21:05:00,432 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 63 [2018-01-28 21:05:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:05:00,434 INFO L225 Difference]: With dead ends: 213 [2018-01-28 21:05:00,434 INFO L226 Difference]: Without dead ends: 205 [2018-01-28 21:05:00,435 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=324, Invalid=1568, Unknown=0, NotChecked=0, Total=1892 [2018-01-28 21:05:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-28 21:05:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2018-01-28 21:05:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-28 21:05:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-01-28 21:05:00,443 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 63 [2018-01-28 21:05:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:05:00,443 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-01-28 21:05:00,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 21:05:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-01-28 21:05:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-28 21:05:00,444 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:05:00,444 INFO L330 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-28 21:05:00,444 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:05:00,444 INFO L82 PathProgramCache]: Analyzing trace with hash 874834182, now seen corresponding path program 2 times [2018-01-28 21:05:00,444 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:05:00,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:05:00,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:05:00,445 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:05:00,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:05:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:05:00,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:05:01,002 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-28 21:05:01,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:05:01,002 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-28 21:05:01,008 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:05:01,022 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:05:01,045 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:05:01,050 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:05:01,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:05:01,071 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-28 21:05:01,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,106 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-28 21:05:01,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:05:01,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:05:01,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:05:01,185 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-28 21:05:01,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,195 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-28 21:05:01,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-28 21:05:01,268 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-28 21:05:01,270 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-28 21:05:01,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-28 21:05:01,312 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-28 21:05:01,314 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-28 21:05:01,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:01,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-28 21:05:02,119 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-28 21:05:02,122 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-28 21:05:02,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:02,171 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-28 21:05:02,172 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:05:02,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:05:02,240 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-28 21:05:02,240 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-01-28 21:05:02,549 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-28 21:05:02,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:05:02,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 39 [2018-01-28 21:05:02,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-28 21:05:02,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-28 21:05:02,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 21:05:02,574 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 40 states. [2018-01-28 21:05:03,668 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 96 DAG size of output 79 [2018-01-28 21:05:06,007 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 122 DAG size of output 84 [2018-01-28 21:05:06,743 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 120 DAG size of output 81 [2018-01-28 21:05:07,238 WARN L146 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 126 DAG size of output 83 [2018-01-28 21:05:07,511 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 134 DAG size of output 95 [2018-01-28 21:05:07,680 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 129 DAG size of output 93 [2018-01-28 21:05:08,726 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 120 DAG size of output 85 [2018-01-28 21:05:09,303 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 118 DAG size of output 82 [2018-01-28 21:05:09,473 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 127 DAG size of output 84 [2018-01-28 21:05:09,656 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 127 DAG size of output 84 [2018-01-28 21:05:09,981 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 135 DAG size of output 96 [2018-01-28 21:05:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:05:12,019 INFO L93 Difference]: Finished difference Result 240 states and 252 transitions. [2018-01-28 21:05:12,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-28 21:05:12,019 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2018-01-28 21:05:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:05:12,021 INFO L225 Difference]: With dead ends: 240 [2018-01-28 21:05:12,021 INFO L226 Difference]: Without dead ends: 238 [2018-01-28 21:05:12,024 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1607, Invalid=9735, Unknown=0, NotChecked=0, Total=11342 [2018-01-28 21:05:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-28 21:05:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 129. [2018-01-28 21:05:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-28 21:05:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2018-01-28 21:05:12,047 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 77 [2018-01-28 21:05:12,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:05:12,047 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2018-01-28 21:05:12,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-28 21:05:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2018-01-28 21:05:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-01-28 21:05:12,049 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:05:12,049 INFO L330 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-28 21:05:12,049 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:05:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash -683356349, now seen corresponding path program 1 times [2018-01-28 21:05:12,049 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:05:12,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:05:12,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:05:12,050 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:05:12,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:05:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:05:12,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:05:12,505 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-28 21:05:12,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:05:12,505 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-28 21:05:12,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:05:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:05:12,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:05:12,563 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-28 21:05:12,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,574 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-28 21:05:12,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:05:12,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:05:12,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:05:12,623 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-28 21:05:12,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,633 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-28 21:05:12,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-28 21:05:12,687 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-28 21:05:12,688 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-28 21:05:12,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,696 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-28 21:05:12,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-28 21:05:12,730 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-28 21:05:12,732 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-28 21:05:12,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:05:12,743 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-28 21:05:12,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-28 21:05:17,023 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 46 [2018-01-28 21:05:17,104 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-28 21:05:17,109 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-28 21:05:17,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:17,159 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-28 21:05:17,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:05:17,201 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-28 21:05:17,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:17,250 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-28 21:05:17,251 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-01-28 21:05:17,316 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-28 21:05:17,317 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-28 21:05:17,394 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-28 21:05:17,395 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-01-28 21:05:17,481 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-28 21:05:17,481 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:17,482 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-28 21:05:17,482 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:17,562 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-28 21:05:17,562 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:17,564 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-28 21:05:17,564 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 21:05:17,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-28 21:05:17,667 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-28 21:05:17,667 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:67, output treesize:106 [2018-01-28 21:05:17,922 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-28 21:05:18,025 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:05:18,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25] total 39 [2018-01-28 21:05:18,026 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-28 21:05:18,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-28 21:05:18,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1401, Unknown=0, NotChecked=0, Total=1560 [2018-01-28 21:05:18,026 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 40 states. [2018-01-28 21:05:19,571 WARN L146 SmtUtils]: Spent 1125ms on a formula simplification. DAG size of input: 63 DAG size of output 54 [2018-01-28 21:05:20,341 WARN L146 SmtUtils]: Spent 591ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-01-28 21:05:22,719 WARN L146 SmtUtils]: Spent 2287ms on a formula simplification. DAG size of input: 73 DAG size of output 61 [2018-01-28 21:05:24,810 WARN L146 SmtUtils]: Spent 2045ms on a formula simplification. DAG size of input: 56 DAG size of output 48 [2018-01-28 21:05:30,121 WARN L146 SmtUtils]: Spent 5265ms on a formula simplification. DAG size of input: 67 DAG size of output 55 [2018-01-28 21:05:30,408 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-01-28 21:05:31,815 WARN L146 SmtUtils]: Spent 1314ms on a formula simplification. DAG size of input: 74 DAG size of output 61 [2018-01-28 21:05:33,928 WARN L146 SmtUtils]: Spent 2064ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-01-28 21:05:36,046 WARN L146 SmtUtils]: Spent 2064ms on a formula simplification. DAG size of input: 67 DAG size of output 55 [2018-01-28 21:05:38,134 WARN L146 SmtUtils]: Spent 2039ms on a formula simplification. DAG size of input: 59 DAG size of output 48 [2018-01-28 21:05:40,366 WARN L146 SmtUtils]: Spent 2180ms on a formula simplification. DAG size of input: 62 DAG size of output 51 [2018-01-28 21:05:45,246 WARN L146 SmtUtils]: Spent 3465ms on a formula simplification. DAG size of input: 68 DAG size of output 57 [2018-01-28 21:05:52,862 WARN L146 SmtUtils]: Spent 7561ms on a formula simplification. DAG size of input: 75 DAG size of output 64 [2018-01-28 21:05:54,709 WARN L146 SmtUtils]: Spent 1793ms on a formula simplification. DAG size of input: 75 DAG size of output 61 [2018-01-28 21:05:56,499 WARN L146 SmtUtils]: Spent 1718ms on a formula simplification. DAG size of input: 70 DAG size of output 59 [2018-01-28 21:05:59,743 WARN L146 SmtUtils]: Spent 3126ms on a formula simplification. DAG size of input: 68 DAG size of output 57 [2018-01-28 21:06:04,018 WARN L146 SmtUtils]: Spent 4200ms on a formula simplification. DAG size of input: 73 DAG size of output 59 [2018-01-28 21:06:07,746 WARN L146 SmtUtils]: Spent 3655ms on a formula simplification. DAG size of input: 75 DAG size of output 60 [2018-01-28 21:06:11,235 WARN L146 SmtUtils]: Spent 3398ms on a formula simplification. DAG size of input: 85 DAG size of output 69 [2018-01-28 21:06:12,759 WARN L146 SmtUtils]: Spent 1462ms on a formula simplification. DAG size of input: 76 DAG size of output 62 [2018-01-28 21:06:15,511 WARN L146 SmtUtils]: Spent 2533ms on a formula simplification. DAG size of input: 69 DAG size of output 56 [2018-01-28 21:06:17,711 WARN L146 SmtUtils]: Spent 2049ms on a formula simplification. DAG size of input: 64 DAG size of output 52 [2018-01-28 21:06:21,053 WARN L146 SmtUtils]: Spent 2058ms on a formula simplification. DAG size of input: 64 DAG size of output 52 [2018-01-28 21:06:23,881 WARN L146 SmtUtils]: Spent 2767ms on a formula simplification. DAG size of input: 70 DAG size of output 58 [2018-01-28 21:06:28,090 WARN L146 SmtUtils]: Spent 4144ms on a formula simplification. DAG size of input: 77 DAG size of output 65 [2018-01-28 21:06:31,063 WARN L146 SmtUtils]: Spent 2910ms on a formula simplification. DAG size of input: 77 DAG size of output 62 [2018-01-28 21:06:34,351 WARN L146 SmtUtils]: Spent 3199ms on a formula simplification. DAG size of input: 72 DAG size of output 60 [2018-01-28 21:06:38,148 WARN L146 SmtUtils]: Spent 3716ms on a formula simplification. DAG size of input: 70 DAG size of output 58 [2018-01-28 21:06:38,548 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-01-28 21:06:38,787 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 87 DAG size of output 70 [2018-01-28 21:06:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:06:38,803 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2018-01-28 21:06:38,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-28 21:06:38,804 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2018-01-28 21:06:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:06:38,804 INFO L225 Difference]: With dead ends: 182 [2018-01-28 21:06:38,804 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:06:38,806 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 84.7s TimeCoverageRelationStatistics Valid=1345, Invalid=5793, Unknown=2, NotChecked=0, Total=7140 [2018-01-28 21:06:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:06:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:06:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:06:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:06:38,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2018-01-28 21:06:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:06:38,807 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:06:38,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-28 21:06:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:06:38,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:06:38,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:06:38,895 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:06:38,939 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:06:39,487 WARN L146 SmtUtils]: Spent 647ms on a formula simplification. DAG size of input: 290 DAG size of output 282 [2018-01-28 21:06:39,506 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:06:39,509 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:06:39,515 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:06:39,521 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-28 21:06:39,866 WARN L146 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 272 DAG size of output 258 [2018-01-28 21:06:40,037 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 92 DAG size of output 60 [2018-01-28 21:06:57,595 WARN L146 SmtUtils]: Spent 17551ms on a formula simplification. DAG size of input: 308 DAG size of output 184 Received shutdown request... [2018-01-28 21:07:04,705 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-28 21:07:04,706 INFO L168 Benchmark]: Toolchain (without parser) took 151870.64 ms. Allocated memory was 309.3 MB in the beginning and 640.7 MB in the end (delta: 331.4 MB). Free memory was 269.4 MB in the beginning and 545.6 MB in the end (delta: -276.2 MB). Peak memory consumption was 318.7 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:04,707 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 309.3 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:07:04,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.34 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 258.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:04,708 INFO L168 Benchmark]: Boogie Preprocessor took 40.57 ms. Allocated memory is still 309.3 MB. Free memory was 258.2 MB in the beginning and 256.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:04,708 INFO L168 Benchmark]: RCFGBuilder took 350.94 ms. Allocated memory is still 309.3 MB. Free memory was 256.3 MB in the beginning and 233.7 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:04,708 INFO L168 Benchmark]: TraceAbstraction took 151259.14 ms. Allocated memory was 309.3 MB in the beginning and 640.7 MB in the end (delta: 331.4 MB). Free memory was 233.7 MB in the beginning and 545.6 MB in the end (delta: -311.9 MB). Peak memory consumption was 283.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:07:04,710 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.13 ms. Allocated memory is still 309.3 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.34 ms. Allocated memory is still 309.3 MB. Free memory was 268.4 MB in the beginning and 258.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.57 ms. Allocated memory is still 309.3 MB. Free memory was 258.2 MB in the beginning and 256.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 350.94 ms. Allocated memory is still 309.3 MB. Free memory was 256.3 MB in the beginning and 233.7 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 151259.14 ms. Allocated memory was 309.3 MB in the beginning and 640.7 MB in the end (delta: 331.4 MB). Free memory was 233.7 MB in the beginning and 545.6 MB in the end (delta: -311.9 MB). Peak memory consumption was 283.0 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 286. 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-28_21-07-04-715.csv Completed graceful shutdown