java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-1cceb4a
[2018-01-29 22:36:49,012 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-29 22:36:49,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-29 22:36:49,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-29 22:36:49,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-29 22:36:49,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-29 22:36:49,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-29 22:36:49,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-29 22:36:49,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-29 22:36:49,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-29 22:36:49,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-29 22:36:49,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-29 22:36:49,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-29 22:36:49,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-29 22:36:49,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-29 22:36:49,036 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-29 22:36:49,038 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-29 22:36:49,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-29 22:36:49,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-29 22:36:49,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-29 22:36:49,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-29 22:36:49,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-29 22:36:49,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-29 22:36:49,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-29 22:36:49,047 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-29 22:36:49,049 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-29 22:36:49,049 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-29 22:36:49,050 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-29 22:36:49,050 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-29 22:36:49,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-29 22:36:49,051 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-29 22:36:49,051 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-29 22:36:49,061 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-29 22:36:49,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-29 22:36:49,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-29 22:36:49,063 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-29 22:36:49,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-29 22:36:49,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-29 22:36:49,063 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-29 22:36:49,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-29 22:36:49,064 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-29 22:36:49,064 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-29 22:36:49,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-29 22:36:49,065 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-29 22:36:49,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-29 22:36:49,065 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-29 22:36:49,065 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-29 22:36:49,065 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-29 22:36:49,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-29 22:36:49,066 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-29 22:36:49,066 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-29 22:36:49,066 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-29 22:36:49,066 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-29 22:36:49,066 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-29 22:36:49,067 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-29 22:36:49,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 22:36:49,067 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-29 22:36:49,067 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-29 22:36:49,067 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-29 22:36:49,068 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-29 22:36:49,068 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-29 22:36:49,068 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-29 22:36:49,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-29 22:36:49,068 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-29 22:36:49,069 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-29 22:36:49,069 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-29 22:36:49,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-29 22:36:49,117 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-29 22:36:49,120 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-29 22:36:49,121 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-29 22:36:49,121 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-29 22:36:49,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i
[2018-01-29 22:36:49,273 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-29 22:36:49,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-29 22:36:49,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-29 22:36:49,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-29 22:36:49,285 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-29 22:36:49,286 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:36:49" (1/1) ...
[2018-01-29 22:36:49,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5e2bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49, skipping insertion in model container
[2018-01-29 22:36:49,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:36:49" (1/1) ...
[2018-01-29 22:36:49,304 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 22:36:49,341 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 22:36:49,460 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 22:36:49,479 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 22:36:49,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49 WrapperNode
[2018-01-29 22:36:49,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-29 22:36:49,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-29 22:36:49,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-29 22:36:49,489 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-29 22:36:49,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49" (1/1) ...
[2018-01-29 22:36:49,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49" (1/1) ...
[2018-01-29 22:36:49,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49" (1/1) ...
[2018-01-29 22:36:49,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49" (1/1) ...
[2018-01-29 22:36:49,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49" (1/1) ...
[2018-01-29 22:36:49,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49" (1/1) ...
[2018-01-29 22:36:49,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49" (1/1) ...
[2018-01-29 22:36:49,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-29 22:36:49,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-29 22:36:49,525 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-29 22:36:49,525 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-29 22:36:49,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 22:36:49,573 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-29 22:36:49,573 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-29 22:36:49,574 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn
[2018-01-29 22:36:49,574 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-29 22:36:49,574 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-29 22:36:49,574 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-29 22:36:49,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-29 22:36:49,574 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-29 22:36:49,574 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-29 22:36:49,574 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-29 22:36:49,574 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn
[2018-01-29 22:36:49,575 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-29 22:36:49,575 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-29 22:36:49,575 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-29 22:36:49,850 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-29 22:36:49,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:36:49 BoogieIcfgContainer
[2018-01-29 22:36:49,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-29 22:36:49,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-29 22:36:49,852 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-29 22:36:49,854 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-29 22:36:49,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:36:49" (1/3) ...
[2018-01-29 22:36:49,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446df85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:36:49, skipping insertion in model container
[2018-01-29 22:36:49,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:36:49" (2/3) ...
[2018-01-29 22:36:49,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446df85f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:36:49, skipping insertion in model container
[2018-01-29 22:36:49,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:36:49" (3/3) ...
[2018-01-29 22:36:49,857 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i
[2018-01-29 22:36:49,866 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-29 22:36:49,872 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations.
[2018-01-29 22:36:49,922 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-29 22:36:49,922 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-29 22:36:49,922 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-29 22:36:49,922 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-29 22:36:49,922 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-29 22:36:49,923 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-29 22:36:49,923 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-29 22:36:49,923 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-29 22:36:49,924 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-29 22:36:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states.
[2018-01-29 22:36:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-01-29 22:36:49,951 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:49,953 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:49,953 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:49,958 INFO L82 PathProgramCache]: Analyzing trace with hash 486494336, now seen corresponding path program 1 times
[2018-01-29 22:36:49,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:49,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:50,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:50,019 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:50,019 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:50,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:50,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:50,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 22:36:50,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 22:36:50,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 22:36:50,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 22:36:50,365 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 4 states.
[2018-01-29 22:36:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:50,487 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions.
[2018-01-29 22:36:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 22:36:50,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2018-01-29 22:36:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:50,500 INFO L225 Difference]: With dead ends: 149
[2018-01-29 22:36:50,500 INFO L226 Difference]: Without dead ends: 87
[2018-01-29 22:36:50,504 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 22:36:50,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2018-01-29 22:36:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87.
[2018-01-29 22:36:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2018-01-29 22:36:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions.
[2018-01-29 22:36:50,539 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19
[2018-01-29 22:36:50,539 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:50,539 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions.
[2018-01-29 22:36:50,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 22:36:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions.
[2018-01-29 22:36:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-01-29 22:36:50,540 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:50,540 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:50,541 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:50,541 INFO L82 PathProgramCache]: Analyzing trace with hash 486494337, now seen corresponding path program 1 times
[2018-01-29 22:36:50,541 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:50,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:50,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:50,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:50,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:50,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:50,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:50,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 22:36:50,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-29 22:36:50,723 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-29 22:36:50,723 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2018-01-29 22:36:50,723 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 6 states.
[2018-01-29 22:36:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:50,836 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions.
[2018-01-29 22:36:50,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 22:36:50,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2018-01-29 22:36:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:50,838 INFO L225 Difference]: With dead ends: 87
[2018-01-29 22:36:50,838 INFO L226 Difference]: Without dead ends: 86
[2018-01-29 22:36:50,839 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42
[2018-01-29 22:36:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-01-29 22:36:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2018-01-29 22:36:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states.
[2018-01-29 22:36:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions.
[2018-01-29 22:36:50,845 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 19
[2018-01-29 22:36:50,845 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:50,846 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions.
[2018-01-29 22:36:50,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-29 22:36:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions.
[2018-01-29 22:36:50,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-29 22:36:50,846 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:50,846 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:50,847 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:50,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2098544684, now seen corresponding path program 1 times
[2018-01-29 22:36:50,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:50,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:50,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:50,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:50,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:50,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:50,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:50,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 22:36:50,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 22:36:50,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 22:36:50,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 22:36:50,883 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 4 states.
[2018-01-29 22:36:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:50,967 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions.
[2018-01-29 22:36:50,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 22:36:50,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2018-01-29 22:36:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:50,969 INFO L225 Difference]: With dead ends: 86
[2018-01-29 22:36:50,969 INFO L226 Difference]: Without dead ends: 85
[2018-01-29 22:36:50,969 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 22:36:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2018-01-29 22:36:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85.
[2018-01-29 22:36:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2018-01-29 22:36:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions.
[2018-01-29 22:36:50,975 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 20
[2018-01-29 22:36:50,975 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:50,975 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions.
[2018-01-29 22:36:50,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 22:36:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions.
[2018-01-29 22:36:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-01-29 22:36:50,976 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:50,976 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:50,976 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2098544683, now seen corresponding path program 1 times
[2018-01-29 22:36:50,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:50,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:50,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:50,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:50,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:50,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:51,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:51,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 22:36:51,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 22:36:51,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 22:36:51,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 22:36:51,053 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 5 states.
[2018-01-29 22:36:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:51,108 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions.
[2018-01-29 22:36:51,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 22:36:51,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2018-01-29 22:36:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:51,110 INFO L225 Difference]: With dead ends: 85
[2018-01-29 22:36:51,110 INFO L226 Difference]: Without dead ends: 84
[2018-01-29 22:36:51,110 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2018-01-29 22:36:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-01-29 22:36:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2018-01-29 22:36:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-01-29 22:36:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions.
[2018-01-29 22:36:51,119 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 20
[2018-01-29 22:36:51,120 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:51,120 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions.
[2018-01-29 22:36:51,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 22:36:51,120 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions.
[2018-01-29 22:36:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-01-29 22:36:51,121 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:51,121 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:51,121 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:51,122 INFO L82 PathProgramCache]: Analyzing trace with hash 996521205, now seen corresponding path program 1 times
[2018-01-29 22:36:51,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:51,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:51,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:51,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:51,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:51,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:51,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:51,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 22:36:51,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-29 22:36:51,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-29 22:36:51,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-29 22:36:51,183 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states.
[2018-01-29 22:36:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:51,291 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions.
[2018-01-29 22:36:51,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 22:36:51,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29
[2018-01-29 22:36:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:51,293 INFO L225 Difference]: With dead ends: 88
[2018-01-29 22:36:51,293 INFO L226 Difference]: Without dead ends: 86
[2018-01-29 22:36:51,294 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-01-29 22:36:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-01-29 22:36:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85.
[2018-01-29 22:36:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2018-01-29 22:36:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions.
[2018-01-29 22:36:51,302 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 29
[2018-01-29 22:36:51,302 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:51,302 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions.
[2018-01-29 22:36:51,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-29 22:36:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions.
[2018-01-29 22:36:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-01-29 22:36:51,304 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:51,304 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:51,304 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 996521206, now seen corresponding path program 1 times
[2018-01-29 22:36:51,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:51,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:51,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:51,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:51,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:51,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:51,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:51,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 22:36:51,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-29 22:36:51,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-29 22:36:51,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-01-29 22:36:51,434 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 9 states.
[2018-01-29 22:36:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:51,623 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions.
[2018-01-29 22:36:51,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-29 22:36:51,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29
[2018-01-29 22:36:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:51,628 INFO L225 Difference]: With dead ends: 126
[2018-01-29 22:36:51,628 INFO L226 Difference]: Without dead ends: 124
[2018-01-29 22:36:51,629 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182
[2018-01-29 22:36:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2018-01-29 22:36:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 89.
[2018-01-29 22:36:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-01-29 22:36:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions.
[2018-01-29 22:36:51,638 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 29
[2018-01-29 22:36:51,638 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:51,638 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions.
[2018-01-29 22:36:51,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-29 22:36:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions.
[2018-01-29 22:36:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-01-29 22:36:51,640 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:51,640 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:51,640 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:51,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1349802918, now seen corresponding path program 1 times
[2018-01-29 22:36:51,641 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:51,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:51,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:51,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:51,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:51,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:51,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:51,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 22:36:51,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-29 22:36:51,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-29 22:36:51,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-29 22:36:51,702 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 6 states.
[2018-01-29 22:36:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:51,780 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions.
[2018-01-29 22:36:51,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 22:36:51,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37
[2018-01-29 22:36:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:51,781 INFO L225 Difference]: With dead ends: 97
[2018-01-29 22:36:51,784 INFO L226 Difference]: Without dead ends: 94
[2018-01-29 22:36:51,784 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-01-29 22:36:51,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2018-01-29 22:36:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89.
[2018-01-29 22:36:51,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2018-01-29 22:36:51,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions.
[2018-01-29 22:36:51,792 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 37
[2018-01-29 22:36:51,793 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:51,793 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions.
[2018-01-29 22:36:51,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-29 22:36:51,793 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions.
[2018-01-29 22:36:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2018-01-29 22:36:51,794 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:51,794 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:51,794 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:51,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1349802917, now seen corresponding path program 1 times
[2018-01-29 22:36:51,795 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:51,795 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:51,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:51,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:51,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:51,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:51,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:51,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 22:36:51,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-29 22:36:51,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-29 22:36:51,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2018-01-29 22:36:51,923 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 9 states.
[2018-01-29 22:36:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:52,079 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions.
[2018-01-29 22:36:52,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-29 22:36:52,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37
[2018-01-29 22:36:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:52,080 INFO L225 Difference]: With dead ends: 124
[2018-01-29 22:36:52,080 INFO L226 Difference]: Without dead ends: 121
[2018-01-29 22:36:52,081 INFO L553 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-01-29 22:36:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2018-01-29 22:36:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98.
[2018-01-29 22:36:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states.
[2018-01-29 22:36:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions.
[2018-01-29 22:36:52,089 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37
[2018-01-29 22:36:52,090 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:52,090 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions.
[2018-01-29 22:36:52,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-29 22:36:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions.
[2018-01-29 22:36:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-01-29 22:36:52,091 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:52,091 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:52,092 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:52,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1713049875, now seen corresponding path program 1 times
[2018-01-29 22:36:52,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:52,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:52,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:52,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:52,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:52,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:52,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:52,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 22:36:52,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-29 22:36:52,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-29 22:36:52,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-29 22:36:52,352 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 6 states.
[2018-01-29 22:36:52,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:52,529 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions.
[2018-01-29 22:36:52,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-01-29 22:36:52,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42
[2018-01-29 22:36:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:52,530 INFO L225 Difference]: With dead ends: 98
[2018-01-29 22:36:52,530 INFO L226 Difference]: Without dead ends: 83
[2018-01-29 22:36:52,530 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-01-29 22:36:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-01-29 22:36:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2018-01-29 22:36:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2018-01-29 22:36:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions.
[2018-01-29 22:36:52,536 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 42
[2018-01-29 22:36:52,536 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:52,536 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions.
[2018-01-29 22:36:52,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-29 22:36:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions.
[2018-01-29 22:36:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-01-29 22:36:52,538 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:52,538 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:52,538 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1645612283, now seen corresponding path program 1 times
[2018-01-29 22:36:52,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:52,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:52,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:52,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:52,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:52,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:52,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:52,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 22:36:52,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-29 22:36:52,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-29 22:36:52,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 22:36:52,572 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 3 states.
[2018-01-29 22:36:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:52,592 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions.
[2018-01-29 22:36:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-29 22:36:52,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48
[2018-01-29 22:36:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:52,593 INFO L225 Difference]: With dead ends: 133
[2018-01-29 22:36:52,593 INFO L226 Difference]: Without dead ends: 85
[2018-01-29 22:36:52,593 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 22:36:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2018-01-29 22:36:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85.
[2018-01-29 22:36:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2018-01-29 22:36:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions.
[2018-01-29 22:36:52,599 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 48
[2018-01-29 22:36:52,599 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:52,599 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions.
[2018-01-29 22:36:52,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-29 22:36:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions.
[2018-01-29 22:36:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2018-01-29 22:36:52,600 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:52,601 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:52,601 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash 152655742, now seen corresponding path program 1 times
[2018-01-29 22:36:52,601 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:52,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:52,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:52,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:52,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:52,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-01-29 22:36:52,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:52,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-29 22:36:52,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-29 22:36:52,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-29 22:36:52,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-01-29 22:36:52,679 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 7 states.
[2018-01-29 22:36:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:52,788 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions.
[2018-01-29 22:36:52,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-29 22:36:52,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50
[2018-01-29 22:36:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:52,789 INFO L225 Difference]: With dead ends: 85
[2018-01-29 22:36:52,789 INFO L226 Difference]: Without dead ends: 84
[2018-01-29 22:36:52,790 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2018-01-29 22:36:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-01-29 22:36:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2018-01-29 22:36:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-01-29 22:36:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions.
[2018-01-29 22:36:52,796 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 50
[2018-01-29 22:36:52,797 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:52,797 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions.
[2018-01-29 22:36:52,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-29 22:36:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions.
[2018-01-29 22:36:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2018-01-29 22:36:52,798 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:52,798 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:52,798 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash 152655743, now seen corresponding path program 1 times
[2018-01-29 22:36:52,798 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:52,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:52,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:52,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:52,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:52,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:53,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:36:53,118 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:36:53,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:53,179 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:36:53,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11
[2018-01-29 22:36:53,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-01-29 22:36:53,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:53,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:53,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 22:36:53,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21
[2018-01-29 22:36:53,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14
[2018-01-29 22:36:53,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11
[2018-01-29 22:36:53,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-29 22:36:53,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:36:53,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:36:53,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33
[2018-01-29 22:36:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:53,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:36:53,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21
[2018-01-29 22:36:53,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-01-29 22:36:53,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-01-29 22:36:53,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462
[2018-01-29 22:36:53,658 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 22 states.
[2018-01-29 22:36:54,302 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 74 DAG size of output 54
[2018-01-29 22:36:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:54,948 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions.
[2018-01-29 22:36:54,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-01-29 22:36:54,949 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50
[2018-01-29 22:36:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:54,950 INFO L225 Difference]: With dead ends: 150
[2018-01-29 22:36:54,950 INFO L226 Difference]: Without dead ends: 147
[2018-01-29 22:36:54,951 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190
[2018-01-29 22:36:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2018-01-29 22:36:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 97.
[2018-01-29 22:36:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2018-01-29 22:36:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions.
[2018-01-29 22:36:54,962 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 50
[2018-01-29 22:36:54,962 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:54,962 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions.
[2018-01-29 22:36:54,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-01-29 22:36:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions.
[2018-01-29 22:36:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-01-29 22:36:54,963 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:54,963 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:54,963 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash -503133295, now seen corresponding path program 1 times
[2018-01-29 22:36:54,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:54,964 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:54,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:54,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:54,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:54,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-01-29 22:36:55,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 22:36:55,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-29 22:36:55,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-29 22:36:55,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-29 22:36:55,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-01-29 22:36:55,079 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 7 states.
[2018-01-29 22:36:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:55,260 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions.
[2018-01-29 22:36:55,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-29 22:36:55,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51
[2018-01-29 22:36:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:55,305 INFO L225 Difference]: With dead ends: 97
[2018-01-29 22:36:55,305 INFO L226 Difference]: Without dead ends: 96
[2018-01-29 22:36:55,305 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2018-01-29 22:36:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2018-01-29 22:36:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96.
[2018-01-29 22:36:55,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2018-01-29 22:36:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions.
[2018-01-29 22:36:55,313 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 51
[2018-01-29 22:36:55,313 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:55,313 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions.
[2018-01-29 22:36:55,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-29 22:36:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions.
[2018-01-29 22:36:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-01-29 22:36:55,314 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:55,314 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:55,314 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:55,314 INFO L82 PathProgramCache]: Analyzing trace with hash -503133294, now seen corresponding path program 1 times
[2018-01-29 22:36:55,314 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:55,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:55,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:55,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:55,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:55,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:55,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:36:55,613 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:36:55,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:55,647 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:36:55,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 22:36:55,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:55,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:55,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 22:36:55,699 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:36:55,700 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:36:55,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 22:36:55,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:55,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:55,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8
[2018-01-29 22:36:55,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11
[2018-01-29 22:36:55,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-01-29 22:36:55,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:55,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:55,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 22:36:55,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25
[2018-01-29 22:36:55,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26
[2018-01-29 22:36:55,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10
[2018-01-29 22:36:55,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:55,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:55,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts.
[2018-01-29 22:36:55,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35
[2018-01-29 22:36:55,978 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 28 treesize of output 26
[2018-01-29 22:36:55,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11
[2018-01-29 22:36:55,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-29 22:36:55,995 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 8 treesize of output 1
[2018-01-29 22:36:55,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:55,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:36:56,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:36:56,009 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33
[2018-01-29 22:36:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:56,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:36:56,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26
[2018-01-29 22:36:56,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-01-29 22:36:56,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-01-29 22:36:56,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702
[2018-01-29 22:36:56,122 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 27 states.
[2018-01-29 22:36:57,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:57,099 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions.
[2018-01-29 22:36:57,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-01-29 22:36:57,099 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51
[2018-01-29 22:36:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:57,100 INFO L225 Difference]: With dead ends: 209
[2018-01-29 22:36:57,100 INFO L226 Difference]: Without dead ends: 207
[2018-01-29 22:36:57,101 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560
[2018-01-29 22:36:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states.
[2018-01-29 22:36:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 152.
[2018-01-29 22:36:57,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states.
[2018-01-29 22:36:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions.
[2018-01-29 22:36:57,117 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 51
[2018-01-29 22:36:57,117 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:57,117 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions.
[2018-01-29 22:36:57,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-01-29 22:36:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions.
[2018-01-29 22:36:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-01-29 22:36:57,117 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:57,118 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:57,118 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash 869719771, now seen corresponding path program 2 times
[2018-01-29 22:36:57,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:57,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:57,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:57,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 22:36:57,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:57,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:36:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:57,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:36:57,551 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:36:57,558 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 22:36:57,571 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:36:57,577 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:36:57,579 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 22:36:57,583 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:36:57,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 6 treesize of output 5
[2018-01-29 22:36:57,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:57,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:57,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 22:36:57,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-01-29 22:36:57,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12
[2018-01-29 22:36:57,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:57,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:57,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:36:57,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19
[2018-01-29 22:36:57,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16
[2018-01-29 22:36:57,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13
[2018-01-29 22:36:57,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-29 22:36:57,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:36:57,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:36:57,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:49
[2018-01-29 22:36:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:36:58,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:36:58,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26
[2018-01-29 22:36:58,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-01-29 22:36:58,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-01-29 22:36:58,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702
[2018-01-29 22:36:58,037 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand 27 states.
[2018-01-29 22:36:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:36:59,704 INFO L93 Difference]: Finished difference Result 274 states and 293 transitions.
[2018-01-29 22:36:59,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-01-29 22:36:59,704 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63
[2018-01-29 22:36:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:36:59,705 INFO L225 Difference]: With dead ends: 274
[2018-01-29 22:36:59,706 INFO L226 Difference]: Without dead ends: 271
[2018-01-29 22:36:59,707 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=353, Invalid=1903, Unknown=0, NotChecked=0, Total=2256
[2018-01-29 22:36:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states.
[2018-01-29 22:36:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 99.
[2018-01-29 22:36:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states.
[2018-01-29 22:36:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions.
[2018-01-29 22:36:59,715 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 63
[2018-01-29 22:36:59,716 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:36:59,716 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions.
[2018-01-29 22:36:59,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-01-29 22:36:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions.
[2018-01-29 22:36:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-01-29 22:36:59,717 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 22:36:59,717 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 22:36:59,717 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr0RequiresViolation, cstrcspnErr9RequiresViolation, cstrcspnErr7RequiresViolation, cstrcspnErr4RequiresViolation, cstrcspnErr6RequiresViolation, cstrcspnErr5RequiresViolation, cstrcspnErr1RequiresViolation, cstrcspnErr3RequiresViolation, cstrcspnErr2RequiresViolation, cstrcspnErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-01-29 22:36:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2118436142, now seen corresponding path program 2 times
[2018-01-29 22:36:59,717 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 22:36:59,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 22:36:59,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:59,718 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 22:36:59,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 22:36:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 22:36:59,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 22:37:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:37:00,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 22:37:00,366 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 22:37:00,371 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 22:37:00,382 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:37:00,390 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 22:37:00,392 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 22:37:00,397 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 22:37:00,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 22:37:00,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 22:37:00,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-01-29 22:37:00,456 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:37:00,457 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 22:37:00,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-01-29 22:37:00,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15
[2018-01-29 22:37:00,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18
[2018-01-29 22:37:00,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-01-29 22:37:00,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12
[2018-01-29 22:37:00,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28
[2018-01-29 22:37:00,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30
[2018-01-29 22:37:00,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12
[2018-01-29 22:37:00,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,563 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 1 xjuncts.
[2018-01-29 22:37:00,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35
[2018-01-29 22:37:00,892 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 32 treesize of output 30
[2018-01-29 22:37:00,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13
[2018-01-29 22:37:00,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-01-29 22:37:00,907 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 10 treesize of output 1
[2018-01-29 22:37:00,908 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 22:37:00,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:37:00,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 22:37:00,920 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49
[2018-01-29 22:37:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 22:37:01,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 22:37:01,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27
[2018-01-29 22:37:01,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states
[2018-01-29 22:37:01,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2018-01-29 22:37:01,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756
[2018-01-29 22:37:01,013 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 28 states.
[2018-01-29 22:37:05,652 WARN L146 SmtUtils]: Spent 4106ms on a formula simplification. DAG size of input: 77 DAG size of output 52
[2018-01-29 22:37:06,693 WARN L146 SmtUtils]: Spent 937ms on a formula simplification. DAG size of input: 97 DAG size of output 63
[2018-01-29 22:37:08,856 WARN L146 SmtUtils]: Spent 2111ms on a formula simplification. DAG size of input: 104 DAG size of output 71
[2018-01-29 22:37:11,078 WARN L146 SmtUtils]: Spent 2182ms on a formula simplification. DAG size of input: 84 DAG size of output 60
[2018-01-29 22:37:16,624 WARN L146 SmtUtils]: Spent 5499ms on a formula simplification. DAG size of input: 89 DAG size of output 64
[2018-01-29 22:37:20,268 WARN L146 SmtUtils]: Spent 3603ms on a formula simplification. DAG size of input: 76 DAG size of output 56
[2018-01-29 22:37:20,883 WARN L146 SmtUtils]: Spent 507ms on a formula simplification. DAG size of input: 93 DAG size of output 69
[2018-01-29 22:37:21,316 WARN L146 SmtUtils]: Spent 378ms on a formula simplification. DAG size of input: 93 DAG size of output 70
[2018-01-29 22:37:21,704 WARN L146 SmtUtils]: Spent 302ms on a formula simplification. DAG size of input: 76 DAG size of output 57
[2018-01-29 22:37:22,177 WARN L146 SmtUtils]: Spent 416ms on a formula simplification. DAG size of input: 84 DAG size of output 63
[2018-01-29 22:37:26,567 WARN L146 SmtUtils]: Spent 4338ms on a formula simplification. DAG size of input: 79 DAG size of output 57
[2018-01-29 22:37:29,204 WARN L146 SmtUtils]: Spent 2539ms on a formula simplification. DAG size of input: 96 DAG size of output 70
[2018-01-29 22:37:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 22:37:29,213 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions.
[2018-01-29 22:37:29,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-01-29 22:37:29,214 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73
[2018-01-29 22:37:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 22:37:29,214 INFO L225 Difference]: With dead ends: 123
[2018-01-29 22:37:29,214 INFO L226 Difference]: Without dead ends: 0
[2018-01-29 22:37:29,215 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=310, Invalid=1852, Unknown=0, NotChecked=0, Total=2162
[2018-01-29 22:37:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-01-29 22:37:29,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-01-29 22:37:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-01-29 22:37:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-01-29 22:37:29,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73
[2018-01-29 22:37:29,216 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 22:37:29,216 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-01-29 22:37:29,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states.
[2018-01-29 22:37:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-01-29 22:37:29,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2018-01-29 22:37:29,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-01-29 22:37:29,242 WARN L137 erpolLogProxyWrapper]: Already inconsistent.
[2018-01-29 22:37:29,250 WARN L137 erpolLogProxyWrapper]: Already inconsistent.
[2018-01-29 22:37:29,254 WARN L137 erpolLogProxyWrapper]: Already inconsistent.
[2018-01-29 22:37:29,291 WARN L137 erpolLogProxyWrapper]: Already inconsistent.
[2018-01-29 22:37:29,325 WARN L137 erpolLogProxyWrapper]: Already inconsistent.
[2018-01-29 22:37:29,350 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 222 DAG size of output 202
[2018-01-29 22:37:29,382 WARN L137 erpolLogProxyWrapper]: Already inconsistent.
[2018-01-29 22:37:29,389 WARN L137 erpolLogProxyWrapper]: Already inconsistent.
[2018-01-29 22:37:29,400 WARN L137 erpolLogProxyWrapper]: Already inconsistent.
Received shutdown request...
[2018-01-29 22:39:29,683 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user
[2018-01-29 22:39:29,684 INFO L168 Benchmark]: Toolchain (without parser) took 160409.92 ms. Allocated memory was 306.7 MB in the beginning and 604.5 MB in the end (delta: 297.8 MB). Free memory was 264.6 MB in the beginning and 407.4 MB in the end (delta: -142.8 MB). Peak memory consumption was 238.8 MB. Max. memory is 5.3 GB.
[2018-01-29 22:39:29,685 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 306.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-29 22:39:29,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.53 ms. Allocated memory is still 306.7 MB. Free memory was 263.6 MB in the beginning and 253.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB.
[2018-01-29 22:39:29,686 INFO L168 Benchmark]: Boogie Preprocessor took 35.29 ms. Allocated memory is still 306.7 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-29 22:39:29,686 INFO L168 Benchmark]: RCFGBuilder took 326.57 ms. Allocated memory is still 306.7 MB. Free memory was 251.4 MB in the beginning and 228.1 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB.
[2018-01-29 22:39:29,686 INFO L168 Benchmark]: TraceAbstraction took 159831.61 ms. Allocated memory was 306.7 MB in the beginning and 604.5 MB in the end (delta: 297.8 MB). Free memory was 228.1 MB in the beginning and 407.4 MB in the end (delta: -179.2 MB). Peak memory consumption was 202.3 MB. Max. memory is 5.3 GB.
[2018-01-29 22:39:29,688 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.13 ms. Allocated memory is still 306.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 208.53 ms. Allocated memory is still 306.7 MB. Free memory was 263.6 MB in the beginning and 253.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 35.29 ms. Allocated memory is still 306.7 MB. Free memory was 253.4 MB in the beginning and 251.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 326.57 ms. Allocated memory is still 306.7 MB. Free memory was 251.4 MB in the beginning and 228.1 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 159831.61 ms. Allocated memory was 306.7 MB in the beginning and 604.5 MB in the end (delta: 297.8 MB). Free memory was 228.1 MB in the beginning and 407.4 MB in the end (delta: -179.2 MB). Peak memory consumption was 202.3 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 1]: pointer dereference always succeeds
For all program executions holds that pointer dereference always succeeds at this location
- PositiveResult [Line: 555]: all allocated memory was freed
For all program executions holds that all allocated memory was freed at this location
- TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction)
Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 233.
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-39-29-695.csv
Completed graceful shutdown