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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 08:42:42,009 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 08:42:42,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 08:42:42,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 08:42:42,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 08:42:42,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 08:42:42,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 08:42:42,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 08:42:42,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 08:42:42,023 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 08:42:42,024 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 08:42:42,024 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 08:42:42,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 08:42:42,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 08:42:42,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 08:42:42,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 08:42:42,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 08:42:42,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 08:42:42,029 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 08:42:42,030 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 08:42:42,031 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 08:42:42,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 08:42:42,032 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 08:42:42,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 08:42:42,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 08:42:42,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 08:42:42,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 08:42:42,034 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 08:42:42,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 08:42:42,034 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 08:42:42,034 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 08:42:42,035 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf
[2018-02-02 08:42:42,042 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 08:42:42,042 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 08:42:42,043 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 08:42:42,043 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 08:42:42,043 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 08:42:42,043 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 08:42:42,043 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 08:42:42,043 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 08:42:42,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 08:42:42,044 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 08:42:42,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 08:42:42,044 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 08:42:42,044 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 08:42:42,044 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 08:42:42,044 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 08:42:42,044 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 08:42:42,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 08:42:42,045 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 08:42:42,045 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 08:42:42,045 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 08:42:42,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 08:42:42,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 08:42:42,045 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-02 08:42:42,045 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-02 08:42:42,045 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-02-02 08:42:42,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 08:42:42,078 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 08:42:42,081 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 08:42:42,082 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 08:42:42,084 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 08:42:42,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk-alloca_true-valid-memsafety_true-termination.i
[2018-02-02 08:42:42,227 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 08:42:42,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 08:42:42,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 08:42:42,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 08:42:42,235 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 08:42:42,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:42:42" (1/1) ...
[2018-02-02 08:42:42,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@708086ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42, skipping insertion in model container
[2018-02-02 08:42:42,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:42:42" (1/1) ...
[2018-02-02 08:42:42,250 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 08:42:42,281 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 08:42:42,362 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 08:42:42,375 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 08:42:42,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42 WrapperNode
[2018-02-02 08:42:42,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 08:42:42,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 08:42:42,380 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 08:42:42,380 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 08:42:42,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42" (1/1) ...
[2018-02-02 08:42:42,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42" (1/1) ...
[2018-02-02 08:42:42,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42" (1/1) ...
[2018-02-02 08:42:42,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42" (1/1) ...
[2018-02-02 08:42:42,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42" (1/1) ...
[2018-02-02 08:42:42,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42" (1/1) ...
[2018-02-02 08:42:42,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42" (1/1) ...
[2018-02-02 08:42:42,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 08:42:42,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 08:42:42,411 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 08:42:42,411 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 08:42:42,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42" (1/1) ...
No working directory specified, using /home/ultimate/work/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-02-02 08:42:42,457 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 08:42:42,458 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 08:42:42,458 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk
[2018-02-02 08:42:42,458 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 08:42:42,458 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-02 08:42:42,458 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-02 08:42:42,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 08:42:42,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 08:42:42,458 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 08:42:42,459 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 08:42:42,459 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk
[2018-02-02 08:42:42,459 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 08:42:42,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 08:42:42,459 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 08:42:42,627 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 08:42:42,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:42:42 BoogieIcfgContainer
[2018-02-02 08:42:42,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 08:42:42,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 08:42:42,628 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 08:42:42,630 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 08:42:42,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:42:42" (1/3) ...
[2018-02-02 08:42:42,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd4d07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:42:42, skipping insertion in model container
[2018-02-02 08:42:42,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:42" (2/3) ...
[2018-02-02 08:42:42,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd4d07c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:42:42, skipping insertion in model container
[2018-02-02 08:42:42,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:42:42" (3/3) ...
[2018-02-02 08:42:42,632 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca_true-valid-memsafety_true-termination.i
[2018-02-02 08:42:42,638 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-02 08:42:42,643 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations.
[2018-02-02 08:42:42,669 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 08:42:42,669 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 08:42:42,669 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-02 08:42:42,669 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-02 08:42:42,669 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 08:42:42,669 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 08:42:42,669 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 08:42:42,669 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 08:42:42,670 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 08:42:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states.
[2018-02-02 08:42:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-02 08:42:42,687 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:42,688 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:42,689 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash -21044599, now seen corresponding path program 1 times
[2018-02-02 08:42:42,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:42,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:42,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:42,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:42,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:42,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:42,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:42,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 08:42:42,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 08:42:42,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 08:42:42,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 08:42:42,882 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states.
[2018-02-02 08:42:43,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:43,016 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions.
[2018-02-02 08:42:43,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 08:42:43,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2018-02-02 08:42:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:43,025 INFO L225 Difference]: With dead ends: 57
[2018-02-02 08:42:43,025 INFO L226 Difference]: Without dead ends: 54
[2018-02-02 08:42:43,027 INFO L554 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-02-02 08:42:43,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states.
[2018-02-02 08:42:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54.
[2018-02-02 08:42:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-02-02 08:42:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions.
[2018-02-02 08:42:43,052 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13
[2018-02-02 08:42:43,053 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:43,053 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions.
[2018-02-02 08:42:43,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 08:42:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions.
[2018-02-02 08:42:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2018-02-02 08:42:43,053 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:43,053 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:43,053 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:43,053 INFO L82 PathProgramCache]: Analyzing trace with hash -21044598, now seen corresponding path program 1 times
[2018-02-02 08:42:43,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:43,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:43,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:43,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:43,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:43,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:43,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 08:42:43,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 08:42:43,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 08:42:43,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2018-02-02 08:42:43,152 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states.
[2018-02-02 08:42:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:43,206 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions.
[2018-02-02 08:42:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 08:42:43,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13
[2018-02-02 08:42:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:43,208 INFO L225 Difference]: With dead ends: 53
[2018-02-02 08:42:43,208 INFO L226 Difference]: Without dead ends: 53
[2018-02-02 08:42:43,209 INFO L554 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-02-02 08:42:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2018-02-02 08:42:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2018-02-02 08:42:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-02-02 08:42:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions.
[2018-02-02 08:42:43,214 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13
[2018-02-02 08:42:43,214 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:43,214 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions.
[2018-02-02 08:42:43,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 08:42:43,215 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions.
[2018-02-02 08:42:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-02 08:42:43,215 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:43,215 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:43,215 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash -652382516, now seen corresponding path program 1 times
[2018-02-02 08:42:43,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:43,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:43,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:43,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:43,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:43,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:43,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 08:42:43,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 08:42:43,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 08:42:43,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 08:42:43,262 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states.
[2018-02-02 08:42:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:43,309 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions.
[2018-02-02 08:42:43,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 08:42:43,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2018-02-02 08:42:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:43,310 INFO L225 Difference]: With dead ends: 52
[2018-02-02 08:42:43,310 INFO L226 Difference]: Without dead ends: 52
[2018-02-02 08:42:43,311 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 08:42:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2018-02-02 08:42:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2018-02-02 08:42:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-02-02 08:42:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions.
[2018-02-02 08:42:43,315 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14
[2018-02-02 08:42:43,315 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:43,315 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions.
[2018-02-02 08:42:43,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 08:42:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions.
[2018-02-02 08:42:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-02 08:42:43,316 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:43,316 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:43,316 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash -652382515, now seen corresponding path program 1 times
[2018-02-02 08:42:43,316 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:43,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:43,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:43,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:43,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:43,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:43,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 08:42:43,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 08:42:43,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 08:42:43,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 08:42:43,385 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states.
[2018-02-02 08:42:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:43,414 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions.
[2018-02-02 08:42:43,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 08:42:43,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2018-02-02 08:42:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:43,416 INFO L225 Difference]: With dead ends: 51
[2018-02-02 08:42:43,416 INFO L226 Difference]: Without dead ends: 51
[2018-02-02 08:42:43,416 INFO L554 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-02-02 08:42:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2018-02-02 08:42:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2018-02-02 08:42:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2018-02-02 08:42:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions.
[2018-02-02 08:42:43,420 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14
[2018-02-02 08:42:43,420 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:43,420 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions.
[2018-02-02 08:42:43,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 08:42:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions.
[2018-02-02 08:42:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 08:42:43,421 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:43,421 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:43,421 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash 470787565, now seen corresponding path program 1 times
[2018-02-02 08:42:43,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:43,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:43,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:43,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:43,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:43,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:43,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 08:42:43,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 08:42:43,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 08:42:43,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 08:42:43,457 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states.
[2018-02-02 08:42:43,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:43,505 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions.
[2018-02-02 08:42:43,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 08:42:43,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2018-02-02 08:42:43,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:43,505 INFO L225 Difference]: With dead ends: 49
[2018-02-02 08:42:43,506 INFO L226 Difference]: Without dead ends: 49
[2018-02-02 08:42:43,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-02 08:42:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2018-02-02 08:42:43,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49.
[2018-02-02 08:42:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2018-02-02 08:42:43,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions.
[2018-02-02 08:42:43,509 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18
[2018-02-02 08:42:43,509 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:43,509 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions.
[2018-02-02 08:42:43,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 08:42:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions.
[2018-02-02 08:42:43,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2018-02-02 08:42:43,509 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:43,509 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:43,509 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:43,509 INFO L82 PathProgramCache]: Analyzing trace with hash 470787566, now seen corresponding path program 1 times
[2018-02-02 08:42:43,510 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:43,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:43,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:43,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:43,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:43,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:43,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-02 08:42:43,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 08:42:43,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 08:42:43,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-02-02 08:42:43,583 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states.
[2018-02-02 08:42:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:43,690 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions.
[2018-02-02 08:42:43,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 08:42:43,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18
[2018-02-02 08:42:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:43,693 INFO L225 Difference]: With dead ends: 73
[2018-02-02 08:42:43,693 INFO L226 Difference]: Without dead ends: 73
[2018-02-02 08:42:43,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2018-02-02 08:42:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2018-02-02 08:42:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53.
[2018-02-02 08:42:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2018-02-02 08:42:43,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions.
[2018-02-02 08:42:43,695 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18
[2018-02-02 08:42:43,695 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:43,695 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions.
[2018-02-02 08:42:43,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 08:42:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions.
[2018-02-02 08:42:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-02 08:42:43,696 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:43,696 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:43,696 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:43,696 INFO L82 PathProgramCache]: Analyzing trace with hash 947097224, now seen corresponding path program 1 times
[2018-02-02 08:42:43,696 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:43,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:43,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:43,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:43,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:43,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:43,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 08:42:43,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 08:42:43,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 08:42:43,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 08:42:43,728 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states.
[2018-02-02 08:42:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:43,799 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions.
[2018-02-02 08:42:43,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 08:42:43,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23
[2018-02-02 08:42:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:43,801 INFO L225 Difference]: With dead ends: 53
[2018-02-02 08:42:43,801 INFO L226 Difference]: Without dead ends: 53
[2018-02-02 08:42:43,801 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-02-02 08:42:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2018-02-02 08:42:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50.
[2018-02-02 08:42:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2018-02-02 08:42:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions.
[2018-02-02 08:42:43,804 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23
[2018-02-02 08:42:43,804 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:43,804 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions.
[2018-02-02 08:42:43,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 08:42:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions.
[2018-02-02 08:42:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-02 08:42:43,804 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:43,804 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:43,804 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash 947097225, now seen corresponding path program 1 times
[2018-02-02 08:42:43,805 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:43,805 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:43,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:43,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:43,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:43,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:43,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-02 08:42:43,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 08:42:43,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 08:42:43,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2018-02-02 08:42:43,907 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states.
[2018-02-02 08:42:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:44,000 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions.
[2018-02-02 08:42:44,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 08:42:44,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23
[2018-02-02 08:42:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:44,001 INFO L225 Difference]: With dead ends: 67
[2018-02-02 08:42:44,002 INFO L226 Difference]: Without dead ends: 67
[2018-02-02 08:42:44,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2018-02-02 08:42:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-02-02 08:42:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58.
[2018-02-02 08:42:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2018-02-02 08:42:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions.
[2018-02-02 08:42:44,006 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23
[2018-02-02 08:42:44,006 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:44,006 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions.
[2018-02-02 08:42:44,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 08:42:44,006 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions.
[2018-02-02 08:42:44,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 08:42:44,007 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:44,007 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:44,007 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:44,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1236428998, now seen corresponding path program 1 times
[2018-02-02 08:42:44,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:44,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:44,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:44,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:44,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:44,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:44,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 08:42:44,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 08:42:44,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 08:42:44,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2018-02-02 08:42:44,131 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 7 states.
[2018-02-02 08:42:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:44,244 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions.
[2018-02-02 08:42:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 08:42:44,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28
[2018-02-02 08:42:44,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:44,245 INFO L225 Difference]: With dead ends: 57
[2018-02-02 08:42:44,245 INFO L226 Difference]: Without dead ends: 48
[2018-02-02 08:42:44,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2018-02-02 08:42:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2018-02-02 08:42:44,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48.
[2018-02-02 08:42:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states.
[2018-02-02 08:42:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions.
[2018-02-02 08:42:44,252 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28
[2018-02-02 08:42:44,253 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:44,253 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions.
[2018-02-02 08:42:44,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 08:42:44,253 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions.
[2018-02-02 08:42:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 08:42:44,253 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:44,254 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:44,254 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1333847614, now seen corresponding path program 1 times
[2018-02-02 08:42:44,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:44,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:44,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:44,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:44,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:44,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:44,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 08:42:44,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 08:42:44,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 08:42:44,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 08:42:44,282 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 3 states.
[2018-02-02 08:42:44,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:44,287 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions.
[2018-02-02 08:42:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 08:42:44,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28
[2018-02-02 08:42:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:44,288 INFO L225 Difference]: With dead ends: 50
[2018-02-02 08:42:44,288 INFO L226 Difference]: Without dead ends: 50
[2018-02-02 08:42:44,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 08:42:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2018-02-02 08:42:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2018-02-02 08:42:44,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2018-02-02 08:42:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions.
[2018-02-02 08:42:44,292 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28
[2018-02-02 08:42:44,292 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:44,292 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions.
[2018-02-02 08:42:44,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 08:42:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions.
[2018-02-02 08:42:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-02-02 08:42:44,293 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:44,293 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:44,293 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:44,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1745742785, now seen corresponding path program 1 times
[2018-02-02 08:42:44,293 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:44,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:44,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:44,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:44,308 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 08:42:44,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:44,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-02-02 08:42:44,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 08:42:44,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 08:42:44,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2018-02-02 08:42:44,472 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 11 states.
[2018-02-02 08:42:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:44,597 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions.
[2018-02-02 08:42:44,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 08:42:44,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30
[2018-02-02 08:42:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:44,598 INFO L225 Difference]: With dead ends: 62
[2018-02-02 08:42:44,598 INFO L226 Difference]: Without dead ends: 50
[2018-02-02 08:42:44,598 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272
[2018-02-02 08:42:44,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2018-02-02 08:42:44,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2018-02-02 08:42:44,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2018-02-02 08:42:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions.
[2018-02-02 08:42:44,600 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 30
[2018-02-02 08:42:44,600 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:44,600 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions.
[2018-02-02 08:42:44,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 08:42:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions.
[2018-02-02 08:42:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-02-02 08:42:44,601 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:44,601 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:44,601 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1611729279, now seen corresponding path program 1 times
[2018-02-02 08:42:44,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:44,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:44,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:44,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:44,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:44,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:44,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-02-02 08:42:44,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 08:42:44,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 08:42:44,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2018-02-02 08:42:44,702 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 11 states.
[2018-02-02 08:42:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:44,809 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions.
[2018-02-02 08:42:44,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-02 08:42:44,810 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30
[2018-02-02 08:42:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:44,810 INFO L225 Difference]: With dead ends: 77
[2018-02-02 08:42:44,810 INFO L226 Difference]: Without dead ends: 77
[2018-02-02 08:42:44,811 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272
[2018-02-02 08:42:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2018-02-02 08:42:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75.
[2018-02-02 08:42:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2018-02-02 08:42:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions.
[2018-02-02 08:42:44,814 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 30
[2018-02-02 08:42:44,814 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:44,814 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions.
[2018-02-02 08:42:44,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 08:42:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions.
[2018-02-02 08:42:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2018-02-02 08:42:44,815 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:44,815 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:44,815 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:44,815 INFO L82 PathProgramCache]: Analyzing trace with hash -193709055, now seen corresponding path program 1 times
[2018-02-02 08:42:44,815 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:44,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:44,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:44,816 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:44,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:45,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 08:42:45,005 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-02 08:42:45,020 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:45,083 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 08:42:45,129 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-02-02 08:42:45,132 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-02-02 08:42:45,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:45,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:45,138 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-02-02 08:42:45,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21
[2018-02-02 08:42:45,284 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-02-02 08:42:45,293 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-02-02 08:42:45,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 08:42:45,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 08:42:45,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 08:42:45,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33
[2018-02-02 08:42:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:45,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 08:42:45,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19
[2018-02-02 08:42:45,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 08:42:45,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 08:42:45,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380
[2018-02-02 08:42:45,441 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states.
[2018-02-02 08:42:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:46,040 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions.
[2018-02-02 08:42:46,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 08:42:46,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30
[2018-02-02 08:42:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:46,041 INFO L225 Difference]: With dead ends: 103
[2018-02-02 08:42:46,042 INFO L226 Difference]: Without dead ends: 103
[2018-02-02 08:42:46,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870
[2018-02-02 08:42:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2018-02-02 08:42:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82.
[2018-02-02 08:42:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2018-02-02 08:42:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions.
[2018-02-02 08:42:46,046 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 30
[2018-02-02 08:42:46,047 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:46,047 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions.
[2018-02-02 08:42:46,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 08:42:46,051 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions.
[2018-02-02 08:42:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-02-02 08:42:46,051 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:46,051 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:46,051 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash -276872451, now seen corresponding path program 1 times
[2018-02-02 08:42:46,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:46,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:46,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:46,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:46,052 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:46,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:46,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:46,117 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 08:42:46,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-02 08:42:46,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 08:42:46,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 08:42:46,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2018-02-02 08:42:46,118 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 10 states.
[2018-02-02 08:42:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:46,258 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions.
[2018-02-02 08:42:46,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 08:42:46,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31
[2018-02-02 08:42:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:46,259 INFO L225 Difference]: With dead ends: 82
[2018-02-02 08:42:46,259 INFO L226 Difference]: Without dead ends: 59
[2018-02-02 08:42:46,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342
[2018-02-02 08:42:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2018-02-02 08:42:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57.
[2018-02-02 08:42:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2018-02-02 08:42:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions.
[2018-02-02 08:42:46,260 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 31
[2018-02-02 08:42:46,261 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:46,261 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions.
[2018-02-02 08:42:46,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 08:42:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions.
[2018-02-02 08:42:46,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-02 08:42:46,261 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:46,262 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 08:42:46,262 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:46,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1615321176, now seen corresponding path program 1 times
[2018-02-02 08:42:46,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:46,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:46,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:46,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:46,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:46,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:46,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 08:42:46,475 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-02 08:42:46,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:46,496 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 08:42:46,499 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-02-02 08:42:46,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:46,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:46,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-02 08:42:46,536 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 08:42:46,536 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 08:42:46,538 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-02-02 08:42:46,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:46,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:46,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8
[2018-02-02 08:42:46,561 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-02-02 08:42:46,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 11 treesize of output 10
[2018-02-02 08:42:46,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:46,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:46,568 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-02-02 08:42:46,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25
[2018-02-02 08:42:46,585 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-02-02 08:42:46,587 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-02-02 08:42:46,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:46,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:46,595 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-02-02 08:42:46,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35
[2018-02-02 08:42:47,434 WARN L143 SmtUtils]: Spent 563ms on a formula simplification that was a NOOP. DAG size: 46
[2018-02-02 08:42:47,485 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-02-02 08:42:47,531 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-02-02 08:42:47,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts.
[2018-02-02 08:42:47,584 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 33
[2018-02-02 08:42:47,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:47,626 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-02-02 08:42:47,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:47,628 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-02-02 08:42:47,628 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:47,630 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-02-02 08:42:47,630 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:47,680 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-02-02 08:42:47,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts.
[2018-02-02 08:42:47,736 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 33 treesize of output 26
[2018-02-02 08:42:47,737 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:47,792 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-02-02 08:42:47,793 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts.
[2018-02-02 08:42:47,859 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-02-02 08:42:47,859 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts.
[2018-02-02 08:42:47,921 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-02-02 08:42:47,921 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:47,923 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-02-02 08:42:47,923 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:47,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts.
[2018-02-02 08:42:48,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts.
[2018-02-02 08:42:48,036 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66
[2018-02-02 08:42:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:48,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 08:42:48,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28
[2018-02-02 08:42:48,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-02-02 08:42:48,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-02-02 08:42:48,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812
[2018-02-02 08:42:48,124 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 29 states.
[2018-02-02 08:42:52,029 WARN L146 SmtUtils]: Spent 1386ms on a formula simplification. DAG size of input: 71 DAG size of output 62
[2018-02-02 08:42:52,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:52,712 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions.
[2018-02-02 08:42:52,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 08:42:52,712 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33
[2018-02-02 08:42:52,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:52,713 INFO L225 Difference]: With dead ends: 124
[2018-02-02 08:42:52,713 INFO L226 Difference]: Without dead ends: 124
[2018-02-02 08:42:52,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=335, Invalid=1827, Unknown=0, NotChecked=0, Total=2162
[2018-02-02 08:42:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2018-02-02 08:42:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 87.
[2018-02-02 08:42:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2018-02-02 08:42:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions.
[2018-02-02 08:42:52,717 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 33
[2018-02-02 08:42:52,717 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:52,717 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions.
[2018-02-02 08:42:52,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-02-02 08:42:52,717 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions.
[2018-02-02 08:42:52,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-02-02 08:42:52,718 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:52,718 INFO L351 BasicCegarLoop]: trace histogram [3, 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]
[2018-02-02 08:42:52,718 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:52,719 INFO L82 PathProgramCache]: Analyzing trace with hash 149792585, now seen corresponding path program 2 times
[2018-02-02 08:42:52,719 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:52,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:52,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:52,720 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:52,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:52,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:52,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 08:42:52,964 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-02 08:42:52,973 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 08:42:52,985 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 08:42:52,989 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 08:42:52,991 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 08:42:52,993 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 08:42:52,997 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-02-02 08:42:52,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:52,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:53,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-02 08:42:53,044 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-02-02 08:42:53,046 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-02-02 08:42:53,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:53,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:53,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:53,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19
[2018-02-02 08:42:53,188 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-02-02 08:42:53,194 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-02-02 08:42:53,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 08:42:53,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 08:42:53,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts.
[2018-02-02 08:42:53,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:33
[2018-02-02 08:42:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:53,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 08:42:53,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23
[2018-02-02 08:42:53,309 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 08:42:53,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 08:42:53,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552
[2018-02-02 08:42:53,309 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 24 states.
[2018-02-02 08:42:53,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:53,960 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions.
[2018-02-02 08:42:53,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 08:42:53,960 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 37
[2018-02-02 08:42:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:53,961 INFO L225 Difference]: With dead ends: 108
[2018-02-02 08:42:53,961 INFO L226 Difference]: Without dead ends: 106
[2018-02-02 08:42:53,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332
[2018-02-02 08:42:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2018-02-02 08:42:53,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 52.
[2018-02-02 08:42:53,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-02-02 08:42:53,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions.
[2018-02-02 08:42:53,965 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 37
[2018-02-02 08:42:53,965 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:53,965 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions.
[2018-02-02 08:42:53,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 08:42:53,965 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions.
[2018-02-02 08:42:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 08:42:53,966 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:53,966 INFO L351 BasicCegarLoop]: trace histogram [3, 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]
[2018-02-02 08:42:53,966 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:53,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1837728530, now seen corresponding path program 2 times
[2018-02-02 08:42:53,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:53,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:53,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:53,967 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 08:42:53,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:53,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:54,302 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 08:42:54,302 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-02 08:42:54,307 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 08:42:54,315 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 08:42:54,320 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 08:42:54,323 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 08:42:54,326 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 08:42:54,329 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-02-02 08:42:54,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,342 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-02-02 08:42:54,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-02-02 08:42:54,379 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 08:42:54,379 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 08:42:54,380 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-02-02 08:42:54,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,389 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-02-02 08:42:54,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21
[2018-02-02 08:42:54,433 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-02-02 08:42:54,435 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-02-02 08:42:54,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31
[2018-02-02 08:42:54,466 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-02-02 08:42:54,467 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-02-02 08:42:54,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38
[2018-02-02 08:42:54,873 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-02-02 08:42:54,878 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-02-02 08:42:54,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-02 08:42:54,885 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-02-02 08:42:54,886 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:54,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 08:42:54,904 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-02-02 08:42:54,904 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81
[2018-02-02 08:42:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 08:42:55,061 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 08:42:55,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32
[2018-02-02 08:42:55,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-02-02 08:42:55,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-02-02 08:42:55,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 08:42:55,062 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 33 states.
[2018-02-02 08:42:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:42:58,402 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions.
[2018-02-02 08:42:58,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2018-02-02 08:42:58,402 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48
[2018-02-02 08:42:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:42:58,403 INFO L225 Difference]: With dead ends: 122
[2018-02-02 08:42:58,403 INFO L226 Difference]: Without dead ends: 122
[2018-02-02 08:42:58,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=832, Invalid=5174, Unknown=0, NotChecked=0, Total=6006
[2018-02-02 08:42:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states.
[2018-02-02 08:42:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 71.
[2018-02-02 08:42:58,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states.
[2018-02-02 08:42:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions.
[2018-02-02 08:42:58,405 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 48
[2018-02-02 08:42:58,405 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:42:58,405 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions.
[2018-02-02 08:42:58,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-02-02 08:42:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions.
[2018-02-02 08:42:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2018-02-02 08:42:58,406 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 08:42:58,406 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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]
[2018-02-02 08:42:58,407 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-02 08:42:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash 899669712, now seen corresponding path program 1 times
[2018-02-02 08:42:58,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 08:42:58,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 08:42:58,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:58,407 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 08:42:58,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 08:42:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:58,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 08:42:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2018-02-02 08:42:58,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 08:42:58,616 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/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-02-02 08:42:58,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 08:42:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 08:42:58,652 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 08:42:58,657 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-02-02 08:42:58,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,661 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-02-02 08:42:58,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-02-02 08:42:58,686 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 08:42:58,687 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 08:42:58,687 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-02-02 08:42:58,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,693 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-02-02 08:42:58,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18
[2018-02-02 08:42:58,721 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-02-02 08:42:58,722 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-02-02 08:42:58,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,727 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-02-02 08:42:58,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28
[2018-02-02 08:42:58,747 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-02-02 08:42:58,749 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-02-02 08:42:58,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 08:42:58,758 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-02-02 08:42:58,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35
[2018-02-02 08:43:01,303 WARN L143 SmtUtils]: Spent 2052ms on a formula simplification that was a NOOP. DAG size: 46
[2018-02-02 08:43:01,388 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-02-02 08:43:01,393 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 49 treesize of output 39
[2018-02-02 08:43:01,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 08:43:01,450 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-02-02 08:43:01,451 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-02-02 08:43:01,503 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 49
[2018-02-02 08:43:01,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts.
[2018-02-02 08:43:01,570 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-02-02 08:43:01,570 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-02-02 08:43:01,572 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-02-02 08:43:01,572 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-02-02 08:43:01,632 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 35 treesize of output 33
[2018-02-02 08:43:01,632 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts.
[2018-02-02 08:43:01,688 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 40 treesize of output 30
[2018-02-02 08:43:01,689 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-02-02 08:43:01,690 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 25
[2018-02-02 08:43:01,690 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-02-02 08:43:01,692 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-02-02 08:43:01,692 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-02-02 08:43:01,738 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 29 treesize of output 22
[2018-02-02 08:43:01,738 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-02-02 08:43:01,739 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 23 treesize of output 16
[2018-02-02 08:43:01,739 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-02-02 08:43:01,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts.
[2018-02-02 08:43:01,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts.
[2018-02-02 08:43:01,892 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:67, output treesize:78
[2018-02-02 08:43:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 08:43:02,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 08:43:02,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32
[2018-02-02 08:43:02,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-02-02 08:43:02,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-02-02 08:43:02,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 08:43:02,067 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 33 states.
[2018-02-02 08:43:02,616 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 50 DAG size of output 46
[2018-02-02 08:43:04,043 WARN L146 SmtUtils]: Spent 1159ms on a formula simplification. DAG size of input: 48 DAG size of output 41
[2018-02-02 08:43:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 08:43:05,774 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions.
[2018-02-02 08:43:05,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2018-02-02 08:43:05,775 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70
[2018-02-02 08:43:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 08:43:05,775 INFO L225 Difference]: With dead ends: 98
[2018-02-02 08:43:05,775 INFO L226 Difference]: Without dead ends: 0
[2018-02-02 08:43:05,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=893, Invalid=3397, Unknown=0, NotChecked=0, Total=4290
[2018-02-02 08:43:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-02-02 08:43:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-02-02 08:43:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-02-02 08:43:05,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-02-02 08:43:05,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70
[2018-02-02 08:43:05,776 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 08:43:05,776 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-02-02 08:43:05,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-02-02 08:43:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-02-02 08:43:05,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-02-02 08:43:05,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:43:05 BoogieIcfgContainer
[2018-02-02 08:43:05,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 08:43:05,780 INFO L168 Benchmark]: Toolchain (without parser) took 23552.90 ms. Allocated memory was 403.7 MB in the beginning and 792.2 MB in the end (delta: 388.5 MB). Free memory was 361.7 MB in the beginning and 484.7 MB in the end (delta: -123.0 MB). Peak memory consumption was 265.5 MB. Max. memory is 5.3 GB.
[2018-02-02 08:43:05,781 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 08:43:05,781 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.95 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
[2018-02-02 08:43:05,781 INFO L168 Benchmark]: Boogie Preprocessor took 31.20 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 348.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 08:43:05,781 INFO L168 Benchmark]: RCFGBuilder took 217.06 ms. Allocated memory is still 403.7 MB. Free memory was 348.4 MB in the beginning and 327.2 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB.
[2018-02-02 08:43:05,781 INFO L168 Benchmark]: TraceAbstraction took 23151.38 ms. Allocated memory was 403.7 MB in the beginning and 792.2 MB in the end (delta: 388.5 MB). Free memory was 327.2 MB in the beginning and 484.7 MB in the end (delta: -157.5 MB). Peak memory consumption was 231.0 MB. Max. memory is 5.3 GB.
[2018-02-02 08:43:05,783 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.14 ms. Allocated memory is still 403.7 MB. Free memory is still 367.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 149.95 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 31.20 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 348.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 217.06 ms. Allocated memory is still 403.7 MB. Free memory was 348.4 MB in the beginning and 327.2 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 23151.38 ms. Allocated memory was 403.7 MB in the beginning and 792.2 MB in the end (delta: 388.5 MB). Free memory was 327.2 MB in the beginning and 484.7 MB in the end (delta: -157.5 MB). Peak memory consumption was 231.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
- AllSpecificationsHoldResult: All specifications hold
15 specifications checked. All of them hold
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 58 locations, 15 error locations. SAFE Result, 23.1s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 667 SDtfs, 2003 SDslu, 2851 SDs, 0 SdLazy, 3874 SolverSat, 382 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 525 GetRequests, 169 SyntacticMatches, 8 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 16.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 199 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 719 NumberOfCodeBlocks, 719 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 696 ConstructedInterpolants, 126 QuantifiedInterpolants, 484411 SizeOfPredicates, 72 NumberOfNonLiveVariables, 883 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 97/220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-43-05-788.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-43-05-788.csv
Received shutdown request...