java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 09:29:25,453 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 09:29:25,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 09:29:25,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 09:29:25,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 09:29:25,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 09:29:25,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 09:29:25,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 09:29:25,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 09:29:25,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 09:29:25,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 09:29:25,473 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 09:29:25,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 09:29:25,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 09:29:25,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 09:29:25,477 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 09:29:25,479 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 09:29:25,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 09:29:25,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 09:29:25,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 09:29:25,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 09:29:25,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 09:29:25,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 09:29:25,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 09:29:25,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 09:29:25,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 09:29:25,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 09:29:25,487 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 09:29:25,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 09:29:25,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 09:29:25,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 09:29:25,488 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf
[2018-02-02 09:29:25,497 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 09:29:25,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 09:29:25,498 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 09:29:25,498 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 09:29:25,499 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 09:29:25,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 09:29:25,499 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 09:29:25,499 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 09:29:25,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 09:29:25,499 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 09:29:25,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 09:29:25,499 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 09:29:25,499 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 09:29:25,499 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 09:29:25,500 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 09:29:25,500 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 09:29:25,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 09:29:25,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 09:29:25,500 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 09:29:25,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 09:29:25,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:29:25,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 09:29:25,500 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-02 09:29:25,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-02 09:29:25,501 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-02-02 09:29:25,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 09:29:25,534 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 09:29:25,537 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 09:29:25,538 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 09:29:25,538 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 09:29:25,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_true-valid-memsafety_true-termination.i
[2018-02-02 09:29:25,698 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 09:29:25,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 09:29:25,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 09:29:25,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 09:29:25,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 09:29:25,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:29:25" (1/1) ...
[2018-02-02 09:29:25,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8b5bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25, skipping insertion in model container
[2018-02-02 09:29:25,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:29:25" (1/1) ...
[2018-02-02 09:29:25,716 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:29:25,749 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:29:25,836 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:29:25,850 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:29:25,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25 WrapperNode
[2018-02-02 09:29:25,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 09:29:25,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 09:29:25,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 09:29:25,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 09:29:25,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25" (1/1) ...
[2018-02-02 09:29:25,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25" (1/1) ...
[2018-02-02 09:29:25,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25" (1/1) ...
[2018-02-02 09:29:25,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25" (1/1) ...
[2018-02-02 09:29:25,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25" (1/1) ...
[2018-02-02 09:29:25,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25" (1/1) ...
[2018-02-02 09:29:25,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25" (1/1) ...
[2018-02-02 09:29:25,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 09:29:25,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 09:29:25,883 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 09:29:25,883 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 09:29:25,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:29:25,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 09:29:25,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 09:29:25,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_positive
[2018-02-02 09:29:25,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc
[2018-02-02 09:29:25,917 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17
[2018-02-02 09:29:25,917 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17
[2018-02-02 09:29:25,918 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point
[2018-02-02 09:29:25,918 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_positive
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc
[2018-02-02 09:29:25,918 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2018-02-02 09:29:25,919 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17
[2018-02-02 09:29:25,919 INFO L128 BoogieDeclarations]: Found specification of procedure free_17
[2018-02-02 09:29:25,919 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point
[2018-02-02 09:29:25,919 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 09:29:25,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 09:29:25,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 09:29:26,120 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 09:29:26,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:29:26 BoogieIcfgContainer
[2018-02-02 09:29:26,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 09:29:26,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 09:29:26,122 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 09:29:26,124 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 09:29:26,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:29:25" (1/3) ...
[2018-02-02 09:29:26,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47051b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:29:26, skipping insertion in model container
[2018-02-02 09:29:26,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:29:25" (2/3) ...
[2018-02-02 09:29:26,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47051b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:29:26, skipping insertion in model container
[2018-02-02 09:29:26,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:29:26" (3/3) ...
[2018-02-02 09:29:26,126 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_true-valid-memsafety_true-termination.i
[2018-02-02 09:29:26,131 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-02 09:29:26,137 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations.
[2018-02-02 09:29:26,165 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 09:29:26,165 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 09:29:26,165 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-02 09:29:26,165 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-02 09:29:26,166 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 09:29:26,166 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 09:29:26,166 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 09:29:26,166 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 09:29:26,166 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 09:29:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states.
[2018-02-02 09:29:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-02 09:29:26,183 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:26,184 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:29:26,184 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:26,187 INFO L82 PathProgramCache]: Analyzing trace with hash 280514151, now seen corresponding path program 1 times
[2018-02-02 09:29:26,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:26,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:26,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:26,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:26,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:26,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:29:26,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 09:29:26,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 09:29:26,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 09:29:26,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:29:26,360 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states.
[2018-02-02 09:29:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:26,549 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions.
[2018-02-02 09:29:26,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 09:29:26,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23
[2018-02-02 09:29:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:26,559 INFO L225 Difference]: With dead ends: 133
[2018-02-02 09:29:26,559 INFO L226 Difference]: Without dead ends: 127
[2018-02-02 09:29:26,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:29:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states.
[2018-02-02 09:29:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83.
[2018-02-02 09:29:26,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2018-02-02 09:29:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions.
[2018-02-02 09:29:26,597 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 23
[2018-02-02 09:29:26,598 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:26,598 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions.
[2018-02-02 09:29:26,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 09:29:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions.
[2018-02-02 09:29:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-02 09:29:26,599 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:26,600 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:29:26,600 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash 279746761, now seen corresponding path program 1 times
[2018-02-02 09:29:26,600 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:26,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:26,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:26,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:26,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:26,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:29:26,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:29:26,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:29:26,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:29:26,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:29:26,673 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states.
[2018-02-02 09:29:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:26,689 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions.
[2018-02-02 09:29:26,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:29:26,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23
[2018-02-02 09:29:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:26,691 INFO L225 Difference]: With dead ends: 85
[2018-02-02 09:29:26,691 INFO L226 Difference]: Without dead ends: 83
[2018-02-02 09:29:26,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:29:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-02-02 09:29:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2018-02-02 09:29:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-02-02 09:29:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions.
[2018-02-02 09:29:26,699 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 23
[2018-02-02 09:29:26,700 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:26,700 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions.
[2018-02-02 09:29:26,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:29:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions.
[2018-02-02 09:29:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-02 09:29:26,700 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:26,700 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:29:26,701 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1161746679, now seen corresponding path program 1 times
[2018-02-02 09:29:26,701 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:26,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:26,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:26,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:26,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:26,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:29:26,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:29:26,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:29:26,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:29:26,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:29:26,770 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states.
[2018-02-02 09:29:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:26,811 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions.
[2018-02-02 09:29:26,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:29:26,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25
[2018-02-02 09:29:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:26,813 INFO L225 Difference]: With dead ends: 81
[2018-02-02 09:29:26,813 INFO L226 Difference]: Without dead ends: 81
[2018-02-02 09:29:26,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:29:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2018-02-02 09:29:26,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2018-02-02 09:29:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-02-02 09:29:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions.
[2018-02-02 09:29:26,817 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 25
[2018-02-02 09:29:26,818 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:26,818 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions.
[2018-02-02 09:29:26,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:29:26,818 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions.
[2018-02-02 09:29:26,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-02 09:29:26,818 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:26,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:29:26,819 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:26,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514069, now seen corresponding path program 1 times
[2018-02-02 09:29:26,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:26,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:26,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:26,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:26,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:26,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:29:26,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:29:26,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:29:26,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:29:26,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:29:26,860 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states.
[2018-02-02 09:29:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:26,947 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions.
[2018-02-02 09:29:26,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:29:26,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25
[2018-02-02 09:29:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:26,948 INFO L225 Difference]: With dead ends: 80
[2018-02-02 09:29:26,948 INFO L226 Difference]: Without dead ends: 80
[2018-02-02 09:29:26,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:29:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2018-02-02 09:29:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80.
[2018-02-02 09:29:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states.
[2018-02-02 09:29:26,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions.
[2018-02-02 09:29:26,954 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25
[2018-02-02 09:29:26,954 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:26,954 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions.
[2018-02-02 09:29:26,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:29:26,954 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions.
[2018-02-02 09:29:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-02 09:29:26,955 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:26,955 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:29:26,955 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:26,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1162514068, now seen corresponding path program 1 times
[2018-02-02 09:29:26,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:26,956 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:26,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:26,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:26,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:27,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:29:27,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2018-02-02 09:29:27,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 09:29:27,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 09:29:27,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110
[2018-02-02 09:29:27,178 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 11 states.
[2018-02-02 09:29:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:27,358 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions.
[2018-02-02 09:29:27,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 09:29:27,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25
[2018-02-02 09:29:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:27,359 INFO L225 Difference]: With dead ends: 84
[2018-02-02 09:29:27,359 INFO L226 Difference]: Without dead ends: 84
[2018-02-02 09:29:27,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240
[2018-02-02 09:29:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-02-02 09:29:27,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83.
[2018-02-02 09:29:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2018-02-02 09:29:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions.
[2018-02-02 09:29:27,364 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 25
[2018-02-02 09:29:27,365 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:27,365 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions.
[2018-02-02 09:29:27,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 09:29:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions.
[2018-02-02 09:29:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-02 09:29:27,365 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:27,366 INFO L351 BasicCegarLoop]: trace histogram [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]
[2018-02-02 09:29:27,366 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:27,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1767740413, now seen corresponding path program 1 times
[2018-02-02 09:29:27,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:27,366 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:27,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:27,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:27,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:27,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:27,587 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:29:27,587 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:29:27,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:27,629 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:29:27,685 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 17 treesize of output 16
[2018-02-02 09:29:27,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:27,699 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 20 treesize of output 19
[2018-02-02 09:29:27,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:27,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:29:27,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36
[2018-02-02 09:29:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:28,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:29:28,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19
[2018-02-02 09:29:28,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 09:29:28,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 09:29:28,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380
[2018-02-02 09:29:28,080 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 20 states.
[2018-02-02 09:29:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:31,057 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions.
[2018-02-02 09:29:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-02 09:29:31,057 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29
[2018-02-02 09:29:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:31,058 INFO L225 Difference]: With dead ends: 83
[2018-02-02 09:29:31,058 INFO L226 Difference]: Without dead ends: 83
[2018-02-02 09:29:31,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506
[2018-02-02 09:29:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-02-02 09:29:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2018-02-02 09:29:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2018-02-02 09:29:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions.
[2018-02-02 09:29:31,061 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 29
[2018-02-02 09:29:31,061 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:31,061 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions.
[2018-02-02 09:29:31,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 09:29:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions.
[2018-02-02 09:29:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2018-02-02 09:29:31,062 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:31,062 INFO L351 BasicCegarLoop]: trace histogram [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]
[2018-02-02 09:29:31,063 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:31,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1224527730, now seen corresponding path program 1 times
[2018-02-02 09:29:31,063 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:31,063 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:31,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:31,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:31,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:31,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-02-02 09:29:31,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:29:31,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:29:31,115 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:29:31,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:29:31,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:29:31,116 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states.
[2018-02-02 09:29:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:31,133 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions.
[2018-02-02 09:29:31,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:29:31,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40
[2018-02-02 09:29:31,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:31,134 INFO L225 Difference]: With dead ends: 85
[2018-02-02 09:29:31,134 INFO L226 Difference]: Without dead ends: 85
[2018-02-02 09:29:31,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:29:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2018-02-02 09:29:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83.
[2018-02-02 09:29:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2018-02-02 09:29:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions.
[2018-02-02 09:29:31,139 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 40
[2018-02-02 09:29:31,139 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:31,139 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions.
[2018-02-02 09:29:31,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:29:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions.
[2018-02-02 09:29:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-02-02 09:29:31,140 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:31,140 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:29:31,140 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash 755727615, now seen corresponding path program 1 times
[2018-02-02 09:29:31,140 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:31,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:31,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:31,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:31,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:31,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:31,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:29:31,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:29:31,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:29:31,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:29:31,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:29:31,190 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states.
[2018-02-02 09:29:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:31,328 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions.
[2018-02-02 09:29:31,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 09:29:31,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41
[2018-02-02 09:29:31,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:31,329 INFO L225 Difference]: With dead ends: 126
[2018-02-02 09:29:31,329 INFO L226 Difference]: Without dead ends: 126
[2018-02-02 09:29:31,330 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:29:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2018-02-02 09:29:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108.
[2018-02-02 09:29:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states.
[2018-02-02 09:29:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions.
[2018-02-02 09:29:31,334 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 41
[2018-02-02 09:29:31,334 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:31,336 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions.
[2018-02-02 09:29:31,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:29:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions.
[2018-02-02 09:29:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-02-02 09:29:31,337 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:31,337 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:29:31,337 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:31,338 INFO L82 PathProgramCache]: Analyzing trace with hash 755727616, now seen corresponding path program 1 times
[2018-02-02 09:29:31,338 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:31,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:31,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:31,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:31,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:31,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 09:29:31,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:29:31,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-02 09:29:31,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 09:29:31,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 09:29:31,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:29:31,382 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 7 states.
[2018-02-02 09:29:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:31,424 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions.
[2018-02-02 09:29:31,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 09:29:31,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41
[2018-02-02 09:29:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:31,425 INFO L225 Difference]: With dead ends: 133
[2018-02-02 09:29:31,425 INFO L226 Difference]: Without dead ends: 130
[2018-02-02 09:29:31,425 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:29:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2018-02-02 09:29:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 107.
[2018-02-02 09:29:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2018-02-02 09:29:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions.
[2018-02-02 09:29:31,429 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 41
[2018-02-02 09:29:31,430 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:31,430 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions.
[2018-02-02 09:29:31,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 09:29:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions.
[2018-02-02 09:29:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-02 09:29:31,431 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:31,431 INFO L351 BasicCegarLoop]: trace histogram [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]
[2018-02-02 09:29:31,431 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386836, now seen corresponding path program 1 times
[2018-02-02 09:29:31,431 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:31,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:31,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:31,432 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:31,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:31,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 09:29:31,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:29:31,540 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:29:31,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:31,565 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:29:31,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-02 09:29:31,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:31,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:31,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-02 09:29:31,594 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:29:31,595 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:29:31,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21
[2018-02-02 09:29:31,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:31,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:29:31,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15
[2018-02-02 09:29:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 09:29:31,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:29:31,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12
[2018-02-02 09:29:31,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 09:29:31,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 09:29:31,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:29:31,632 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand 13 states.
[2018-02-02 09:29:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:29:32,032 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions.
[2018-02-02 09:29:32,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-02 09:29:32,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42
[2018-02-02 09:29:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:29:32,035 INFO L225 Difference]: With dead ends: 153
[2018-02-02 09:29:32,036 INFO L226 Difference]: Without dead ends: 153
[2018-02-02 09:29:32,036 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420
[2018-02-02 09:29:32,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states.
[2018-02-02 09:29:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 112.
[2018-02-02 09:29:32,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states.
[2018-02-02 09:29:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions.
[2018-02-02 09:29:32,041 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 42
[2018-02-02 09:29:32,042 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:29:32,042 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions.
[2018-02-02 09:29:32,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 09:29:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions.
[2018-02-02 09:29:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-02 09:29:32,043 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:29:32,043 INFO L351 BasicCegarLoop]: trace histogram [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]
[2018-02-02 09:29:32,043 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:29:32,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1441386837, now seen corresponding path program 1 times
[2018-02-02 09:29:32,043 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:29:32,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:29:32,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:32,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:32,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:29:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:32,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:29:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:32,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:29:32,181 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:29:32,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:29:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:29:32,206 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:29:32,235 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 23 treesize of output 22
[2018-02-02 09:29:32,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:32,253 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 20 treesize of output 19
[2018-02-02 09:29:32,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:32,268 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 19 treesize of output 18
[2018-02-02 09:29:32,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:32,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2018-02-02 09:29:32,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:32,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:29:32,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40
[2018-02-02 09:29:32,651 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:29:32,652 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:29:32,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 64
[2018-02-02 09:29:32,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:32,691 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:29:32,692 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:29:32,692 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 50 treesize of output 44
[2018-02-02 09:29:32,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:32,721 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:29:32,723 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 49 treesize of output 52
[2018-02-02 09:29:32,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:32,747 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:29:32,748 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:29:32,748 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 48 treesize of output 42
[2018-02-02 09:29:32,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:29:32,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:29:32,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:101, output treesize:83
[2018-02-02 09:29:32,938 WARN L143 SmtUtils]: Spent 129ms on a formula simplification that was a NOOP. DAG size: 47
[2018-02-02 09:29:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:29:32,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:29:32,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22
[2018-02-02 09:29:32,982 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 09:29:32,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 09:29:32,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=453, Unknown=3, NotChecked=0, Total=506
[2018-02-02 09:29:32,983 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 23 states.
[2018-02-02 09:29:37,229 WARN L146 SmtUtils]: Spent 4076ms on a formula simplification. DAG size of input: 55 DAG size of output 54
[2018-02-02 09:29:46,059 WARN L146 SmtUtils]: Spent 8791ms on a formula simplification. DAG size of input: 72 DAG size of output 70
[2018-02-02 09:29:49,927 WARN L146 SmtUtils]: Spent 3765ms on a formula simplification. DAG size of input: 53 DAG size of output 52
[2018-02-02 09:29:53,880 WARN L146 SmtUtils]: Spent 3923ms on a formula simplification. DAG size of input: 55 DAG size of output 54
[2018-02-02 09:30:24,375 WARN L146 SmtUtils]: Spent 20802ms on a formula simplification. DAG size of input: 68 DAG size of output 65
Received shutdown request...
[2018-02-02 09:30:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-02-02 09:30:46,953 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-02-02 09:30:46,956 WARN L185 ceAbstractionStarter]: Timeout
[2018-02-02 09:30:46,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:30:46 BoogieIcfgContainer
[2018-02-02 09:30:46,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 09:30:46,956 INFO L168 Benchmark]: Toolchain (without parser) took 81257.39 ms. Allocated memory was 401.6 MB in the beginning and 708.3 MB in the end (delta: 306.7 MB). Free memory was 358.4 MB in the beginning and 535.4 MB in the end (delta: -177.0 MB). Peak memory consumption was 129.7 MB. Max. memory is 5.3 GB.
[2018-02-02 09:30:46,957 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 09:30:46,957 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.87 ms. Allocated memory is still 401.6 MB. Free memory was 358.4 MB in the beginning and 345.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
[2018-02-02 09:30:46,957 INFO L168 Benchmark]: Boogie Preprocessor took 27.18 ms. Allocated memory is still 401.6 MB. Free memory was 345.2 MB in the beginning and 343.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB.
[2018-02-02 09:30:46,957 INFO L168 Benchmark]: RCFGBuilder took 238.64 ms. Allocated memory is still 401.6 MB. Free memory was 342.5 MB in the beginning and 317.7 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB.
[2018-02-02 09:30:46,958 INFO L168 Benchmark]: TraceAbstraction took 80834.02 ms. Allocated memory was 401.6 MB in the beginning and 708.3 MB in the end (delta: 306.7 MB). Free memory was 317.7 MB in the beginning and 535.4 MB in the end (delta: -217.7 MB). Peak memory consumption was 89.0 MB. Max. memory is 5.3 GB.
[2018-02-02 09:30:46,958 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.11 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 154.87 ms. Allocated memory is still 401.6 MB. Free memory was 358.4 MB in the beginning and 345.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 27.18 ms. Allocated memory is still 401.6 MB. Free memory was 345.2 MB in the beginning and 343.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 238.64 ms. Allocated memory is still 401.6 MB. Free memory was 342.5 MB in the beginning and 317.7 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 80834.02 ms. Allocated memory was 401.6 MB in the beginning and 708.3 MB in the end (delta: 306.7 MB). Free memory was 317.7 MB in the beginning and 535.4 MB in the end (delta: -217.7 MB). Peak memory consumption was 89.0 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1447). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1452). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1480]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 1480). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1461). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1472). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1476). Cancelled while BasicCegarLoop was constructing difference of abstraction (112states) and interpolant automaton (currently 17 states, 23 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 72.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 8 procedures, 82 locations, 17 error locations. TIMEOUT Result, 80.7s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 78.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 686 SDslu, 3875 SDs, 0 SdLazy, 2273 SolverSat, 149 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 12.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 43.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 133 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 455 ConstructedInterpolants, 29 QuantifiedInterpolants, 112440 SizeOfPredicates, 17 NumberOfNonLiveVariables, 424 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 31/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-30-46-964.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-30-46-964.csv
Completed graceful shutdown