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/memsafety-ext2/complex_data_creation_test01_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 09:09:21,571 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 09:09:21,573 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 09:09:21,585 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 09:09:21,585 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 09:09:21,586 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 09:09:21,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 09:09:21,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 09:09:21,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 09:09:21,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 09:09:21,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 09:09:21,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 09:09:21,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 09:09:21,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 09:09:21,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 09:09:21,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 09:09:21,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 09:09:21,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 09:09:21,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 09:09:21,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 09:09:21,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 09:09:21,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 09:09:21,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 09:09:21,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 09:09:21,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 09:09:21,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 09:09:21,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 09:09:21,607 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 09:09:21,607 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 09:09:21,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 09:09:21,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 09:09:21,608 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:09:21,617 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 09:09:21,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 09:09:21,618 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 09:09:21,619 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 09:09:21,619 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 09:09:21,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 09:09:21,619 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 09:09:21,619 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 09:09:21,619 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 09:09:21,620 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 09:09:21,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 09:09:21,620 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 09:09:21,620 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 09:09:21,620 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 09:09:21,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 09:09:21,621 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 09:09:21,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 09:09:21,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 09:09:21,621 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 09:09:21,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 09:09:21,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:09:21,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 09:09:21,622 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-02 09:09:21,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-02 09:09:21,622 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-02-02 09:09:21,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 09:09:21,662 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 09:09:21,665 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 09:09:21,667 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 09:09:21,668 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 09:09:21,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_true-valid-memsafety.i
[2018-02-02 09:09:21,816 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 09:09:21,817 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 09:09:21,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 09:09:21,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 09:09:21,822 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 09:09:21,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:09:21" (1/1) ...
[2018-02-02 09:09:21,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56610e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21, skipping insertion in model container
[2018-02-02 09:09:21,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:09:21" (1/1) ...
[2018-02-02 09:09:21,834 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:09:21,862 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:09:21,955 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:09:21,976 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:09:21,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21 WrapperNode
[2018-02-02 09:09:21,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 09:09:21,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 09:09:21,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 09:09:21,985 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 09:09:21,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21" (1/1) ...
[2018-02-02 09:09:21,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21" (1/1) ...
[2018-02-02 09:09:22,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21" (1/1) ...
[2018-02-02 09:09:22,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21" (1/1) ...
[2018-02-02 09:09:22,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21" (1/1) ...
[2018-02-02 09:09:22,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21" (1/1) ...
[2018-02-02 09:09:22,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21" (1/1) ...
[2018-02-02 09:09:22,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 09:09:22,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 09:09:22,018 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 09:09:22,018 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 09:09:22,019 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21" (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:09:22,054 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 09:09:22,055 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 09:09:22,055 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data
[2018-02-02 09:09:22,055 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData
[2018-02-02 09:09:22,055 INFO L136 BoogieDeclarations]: Found implementation of procedure append
[2018-02-02 09:09:22,055 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 09:09:22,055 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-02 09:09:22,055 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-02 09:09:22,056 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 09:09:22,056 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 09:09:22,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 09:09:22,056 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 09:09:22,056 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 09:09:22,056 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 09:09:22,056 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-02 09:09:22,056 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 09:09:22,056 INFO L128 BoogieDeclarations]: Found specification of procedure create_data
[2018-02-02 09:09:22,057 INFO L128 BoogieDeclarations]: Found specification of procedure freeData
[2018-02-02 09:09:22,057 INFO L128 BoogieDeclarations]: Found specification of procedure append
[2018-02-02 09:09:22,057 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 09:09:22,057 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 09:09:22,057 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 09:09:22,500 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 09:09:22,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:09:22 BoogieIcfgContainer
[2018-02-02 09:09:22,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 09:09:22,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 09:09:22,501 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 09:09:22,504 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 09:09:22,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:09:21" (1/3) ...
[2018-02-02 09:09:22,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49aa6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:09:22, skipping insertion in model container
[2018-02-02 09:09:22,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:09:21" (2/3) ...
[2018-02-02 09:09:22,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49aa6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:09:22, skipping insertion in model container
[2018-02-02 09:09:22,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:09:22" (3/3) ...
[2018-02-02 09:09:22,506 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01_true-valid-memsafety.i
[2018-02-02 09:09:22,513 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-02 09:09:22,519 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations.
[2018-02-02 09:09:22,550 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 09:09:22,550 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 09:09:22,551 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-02 09:09:22,551 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-02 09:09:22,551 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 09:09:22,551 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 09:09:22,551 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 09:09:22,551 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 09:09:22,552 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 09:09:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states.
[2018-02-02 09:09:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2018-02-02 09:09:22,574 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:22,575 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:22,575 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:22,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704007, now seen corresponding path program 1 times
[2018-02-02 09:09:22,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:22,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:22,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:22,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:22,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:22,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:22,690 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:09:22,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:22,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 09:09:22,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 09:09:22,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 09:09:22,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:09:22,784 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 3 states.
[2018-02-02 09:09:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:22,986 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions.
[2018-02-02 09:09:22,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 09:09:22,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2018-02-02 09:09:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:22,997 INFO L225 Difference]: With dead ends: 208
[2018-02-02 09:09:22,997 INFO L226 Difference]: Without dead ends: 205
[2018-02-02 09:09:22,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:09:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states.
[2018-02-02 09:09:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205.
[2018-02-02 09:09:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states.
[2018-02-02 09:09:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 217 transitions.
[2018-02-02 09:09:23,040 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 217 transitions. Word has length 7
[2018-02-02 09:09:23,040 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:23,040 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 217 transitions.
[2018-02-02 09:09:23,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 09:09:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 217 transitions.
[2018-02-02 09:09:23,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2018-02-02 09:09:23,041 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:23,041 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:23,041 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:23,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1826704008, now seen corresponding path program 1 times
[2018-02-02 09:09:23,041 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:23,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:23,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:23,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:23,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:23,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:09:23,087 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:09:23,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:23,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 09:09:23,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 09:09:23,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 09:09:23,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:09:23,089 INFO L87 Difference]: Start difference. First operand 205 states and 217 transitions. Second operand 3 states.
[2018-02-02 09:09:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:23,203 INFO L93 Difference]: Finished difference Result 206 states and 219 transitions.
[2018-02-02 09:09:23,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 09:09:23,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7
[2018-02-02 09:09:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:23,205 INFO L225 Difference]: With dead ends: 206
[2018-02-02 09:09:23,205 INFO L226 Difference]: Without dead ends: 206
[2018-02-02 09:09:23,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:09:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2018-02-02 09:09:23,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204.
[2018-02-02 09:09:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states.
[2018-02-02 09:09:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions.
[2018-02-02 09:09:23,216 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 7
[2018-02-02 09:09:23,216 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:23,217 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions.
[2018-02-02 09:09:23,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 09:09:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions.
[2018-02-02 09:09:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-02 09:09:23,217 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:23,217 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:23,217 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:23,218 INFO L82 PathProgramCache]: Analyzing trace with hash 627159801, now seen corresponding path program 1 times
[2018-02-02 09:09:23,218 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:23,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:23,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:23,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:23,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:23,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:23,282 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:09:23,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:23,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:09:23,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:09:23,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:09:23,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:23,283 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand 5 states.
[2018-02-02 09:09:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:23,453 INFO L93 Difference]: Finished difference Result 202 states and 214 transitions.
[2018-02-02 09:09:23,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:09:23,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2018-02-02 09:09:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:23,455 INFO L225 Difference]: With dead ends: 202
[2018-02-02 09:09:23,455 INFO L226 Difference]: Without dead ends: 202
[2018-02-02 09:09:23,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:09:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2018-02-02 09:09:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202.
[2018-02-02 09:09:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states.
[2018-02-02 09:09:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions.
[2018-02-02 09:09:23,465 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 14
[2018-02-02 09:09:23,467 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:23,467 INFO L432 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions.
[2018-02-02 09:09:23,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:09:23,467 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions.
[2018-02-02 09:09:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-02-02 09:09:23,467 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:23,468 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:23,468 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash 627159802, now seen corresponding path program 1 times
[2018-02-02 09:09:23,468 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:23,468 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:23,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:23,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:23,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:23,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:23,561 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:09:23,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:23,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:09:23,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 09:09:23,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 09:09:23,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:09:23,562 INFO L87 Difference]: Start difference. First operand 202 states and 214 transitions. Second operand 7 states.
[2018-02-02 09:09:23,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:23,836 INFO L93 Difference]: Finished difference Result 222 states and 238 transitions.
[2018-02-02 09:09:23,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:09:23,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14
[2018-02-02 09:09:23,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:23,838 INFO L225 Difference]: With dead ends: 222
[2018-02-02 09:09:23,838 INFO L226 Difference]: Without dead ends: 222
[2018-02-02 09:09:23,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:09:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states.
[2018-02-02 09:09:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 211.
[2018-02-02 09:09:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states.
[2018-02-02 09:09:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 226 transitions.
[2018-02-02 09:09:23,845 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 226 transitions. Word has length 14
[2018-02-02 09:09:23,845 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:23,846 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 226 transitions.
[2018-02-02 09:09:23,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 09:09:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 226 transitions.
[2018-02-02 09:09:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-02-02 09:09:23,846 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:23,846 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:23,846 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882424, now seen corresponding path program 1 times
[2018-02-02 09:09:23,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:23,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:23,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:23,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:23,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:23,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:23,885 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:09:23,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:23,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:09:23,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:09:23,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:09:23,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:09:23,885 INFO L87 Difference]: Start difference. First operand 211 states and 226 transitions. Second operand 4 states.
[2018-02-02 09:09:24,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:24,009 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions.
[2018-02-02 09:09:24,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:09:24,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2018-02-02 09:09:24,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:24,010 INFO L225 Difference]: With dead ends: 209
[2018-02-02 09:09:24,010 INFO L226 Difference]: Without dead ends: 209
[2018-02-02 09:09:24,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:24,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states.
[2018-02-02 09:09:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209.
[2018-02-02 09:09:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states.
[2018-02-02 09:09:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions.
[2018-02-02 09:09:24,014 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 15
[2018-02-02 09:09:24,014 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:24,014 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions.
[2018-02-02 09:09:24,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:09:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions.
[2018-02-02 09:09:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-02-02 09:09:24,015 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:24,015 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:24,015 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2032882423, now seen corresponding path program 1 times
[2018-02-02 09:09:24,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:24,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:24,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:24,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:24,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:24,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:24,055 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:09:24,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:24,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:09:24,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:09:24,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:09:24,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:09:24,056 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand 4 states.
[2018-02-02 09:09:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:24,167 INFO L93 Difference]: Finished difference Result 207 states and 220 transitions.
[2018-02-02 09:09:24,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 09:09:24,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2018-02-02 09:09:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:24,168 INFO L225 Difference]: With dead ends: 207
[2018-02-02 09:09:24,168 INFO L226 Difference]: Without dead ends: 207
[2018-02-02 09:09:24,168 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states.
[2018-02-02 09:09:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207.
[2018-02-02 09:09:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states.
[2018-02-02 09:09:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 220 transitions.
[2018-02-02 09:09:24,171 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 220 transitions. Word has length 15
[2018-02-02 09:09:24,172 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:24,172 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 220 transitions.
[2018-02-02 09:09:24,172 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:09:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 220 transitions.
[2018-02-02 09:09:24,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-02-02 09:09:24,172 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:24,172 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:24,172 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash -290527541, now seen corresponding path program 1 times
[2018-02-02 09:09:24,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:24,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:24,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:24,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:24,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:24,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:24,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:24,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2018-02-02 09:09:24,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 09:09:24,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 09:09:24,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:09:24,391 INFO L87 Difference]: Start difference. First operand 207 states and 220 transitions. Second operand 13 states.
[2018-02-02 09:09:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:25,172 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions.
[2018-02-02 09:09:25,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 09:09:25,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20
[2018-02-02 09:09:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:25,174 INFO L225 Difference]: With dead ends: 209
[2018-02-02 09:09:25,174 INFO L226 Difference]: Without dead ends: 209
[2018-02-02 09:09:25,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342
[2018-02-02 09:09:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states.
[2018-02-02 09:09:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208.
[2018-02-02 09:09:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states.
[2018-02-02 09:09:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 221 transitions.
[2018-02-02 09:09:25,181 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 221 transitions. Word has length 20
[2018-02-02 09:09:25,181 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:25,181 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 221 transitions.
[2018-02-02 09:09:25,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 09:09:25,182 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions.
[2018-02-02 09:09:25,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-02-02 09:09:25,182 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:25,182 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]
[2018-02-02 09:09:25,185 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash -30107462, now seen corresponding path program 1 times
[2018-02-02 09:09:25,185 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:25,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:25,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:25,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:25,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:25,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:25,207 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:09:25,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:25,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:09:25,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:09:25,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:09:25,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:09:25,208 INFO L87 Difference]: Start difference. First operand 208 states and 221 transitions. Second operand 4 states.
[2018-02-02 09:09:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:25,225 INFO L93 Difference]: Finished difference Result 294 states and 311 transitions.
[2018-02-02 09:09:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:09:25,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22
[2018-02-02 09:09:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:25,227 INFO L225 Difference]: With dead ends: 294
[2018-02-02 09:09:25,227 INFO L226 Difference]: Without dead ends: 294
[2018-02-02 09:09:25,227 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states.
[2018-02-02 09:09:25,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 258.
[2018-02-02 09:09:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states.
[2018-02-02 09:09:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 311 transitions.
[2018-02-02 09:09:25,231 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 311 transitions. Word has length 22
[2018-02-02 09:09:25,232 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:25,232 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 311 transitions.
[2018-02-02 09:09:25,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:09:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 311 transitions.
[2018-02-02 09:09:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-02 09:09:25,232 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:25,232 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:25,232 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:25,232 INFO L82 PathProgramCache]: Analyzing trace with hash 929227204, now seen corresponding path program 1 times
[2018-02-02 09:09:25,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:25,233 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:25,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:25,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:25,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:25,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:25,268 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:09:25,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:25,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:09:25,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:09:25,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:09:25,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:09:25,270 INFO L87 Difference]: Start difference. First operand 258 states and 311 transitions. Second operand 4 states.
[2018-02-02 09:09:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:25,420 INFO L93 Difference]: Finished difference Result 247 states and 287 transitions.
[2018-02-02 09:09:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 09:09:25,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26
[2018-02-02 09:09:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:25,422 INFO L225 Difference]: With dead ends: 247
[2018-02-02 09:09:25,423 INFO L226 Difference]: Without dead ends: 247
[2018-02-02 09:09:25,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states.
[2018-02-02 09:09:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245.
[2018-02-02 09:09:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states.
[2018-02-02 09:09:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 285 transitions.
[2018-02-02 09:09:25,428 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 285 transitions. Word has length 26
[2018-02-02 09:09:25,428 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:25,429 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 285 transitions.
[2018-02-02 09:09:25,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:09:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 285 transitions.
[2018-02-02 09:09:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-02 09:09:25,429 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:25,429 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:25,430 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash 929227205, now seen corresponding path program 1 times
[2018-02-02 09:09:25,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:25,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:25,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:25,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:25,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:25,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:25,484 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:09:25,484 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:25,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:09:25,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:09:25,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:09:25,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:25,485 INFO L87 Difference]: Start difference. First operand 245 states and 285 transitions. Second operand 5 states.
[2018-02-02 09:09:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:25,696 INFO L93 Difference]: Finished difference Result 234 states and 261 transitions.
[2018-02-02 09:09:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 09:09:25,697 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26
[2018-02-02 09:09:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:25,698 INFO L225 Difference]: With dead ends: 234
[2018-02-02 09:09:25,698 INFO L226 Difference]: Without dead ends: 234
[2018-02-02 09:09:25,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:09:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states.
[2018-02-02 09:09:25,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232.
[2018-02-02 09:09:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states.
[2018-02-02 09:09:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 259 transitions.
[2018-02-02 09:09:25,704 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 259 transitions. Word has length 26
[2018-02-02 09:09:25,704 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:25,704 INFO L432 AbstractCegarLoop]: Abstraction has 232 states and 259 transitions.
[2018-02-02 09:09:25,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:09:25,704 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 259 transitions.
[2018-02-02 09:09:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-02 09:09:25,705 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:25,705 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:25,705 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:25,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437674, now seen corresponding path program 1 times
[2018-02-02 09:09:25,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:25,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:25,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:25,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:25,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:25,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:25,768 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:09:25,768 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:25,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:09:25,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:09:25,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:09:25,769 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:25,769 INFO L87 Difference]: Start difference. First operand 232 states and 259 transitions. Second operand 5 states.
[2018-02-02 09:09:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:26,111 INFO L93 Difference]: Finished difference Result 299 states and 339 transitions.
[2018-02-02 09:09:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:09:26,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32
[2018-02-02 09:09:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:26,113 INFO L225 Difference]: With dead ends: 299
[2018-02-02 09:09:26,113 INFO L226 Difference]: Without dead ends: 299
[2018-02-02 09:09:26,113 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:09:26,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states.
[2018-02-02 09:09:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 242.
[2018-02-02 09:09:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states.
[2018-02-02 09:09:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 273 transitions.
[2018-02-02 09:09:26,119 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 273 transitions. Word has length 32
[2018-02-02 09:09:26,119 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:26,120 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 273 transitions.
[2018-02-02 09:09:26,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:09:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 273 transitions.
[2018-02-02 09:09:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-02 09:09:26,120 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:26,120 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:26,121 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2007437675, now seen corresponding path program 1 times
[2018-02-02 09:09:26,121 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:26,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:26,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:26,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:26,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:26,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:26,217 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:09:26,217 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:26,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:09:26,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:09:26,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:09:26,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:09:26,218 INFO L87 Difference]: Start difference. First operand 242 states and 273 transitions. Second operand 6 states.
[2018-02-02 09:09:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:26,395 INFO L93 Difference]: Finished difference Result 250 states and 277 transitions.
[2018-02-02 09:09:26,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 09:09:26,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32
[2018-02-02 09:09:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:26,396 INFO L225 Difference]: With dead ends: 250
[2018-02-02 09:09:26,396 INFO L226 Difference]: Without dead ends: 250
[2018-02-02 09:09:26,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2018-02-02 09:09:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states.
[2018-02-02 09:09:26,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242.
[2018-02-02 09:09:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states.
[2018-02-02 09:09:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions.
[2018-02-02 09:09:26,402 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 32
[2018-02-02 09:09:26,402 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:26,402 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions.
[2018-02-02 09:09:26,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:09:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions.
[2018-02-02 09:09:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-02-02 09:09:26,403 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:26,403 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:26,403 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:26,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2018693333, now seen corresponding path program 1 times
[2018-02-02 09:09:26,403 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:26,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:26,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:26,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:26,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:26,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:26,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:26,547 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:09:26,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:26,617 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:26,642 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:09:26,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-02 09:09:26,673 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:26,673 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:26,675 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:09:26,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15
[2018-02-02 09:09:26,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-02 09:09:26,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9
[2018-02-02 09:09:26,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27
[2018-02-02 09:09:26,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57
[2018-02-02 09:09:26,753 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 32 treesize of output 1
[2018-02-02 09:09:26,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:27
[2018-02-02 09:09:26,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25
[2018-02-02 09:09:26,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10
[2018-02-02 09:09:26,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:26,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:26,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15
[2018-02-02 09:09:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 09:09:26,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:26,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12
[2018-02-02 09:09:26,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 09:09:26,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 09:09:26,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:09:26,807 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand 13 states.
[2018-02-02 09:09:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:27,085 INFO L93 Difference]: Finished difference Result 249 states and 275 transitions.
[2018-02-02 09:09:27,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 09:09:27,085 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39
[2018-02-02 09:09:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:27,086 INFO L225 Difference]: With dead ends: 249
[2018-02-02 09:09:27,086 INFO L226 Difference]: Without dead ends: 249
[2018-02-02 09:09:27,086 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2018-02-02 09:09:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states.
[2018-02-02 09:09:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 241.
[2018-02-02 09:09:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states.
[2018-02-02 09:09:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 267 transitions.
[2018-02-02 09:09:27,091 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 267 transitions. Word has length 39
[2018-02-02 09:09:27,091 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:27,092 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 267 transitions.
[2018-02-02 09:09:27,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 09:09:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 267 transitions.
[2018-02-02 09:09:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-02-02 09:09:27,094 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:27,094 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:27,094 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:27,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2018693334, now seen corresponding path program 1 times
[2018-02-02 09:09:27,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:27,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:27,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:27,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:27,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:27,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:27,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:27,347 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:09:27,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:27,389 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:27,394 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:09:27,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-02 09:09:27,407 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:09:27,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,414 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:27,415 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:27,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:09:27,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13
[2018-02-02 09:09:27,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-02 09:09:27,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9
[2018-02-02 09:09:27,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-02 09:09:27,449 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 10 treesize of output 9
[2018-02-02 09:09:27,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31
[2018-02-02 09:09:27,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98
[2018-02-02 09:09:27,516 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 32 treesize of output 1
[2018-02-02 09:09:27,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52
[2018-02-02 09:09:27,539 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 32 treesize of output 1
[2018-02-02 09:09:27,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:34
[2018-02-02 09:09:27,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25
[2018-02-02 09:09:27,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10
[2018-02-02 09:09:27,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15
[2018-02-02 09:09:27,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3
[2018-02-02 09:09:27,591 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:27,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12
[2018-02-02 09:09:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:27,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:27,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14
[2018-02-02 09:09:27,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 09:09:27,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 09:09:27,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210
[2018-02-02 09:09:27,635 INFO L87 Difference]: Start difference. First operand 241 states and 267 transitions. Second operand 15 states.
[2018-02-02 09:09:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:28,279 INFO L93 Difference]: Finished difference Result 270 states and 295 transitions.
[2018-02-02 09:09:28,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-02-02 09:09:28,279 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39
[2018-02-02 09:09:28,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:28,280 INFO L225 Difference]: With dead ends: 270
[2018-02-02 09:09:28,281 INFO L226 Difference]: Without dead ends: 270
[2018-02-02 09:09:28,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600
[2018-02-02 09:09:28,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states.
[2018-02-02 09:09:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 262.
[2018-02-02 09:09:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states.
[2018-02-02 09:09:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 287 transitions.
[2018-02-02 09:09:28,287 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 287 transitions. Word has length 39
[2018-02-02 09:09:28,287 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:28,287 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 287 transitions.
[2018-02-02 09:09:28,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 09:09:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 287 transitions.
[2018-02-02 09:09:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-02-02 09:09:28,288 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:28,288 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:28,288 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1460771081, now seen corresponding path program 1 times
[2018-02-02 09:09:28,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:28,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:28,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:28,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:28,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:28,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2018-02-02 09:09:28,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:28,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:09:28,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:09:28,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:09:28,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:09:28,340 INFO L87 Difference]: Start difference. First operand 262 states and 287 transitions. Second operand 4 states.
[2018-02-02 09:09:28,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:28,491 INFO L93 Difference]: Finished difference Result 264 states and 285 transitions.
[2018-02-02 09:09:28,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 09:09:28,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63
[2018-02-02 09:09:28,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:28,492 INFO L225 Difference]: With dead ends: 264
[2018-02-02 09:09:28,493 INFO L226 Difference]: Without dead ends: 264
[2018-02-02 09:09:28,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states.
[2018-02-02 09:09:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 258.
[2018-02-02 09:09:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states.
[2018-02-02 09:09:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 279 transitions.
[2018-02-02 09:09:28,498 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 279 transitions. Word has length 63
[2018-02-02 09:09:28,498 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:28,498 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 279 transitions.
[2018-02-02 09:09:28,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:09:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 279 transitions.
[2018-02-02 09:09:28,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2018-02-02 09:09:28,499 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:28,499 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:28,499 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1460771082, now seen corresponding path program 1 times
[2018-02-02 09:09:28,500 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:28,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:28,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:28,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:28,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:28,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2018-02-02 09:09:28,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:28,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-02 09:09:28,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:09:28,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:09:28,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:09:28,554 INFO L87 Difference]: Start difference. First operand 258 states and 279 transitions. Second operand 4 states.
[2018-02-02 09:09:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:28,705 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions.
[2018-02-02 09:09:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 09:09:28,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63
[2018-02-02 09:09:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:28,707 INFO L225 Difference]: With dead ends: 260
[2018-02-02 09:09:28,707 INFO L226 Difference]: Without dead ends: 260
[2018-02-02 09:09:28,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states.
[2018-02-02 09:09:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254.
[2018-02-02 09:09:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states.
[2018-02-02 09:09:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 271 transitions.
[2018-02-02 09:09:28,713 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 271 transitions. Word has length 63
[2018-02-02 09:09:28,714 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:28,714 INFO L432 AbstractCegarLoop]: Abstraction has 254 states and 271 transitions.
[2018-02-02 09:09:28,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:09:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions.
[2018-02-02 09:09:28,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2018-02-02 09:09:28,717 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:28,717 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:09:28,717 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:28,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2050431775, now seen corresponding path program 1 times
[2018-02-02 09:09:28,717 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:28,717 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:28,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:28,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:28,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:28,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:28,784 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:28,784 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:09:28,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:28,825 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:28,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:28,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7
[2018-02-02 09:09:28,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 09:09:28,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 09:09:28,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:09:28,859 INFO L87 Difference]: Start difference. First operand 254 states and 271 transitions. Second operand 7 states.
[2018-02-02 09:09:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:28,875 INFO L93 Difference]: Finished difference Result 278 states and 295 transitions.
[2018-02-02 09:09:28,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:09:28,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66
[2018-02-02 09:09:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:28,876 INFO L225 Difference]: With dead ends: 278
[2018-02-02 09:09:28,876 INFO L226 Difference]: Without dead ends: 278
[2018-02-02 09:09:28,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:09:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states.
[2018-02-02 09:09:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 268.
[2018-02-02 09:09:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states.
[2018-02-02 09:09:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 285 transitions.
[2018-02-02 09:09:28,880 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 285 transitions. Word has length 66
[2018-02-02 09:09:28,880 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:28,880 INFO L432 AbstractCegarLoop]: Abstraction has 268 states and 285 transitions.
[2018-02-02 09:09:28,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 09:09:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 285 transitions.
[2018-02-02 09:09:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-02-02 09:09:28,881 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:28,881 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:28,881 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1137393610, now seen corresponding path program 2 times
[2018-02-02 09:09:28,881 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:28,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:28,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:28,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:28,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:28,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:28,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:28,948 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:28,954 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:09:28,979 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:09:28,984 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:09:28,987 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:28,990 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:09:28,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:28,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:28,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-02 09:09:29,039 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1)))) is different from true
[2018-02-02 09:09:29,056 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1)))) is different from true
[2018-02-02 09:09:29,119 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:29,120 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:29,121 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:09:29,136 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 23 treesize of output 20
[2018-02-02 09:09:29,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:29,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:29,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:29,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20
[2018-02-02 09:09:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked.
[2018-02-02 09:09:29,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:09:29,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 14
[2018-02-02 09:09:29,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-02-02 09:09:29,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-02-02 09:09:29,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=102, Unknown=2, NotChecked=42, Total=182
[2018-02-02 09:09:29,212 INFO L87 Difference]: Start difference. First operand 268 states and 285 transitions. Second operand 14 states.
[2018-02-02 09:09:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:29,592 INFO L93 Difference]: Finished difference Result 336 states and 362 transitions.
[2018-02-02 09:09:29,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 09:09:29,593 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73
[2018-02-02 09:09:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:29,594 INFO L225 Difference]: With dead ends: 336
[2018-02-02 09:09:29,594 INFO L226 Difference]: Without dead ends: 336
[2018-02-02 09:09:29,595 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=222, Unknown=17, NotChecked=66, Total=380
[2018-02-02 09:09:29,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states.
[2018-02-02 09:09:29,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 303.
[2018-02-02 09:09:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states.
[2018-02-02 09:09:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 328 transitions.
[2018-02-02 09:09:29,601 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 328 transitions. Word has length 73
[2018-02-02 09:09:29,601 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:29,601 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 328 transitions.
[2018-02-02 09:09:29,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-02-02 09:09:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 328 transitions.
[2018-02-02 09:09:29,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2018-02-02 09:09:29,602 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:29,602 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:29,602 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:29,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1500484800, now seen corresponding path program 1 times
[2018-02-02 09:09:29,602 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:29,603 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:29,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:29,603 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:09:29,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:29,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:09:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:29,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:29,692 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:29,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:29,791 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:29,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:29,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9
[2018-02-02 09:09:29,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 09:09:29,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 09:09:29,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:09:29,844 INFO L87 Difference]: Start difference. First operand 303 states and 328 transitions. Second operand 9 states.
[2018-02-02 09:09:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:29,866 INFO L93 Difference]: Finished difference Result 327 states and 352 transitions.
[2018-02-02 09:09:29,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 09:09:29,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80
[2018-02-02 09:09:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:29,874 INFO L225 Difference]: With dead ends: 327
[2018-02-02 09:09:29,874 INFO L226 Difference]: Without dead ends: 327
[2018-02-02 09:09:29,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:09:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states.
[2018-02-02 09:09:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317.
[2018-02-02 09:09:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states.
[2018-02-02 09:09:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 342 transitions.
[2018-02-02 09:09:29,877 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 342 transitions. Word has length 80
[2018-02-02 09:09:29,878 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:29,878 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 342 transitions.
[2018-02-02 09:09:29,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 09:09:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 342 transitions.
[2018-02-02 09:09:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2018-02-02 09:09:29,878 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:29,878 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:29,878 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1333480917, now seen corresponding path program 2 times
[2018-02-02 09:09:29,879 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:29,879 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:29,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:29,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:29,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:29,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:29,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:29,947 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:29,952 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:09:29,973 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:09:29,976 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:09:29,979 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:30,067 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true
[2018-02-02 09:09:30,165 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:30,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23
[2018-02-02 09:09:30,175 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:30,193 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:30,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36
[2018-02-02 09:09:30,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:30,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:30,226 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:30,227 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:30,228 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:30,229 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:30,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-02-02 09:09:30,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:30,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:30,240 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29
[2018-02-02 09:09:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked.
[2018-02-02 09:09:30,325 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:09:30,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17
[2018-02-02 09:09:30,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 09:09:30,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 09:09:30,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272
[2018-02-02 09:09:30,327 INFO L87 Difference]: Start difference. First operand 317 states and 342 transitions. Second operand 17 states.
[2018-02-02 09:09:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:31,244 INFO L93 Difference]: Finished difference Result 371 states and 397 transitions.
[2018-02-02 09:09:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-02 09:09:31,244 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 87
[2018-02-02 09:09:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:31,246 INFO L225 Difference]: With dead ends: 371
[2018-02-02 09:09:31,246 INFO L226 Difference]: Without dead ends: 371
[2018-02-02 09:09:31,246 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=484, Unknown=37, NotChecked=48, Total=702
[2018-02-02 09:09:31,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states.
[2018-02-02 09:09:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 345.
[2018-02-02 09:09:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states.
[2018-02-02 09:09:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 374 transitions.
[2018-02-02 09:09:31,252 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 374 transitions. Word has length 87
[2018-02-02 09:09:31,253 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:31,253 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 374 transitions.
[2018-02-02 09:09:31,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 09:09:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 374 transitions.
[2018-02-02 09:09:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2018-02-02 09:09:31,254 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:31,254 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:31,254 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1993221762, now seen corresponding path program 1 times
[2018-02-02 09:09:31,255 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:31,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:31,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:31,255 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:09:31,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:31,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked.
[2018-02-02 09:09:31,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:31,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:09:31,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:09:31,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:09:31,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:09:31,333 INFO L87 Difference]: Start difference. First operand 345 states and 374 transitions. Second operand 4 states.
[2018-02-02 09:09:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:31,348 INFO L93 Difference]: Finished difference Result 353 states and 378 transitions.
[2018-02-02 09:09:31,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:09:31,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96
[2018-02-02 09:09:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:31,350 INFO L225 Difference]: With dead ends: 353
[2018-02-02 09:09:31,350 INFO L226 Difference]: Without dead ends: 353
[2018-02-02 09:09:31,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:31,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states.
[2018-02-02 09:09:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351.
[2018-02-02 09:09:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states.
[2018-02-02 09:09:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 376 transitions.
[2018-02-02 09:09:31,360 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 376 transitions. Word has length 96
[2018-02-02 09:09:31,360 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:31,360 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 376 transitions.
[2018-02-02 09:09:31,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:09:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 376 transitions.
[2018-02-02 09:09:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2018-02-02 09:09:31,361 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:31,361 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:31,361 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash -550586226, now seen corresponding path program 1 times
[2018-02-02 09:09:31,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:31,362 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:31,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:31,362 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:31,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:31,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:31,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:31,463 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:31,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:31,507 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:31,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:31,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11
[2018-02-02 09:09:31,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 09:09:31,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 09:09:31,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2018-02-02 09:09:31,545 INFO L87 Difference]: Start difference. First operand 351 states and 376 transitions. Second operand 11 states.
[2018-02-02 09:09:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:31,570 INFO L93 Difference]: Finished difference Result 375 states and 400 transitions.
[2018-02-02 09:09:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-02 09:09:31,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96
[2018-02-02 09:09:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:31,573 INFO L225 Difference]: With dead ends: 375
[2018-02-02 09:09:31,573 INFO L226 Difference]: Without dead ends: 375
[2018-02-02 09:09:31,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110
[2018-02-02 09:09:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states.
[2018-02-02 09:09:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 365.
[2018-02-02 09:09:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states.
[2018-02-02 09:09:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 390 transitions.
[2018-02-02 09:09:31,579 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 390 transitions. Word has length 96
[2018-02-02 09:09:31,579 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:31,579 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 390 transitions.
[2018-02-02 09:09:31,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 09:09:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 390 transitions.
[2018-02-02 09:09:31,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104
[2018-02-02 09:09:31,580 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:31,580 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:31,580 INFO L371 AbstractCegarLoop]: === Iteration 23 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:31,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1634312185, now seen corresponding path program 2 times
[2018-02-02 09:09:31,580 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:31,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:31,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:31,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:31,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:31,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:31,680 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:31,680 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:31,688 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:09:31,710 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:09:31,713 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:09:31,715 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:31,732 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1)))) is different from true
[2018-02-02 09:09:31,737 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1)))) is different from true
[2018-02-02 09:09:31,784 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:31,785 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:31,786 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:09:31,790 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 23 treesize of output 20
[2018-02-02 09:09:31,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:31,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:31,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:31,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20
[2018-02-02 09:09:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked.
[2018-02-02 09:09:31,858 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:09:32,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16
[2018-02-02 09:09:32,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-02-02 09:09:32,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-02-02 09:09:32,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=122, Unknown=2, NotChecked=50, Total=240
[2018-02-02 09:09:32,050 INFO L87 Difference]: Start difference. First operand 365 states and 390 transitions. Second operand 16 states.
[2018-02-02 09:09:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:32,436 INFO L93 Difference]: Finished difference Result 397 states and 423 transitions.
[2018-02-02 09:09:32,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 09:09:32,436 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103
[2018-02-02 09:09:32,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:32,438 INFO L225 Difference]: With dead ends: 397
[2018-02-02 09:09:32,438 INFO L226 Difference]: Without dead ends: 397
[2018-02-02 09:09:32,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=302, Unknown=47, NotChecked=86, Total=600
[2018-02-02 09:09:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states.
[2018-02-02 09:09:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 383.
[2018-02-02 09:09:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states.
[2018-02-02 09:09:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 410 transitions.
[2018-02-02 09:09:32,444 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 410 transitions. Word has length 103
[2018-02-02 09:09:32,445 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:32,445 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 410 transitions.
[2018-02-02 09:09:32,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-02-02 09:09:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 410 transitions.
[2018-02-02 09:09:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2018-02-02 09:09:32,446 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:32,446 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:32,446 INFO L371 AbstractCegarLoop]: === Iteration 24 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1686805039, now seen corresponding path program 1 times
[2018-02-02 09:09:32,447 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:32,447 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:32,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:32,448 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:09:32,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:32,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:32,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:32,618 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:32,625 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:32,672 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:32,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:32,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13
[2018-02-02 09:09:32,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 09:09:32,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 09:09:32,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:09:32,704 INFO L87 Difference]: Start difference. First operand 383 states and 410 transitions. Second operand 13 states.
[2018-02-02 09:09:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:32,764 INFO L93 Difference]: Finished difference Result 407 states and 434 transitions.
[2018-02-02 09:09:32,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-02 09:09:32,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 110
[2018-02-02 09:09:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:32,767 INFO L225 Difference]: With dead ends: 407
[2018-02-02 09:09:32,767 INFO L226 Difference]: Without dead ends: 407
[2018-02-02 09:09:32,767 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:09:32,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states.
[2018-02-02 09:09:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 397.
[2018-02-02 09:09:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states.
[2018-02-02 09:09:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 424 transitions.
[2018-02-02 09:09:32,775 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 424 transitions. Word has length 110
[2018-02-02 09:09:32,776 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:32,776 INFO L432 AbstractCegarLoop]: Abstraction has 397 states and 424 transitions.
[2018-02-02 09:09:32,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 09:09:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 424 transitions.
[2018-02-02 09:09:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2018-02-02 09:09:32,777 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:32,777 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:32,777 INFO L371 AbstractCegarLoop]: === Iteration 25 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:32,777 INFO L82 PathProgramCache]: Analyzing trace with hash 81439322, now seen corresponding path program 2 times
[2018-02-02 09:09:32,777 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:32,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:32,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:32,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:32,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:32,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:32,905 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:32,905 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:32,912 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:09:32,933 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:09:32,936 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:09:32,939 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:32,976 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true
[2018-02-02 09:09:33,115 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:33,116 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23
[2018-02-02 09:09:33,119 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:33,122 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:33,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36
[2018-02-02 09:09:33,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:33,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:33,143 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:33,144 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:33,144 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:33,145 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:33,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-02-02 09:09:33,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:33,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:33,156 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29
[2018-02-02 09:09:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked.
[2018-02-02 09:09:33,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:09:33,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19
[2018-02-02 09:09:33,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 09:09:33,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 09:09:33,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=217, Unknown=2, NotChecked=32, Total=342
[2018-02-02 09:09:33,287 INFO L87 Difference]: Start difference. First operand 397 states and 424 transitions. Second operand 19 states.
[2018-02-02 09:09:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:34,014 INFO L93 Difference]: Finished difference Result 422 states and 448 transitions.
[2018-02-02 09:09:34,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 09:09:34,015 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 117
[2018-02-02 09:09:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:34,016 INFO L225 Difference]: With dead ends: 422
[2018-02-02 09:09:34,016 INFO L226 Difference]: Without dead ends: 422
[2018-02-02 09:09:34,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=557, Unknown=79, NotChecked=56, Total=930
[2018-02-02 09:09:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states.
[2018-02-02 09:09:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 410.
[2018-02-02 09:09:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states.
[2018-02-02 09:09:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 435 transitions.
[2018-02-02 09:09:34,023 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 435 transitions. Word has length 117
[2018-02-02 09:09:34,023 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:34,023 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 435 transitions.
[2018-02-02 09:09:34,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 09:09:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 435 transitions.
[2018-02-02 09:09:34,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2018-02-02 09:09:34,024 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:34,025 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:34,025 INFO L371 AbstractCegarLoop]: === Iteration 26 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:34,025 INFO L82 PathProgramCache]: Analyzing trace with hash 371670050, now seen corresponding path program 1 times
[2018-02-02 09:09:34,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:34,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:34,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:34,026 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:09:34,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:34,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked.
[2018-02-02 09:09:34,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:34,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:09:34,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:09:34,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:09:34,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:09:34,108 INFO L87 Difference]: Start difference. First operand 410 states and 435 transitions. Second operand 6 states.
[2018-02-02 09:09:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:34,207 INFO L93 Difference]: Finished difference Result 450 states and 479 transitions.
[2018-02-02 09:09:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-02 09:09:34,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124
[2018-02-02 09:09:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:34,209 INFO L225 Difference]: With dead ends: 450
[2018-02-02 09:09:34,209 INFO L226 Difference]: Without dead ends: 450
[2018-02-02 09:09:34,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:09:34,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states.
[2018-02-02 09:09:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 418.
[2018-02-02 09:09:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states.
[2018-02-02 09:09:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 443 transitions.
[2018-02-02 09:09:34,213 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 443 transitions. Word has length 124
[2018-02-02 09:09:34,214 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:34,214 INFO L432 AbstractCegarLoop]: Abstraction has 418 states and 443 transitions.
[2018-02-02 09:09:34,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:09:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 443 transitions.
[2018-02-02 09:09:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2018-02-02 09:09:34,214 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:34,214 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:34,214 INFO L371 AbstractCegarLoop]: === Iteration 27 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1058519163, now seen corresponding path program 1 times
[2018-02-02 09:09:34,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:34,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:34,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:34,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:34,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:34,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:34,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:34,358 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:34,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:34,428 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:34,571 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:34,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15
[2018-02-02 09:09:34,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-02 09:09:34,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-02 09:09:34,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210
[2018-02-02 09:09:34,572 INFO L87 Difference]: Start difference. First operand 418 states and 443 transitions. Second operand 15 states.
[2018-02-02 09:09:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:34,614 INFO L93 Difference]: Finished difference Result 442 states and 467 transitions.
[2018-02-02 09:09:34,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2018-02-02 09:09:34,616 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 126
[2018-02-02 09:09:34,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:34,618 INFO L225 Difference]: With dead ends: 442
[2018-02-02 09:09:34,618 INFO L226 Difference]: Without dead ends: 442
[2018-02-02 09:09:34,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210
[2018-02-02 09:09:34,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states.
[2018-02-02 09:09:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432.
[2018-02-02 09:09:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states.
[2018-02-02 09:09:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 457 transitions.
[2018-02-02 09:09:34,625 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 457 transitions. Word has length 126
[2018-02-02 09:09:34,625 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:34,625 INFO L432 AbstractCegarLoop]: Abstraction has 432 states and 457 transitions.
[2018-02-02 09:09:34,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-02 09:09:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 457 transitions.
[2018-02-02 09:09:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2018-02-02 09:09:34,626 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:34,626 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:34,626 INFO L371 AbstractCegarLoop]: === Iteration 28 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:34,627 INFO L82 PathProgramCache]: Analyzing trace with hash -341794384, now seen corresponding path program 2 times
[2018-02-02 09:09:34,627 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:34,627 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:34,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:34,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:34,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:34,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:34,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:34,805 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:34,812 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:09:34,837 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:09:34,840 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:09:34,843 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:34,845 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:09:34,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:34,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:34,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-02 09:09:34,867 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1)))) is different from true
[2018-02-02 09:09:34,879 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1)))) is different from true
[2018-02-02 09:09:34,935 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:34,943 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:34,944 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27
[2018-02-02 09:09:34,950 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 23 treesize of output 20
[2018-02-02 09:09:34,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:34,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:34,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:34,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20
[2018-02-02 09:09:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked.
[2018-02-02 09:09:35,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:09:35,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21
[2018-02-02 09:09:35,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 09:09:35,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 09:09:35,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=230, Unknown=2, NotChecked=70, Total=420
[2018-02-02 09:09:35,044 INFO L87 Difference]: Start difference. First operand 432 states and 457 transitions. Second operand 21 states.
[2018-02-02 09:09:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:35,672 INFO L93 Difference]: Finished difference Result 486 states and 516 transitions.
[2018-02-02 09:09:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 09:09:35,673 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 133
[2018-02-02 09:09:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:35,674 INFO L225 Difference]: With dead ends: 486
[2018-02-02 09:09:35,674 INFO L226 Difference]: Without dead ends: 486
[2018-02-02 09:09:35,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=654, Unknown=93, NotChecked=126, Total=1190
[2018-02-02 09:09:35,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states.
[2018-02-02 09:09:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 457.
[2018-02-02 09:09:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states.
[2018-02-02 09:09:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 485 transitions.
[2018-02-02 09:09:35,680 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 485 transitions. Word has length 133
[2018-02-02 09:09:35,680 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:35,680 INFO L432 AbstractCegarLoop]: Abstraction has 457 states and 485 transitions.
[2018-02-02 09:09:35,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 09:09:35,680 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 485 transitions.
[2018-02-02 09:09:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2018-02-02 09:09:35,681 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:35,681 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:35,681 INFO L371 AbstractCegarLoop]: === Iteration 29 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:35,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1585549606, now seen corresponding path program 1 times
[2018-02-02 09:09:35,681 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:35,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:35,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:35,682 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:09:35,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:35,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:35,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:35,827 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:35,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:35,882 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:35,939 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:35,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17
[2018-02-02 09:09:35,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-02-02 09:09:35,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-02-02 09:09:35,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272
[2018-02-02 09:09:35,940 INFO L87 Difference]: Start difference. First operand 457 states and 485 transitions. Second operand 17 states.
[2018-02-02 09:09:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:36,018 INFO L93 Difference]: Finished difference Result 481 states and 509 transitions.
[2018-02-02 09:09:36,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 09:09:36,019 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 140
[2018-02-02 09:09:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:36,020 INFO L225 Difference]: With dead ends: 481
[2018-02-02 09:09:36,020 INFO L226 Difference]: Without dead ends: 481
[2018-02-02 09:09:36,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272
[2018-02-02 09:09:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states.
[2018-02-02 09:09:36,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 471.
[2018-02-02 09:09:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states.
[2018-02-02 09:09:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 499 transitions.
[2018-02-02 09:09:36,026 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 499 transitions. Word has length 140
[2018-02-02 09:09:36,027 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:36,027 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 499 transitions.
[2018-02-02 09:09:36,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-02-02 09:09:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 499 transitions.
[2018-02-02 09:09:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2018-02-02 09:09:36,027 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:36,028 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:36,028 INFO L371 AbstractCegarLoop]: === Iteration 30 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:36,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1569766383, now seen corresponding path program 2 times
[2018-02-02 09:09:36,028 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:36,028 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:36,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:36,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:36,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:36,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:36,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:36,203 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:36,208 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:09:36,231 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:09:36,234 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:09:36,236 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:36,300 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true
[2018-02-02 09:09:36,352 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:36,354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23
[2018-02-02 09:09:36,356 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:36,358 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:36,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36
[2018-02-02 09:09:36,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:36,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:36,379 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:36,379 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:36,380 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:36,380 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:36,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-02-02 09:09:36,381 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:36,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:36,389 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29
[2018-02-02 09:09:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked.
[2018-02-02 09:09:36,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:09:36,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25
[2018-02-02 09:09:36,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-02-02 09:09:36,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-02-02 09:09:36,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=399, Unknown=2, NotChecked=44, Total=600
[2018-02-02 09:09:36,474 INFO L87 Difference]: Start difference. First operand 471 states and 499 transitions. Second operand 25 states.
[2018-02-02 09:09:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:37,255 INFO L93 Difference]: Finished difference Result 513 states and 543 transitions.
[2018-02-02 09:09:37,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-02 09:09:37,255 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 147
[2018-02-02 09:09:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:37,256 INFO L225 Difference]: With dead ends: 513
[2018-02-02 09:09:37,256 INFO L226 Difference]: Without dead ends: 513
[2018-02-02 09:09:37,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=1238, Unknown=137, NotChecked=82, Total=1892
[2018-02-02 09:09:37,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states.
[2018-02-02 09:09:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 485.
[2018-02-02 09:09:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states.
[2018-02-02 09:09:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 512 transitions.
[2018-02-02 09:09:37,261 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 512 transitions. Word has length 147
[2018-02-02 09:09:37,261 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:37,261 INFO L432 AbstractCegarLoop]: Abstraction has 485 states and 512 transitions.
[2018-02-02 09:09:37,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-02-02 09:09:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 512 transitions.
[2018-02-02 09:09:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2018-02-02 09:09:37,262 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:37,262 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:37,262 INFO L371 AbstractCegarLoop]: === Iteration 31 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:37,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1299860795, now seen corresponding path program 1 times
[2018-02-02 09:09:37,262 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:37,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:37,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:37,263 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:09:37,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:37,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked.
[2018-02-02 09:09:37,327 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:37,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:09:37,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:09:37,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:09:37,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:37,328 INFO L87 Difference]: Start difference. First operand 485 states and 512 transitions. Second operand 5 states.
[2018-02-02 09:09:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:37,468 INFO L93 Difference]: Finished difference Result 484 states and 511 transitions.
[2018-02-02 09:09:37,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:09:37,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155
[2018-02-02 09:09:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:37,470 INFO L225 Difference]: With dead ends: 484
[2018-02-02 09:09:37,470 INFO L226 Difference]: Without dead ends: 484
[2018-02-02 09:09:37,470 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:09:37,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states.
[2018-02-02 09:09:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484.
[2018-02-02 09:09:37,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states.
[2018-02-02 09:09:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 511 transitions.
[2018-02-02 09:09:37,477 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 511 transitions. Word has length 155
[2018-02-02 09:09:37,477 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:37,478 INFO L432 AbstractCegarLoop]: Abstraction has 484 states and 511 transitions.
[2018-02-02 09:09:37,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:09:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 511 transitions.
[2018-02-02 09:09:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2018-02-02 09:09:37,479 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:37,479 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:37,479 INFO L371 AbstractCegarLoop]: === Iteration 32 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1299860794, now seen corresponding path program 1 times
[2018-02-02 09:09:37,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:37,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:37,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:37,480 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:37,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:37,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:37,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:37,803 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:37,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:37,858 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:37,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:37,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19
[2018-02-02 09:09:37,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 09:09:37,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 09:09:37,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342
[2018-02-02 09:09:37,914 INFO L87 Difference]: Start difference. First operand 484 states and 511 transitions. Second operand 19 states.
[2018-02-02 09:09:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:37,953 INFO L93 Difference]: Finished difference Result 508 states and 535 transitions.
[2018-02-02 09:09:37,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-02 09:09:37,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 155
[2018-02-02 09:09:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:37,954 INFO L225 Difference]: With dead ends: 508
[2018-02-02 09:09:37,954 INFO L226 Difference]: Without dead ends: 508
[2018-02-02 09:09:37,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342
[2018-02-02 09:09:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states.
[2018-02-02 09:09:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 498.
[2018-02-02 09:09:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states.
[2018-02-02 09:09:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 525 transitions.
[2018-02-02 09:09:37,958 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 525 transitions. Word has length 155
[2018-02-02 09:09:37,958 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:37,958 INFO L432 AbstractCegarLoop]: Abstraction has 498 states and 525 transitions.
[2018-02-02 09:09:37,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 09:09:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 525 transitions.
[2018-02-02 09:09:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2018-02-02 09:09:37,959 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:37,959 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:37,959 INFO L371 AbstractCegarLoop]: === Iteration 33 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:37,960 INFO L82 PathProgramCache]: Analyzing trace with hash -198939525, now seen corresponding path program 2 times
[2018-02-02 09:09:37,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:37,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:37,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:37,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:37,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:37,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:38,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:38,152 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:38,156 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:09:38,180 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:09:38,183 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:09:38,185 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked.
[2018-02-02 09:09:38,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:09:38,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 24
[2018-02-02 09:09:38,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-02 09:09:38,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-02 09:09:38,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552
[2018-02-02 09:09:38,267 INFO L87 Difference]: Start difference. First operand 498 states and 525 transitions. Second operand 24 states.
[2018-02-02 09:09:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:38,586 INFO L93 Difference]: Finished difference Result 515 states and 542 transitions.
[2018-02-02 09:09:38,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-02-02 09:09:38,586 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 162
[2018-02-02 09:09:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:38,588 INFO L225 Difference]: With dead ends: 515
[2018-02-02 09:09:38,588 INFO L226 Difference]: Without dead ends: 515
[2018-02-02 09:09:38,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650
[2018-02-02 09:09:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states.
[2018-02-02 09:09:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 505.
[2018-02-02 09:09:38,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states.
[2018-02-02 09:09:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 532 transitions.
[2018-02-02 09:09:38,594 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 532 transitions. Word has length 162
[2018-02-02 09:09:38,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:38,595 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 532 transitions.
[2018-02-02 09:09:38,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-02 09:09:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 532 transitions.
[2018-02-02 09:09:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2018-02-02 09:09:38,596 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:38,596 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:38,596 INFO L371 AbstractCegarLoop]: === Iteration 34 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1667147789, now seen corresponding path program 1 times
[2018-02-02 09:09:38,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:38,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:38,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:38,597 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:09:38,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:38,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:38,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked.
[2018-02-02 09:09:38,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:38,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:09:38,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 09:09:38,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 09:09:38,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:09:38,715 INFO L87 Difference]: Start difference. First operand 505 states and 532 transitions. Second operand 7 states.
[2018-02-02 09:09:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:38,915 INFO L93 Difference]: Finished difference Result 519 states and 548 transitions.
[2018-02-02 09:09:38,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 09:09:38,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170
[2018-02-02 09:09:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:38,919 INFO L225 Difference]: With dead ends: 519
[2018-02-02 09:09:38,920 INFO L226 Difference]: Without dead ends: 519
[2018-02-02 09:09:38,920 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2018-02-02 09:09:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states.
[2018-02-02 09:09:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 504.
[2018-02-02 09:09:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states.
[2018-02-02 09:09:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 531 transitions.
[2018-02-02 09:09:38,928 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 531 transitions. Word has length 170
[2018-02-02 09:09:38,928 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:38,928 INFO L432 AbstractCegarLoop]: Abstraction has 504 states and 531 transitions.
[2018-02-02 09:09:38,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 09:09:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 531 transitions.
[2018-02-02 09:09:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171
[2018-02-02 09:09:38,929 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:38,929 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:38,930 INFO L371 AbstractCegarLoop]: === Iteration 35 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1667147788, now seen corresponding path program 1 times
[2018-02-02 09:09:38,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:38,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:38,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:38,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:38,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:38,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:39,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:39,213 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:39,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:39,292 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:39,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:39,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21
[2018-02-02 09:09:39,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-02 09:09:39,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-02 09:09:39,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420
[2018-02-02 09:09:39,356 INFO L87 Difference]: Start difference. First operand 504 states and 531 transitions. Second operand 21 states.
[2018-02-02 09:09:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:39,427 INFO L93 Difference]: Finished difference Result 528 states and 555 transitions.
[2018-02-02 09:09:39,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-02 09:09:39,428 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 170
[2018-02-02 09:09:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:39,429 INFO L225 Difference]: With dead ends: 528
[2018-02-02 09:09:39,430 INFO L226 Difference]: Without dead ends: 528
[2018-02-02 09:09:39,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420
[2018-02-02 09:09:39,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2018-02-02 09:09:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 518.
[2018-02-02 09:09:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states.
[2018-02-02 09:09:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 545 transitions.
[2018-02-02 09:09:39,435 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 545 transitions. Word has length 170
[2018-02-02 09:09:39,436 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:39,436 INFO L432 AbstractCegarLoop]: Abstraction has 518 states and 545 transitions.
[2018-02-02 09:09:39,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-02 09:09:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 545 transitions.
[2018-02-02 09:09:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178
[2018-02-02 09:09:39,437 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:39,437 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:39,437 INFO L371 AbstractCegarLoop]: === Iteration 36 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:39,437 INFO L82 PathProgramCache]: Analyzing trace with hash 280714655, now seen corresponding path program 2 times
[2018-02-02 09:09:39,437 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:39,437 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:39,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:39,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:39,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:39,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:39,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:39,694 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:39,698 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:09:39,724 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:09:39,727 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:09:39,729 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:39,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:09:39,781 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 8 treesize of output 7
[2018-02-02 09:09:39,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-02-02 09:09:39,790 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 8 treesize of output 7
[2018-02-02 09:09:39,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,816 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:23
[2018-02-02 09:09:39,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19
[2018-02-02 09:09:39,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2018-02-02 09:09:39,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20
[2018-02-02 09:09:39,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11
[2018-02-02 09:09:39,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:39,874 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11
[2018-02-02 09:09:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked.
[2018-02-02 09:09:39,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:09:39,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [21] total 27
[2018-02-02 09:09:39,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-02-02 09:09:39,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-02-02 09:09:39,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702
[2018-02-02 09:09:39,921 INFO L87 Difference]: Start difference. First operand 518 states and 545 transitions. Second operand 27 states.
[2018-02-02 09:09:40,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:40,447 INFO L93 Difference]: Finished difference Result 566 states and 595 transitions.
[2018-02-02 09:09:40,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states.
[2018-02-02 09:09:40,447 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 177
[2018-02-02 09:09:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:40,448 INFO L225 Difference]: With dead ends: 566
[2018-02-02 09:09:40,449 INFO L226 Difference]: Without dead ends: 566
[2018-02-02 09:09:40,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870
[2018-02-02 09:09:40,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states.
[2018-02-02 09:09:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 531.
[2018-02-02 09:09:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states.
[2018-02-02 09:09:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 558 transitions.
[2018-02-02 09:09:40,453 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 558 transitions. Word has length 177
[2018-02-02 09:09:40,453 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:40,453 INFO L432 AbstractCegarLoop]: Abstraction has 531 states and 558 transitions.
[2018-02-02 09:09:40,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-02-02 09:09:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 558 transitions.
[2018-02-02 09:09:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185
[2018-02-02 09:09:40,454 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:40,454 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:40,454 INFO L371 AbstractCegarLoop]: === Iteration 37 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1058140492, now seen corresponding path program 1 times
[2018-02-02 09:09:40,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:40,455 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:40,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:40,455 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:09:40,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:40,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:40,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:40,669 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:40,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:40,730 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:09:40,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:40,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23
[2018-02-02 09:09:40,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-02-02 09:09:40,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-02-02 09:09:40,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506
[2018-02-02 09:09:40,781 INFO L87 Difference]: Start difference. First operand 531 states and 558 transitions. Second operand 23 states.
[2018-02-02 09:09:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:40,838 INFO L93 Difference]: Finished difference Result 545 states and 572 transitions.
[2018-02-02 09:09:40,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-02 09:09:40,839 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 184
[2018-02-02 09:09:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:40,840 INFO L225 Difference]: With dead ends: 545
[2018-02-02 09:09:40,840 INFO L226 Difference]: Without dead ends: 545
[2018-02-02 09:09:40,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506
[2018-02-02 09:09:40,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states.
[2018-02-02 09:09:40,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545.
[2018-02-02 09:09:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states.
[2018-02-02 09:09:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 572 transitions.
[2018-02-02 09:09:40,845 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 572 transitions. Word has length 184
[2018-02-02 09:09:40,845 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:40,845 INFO L432 AbstractCegarLoop]: Abstraction has 545 states and 572 transitions.
[2018-02-02 09:09:40,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-02-02 09:09:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 572 transitions.
[2018-02-02 09:09:40,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192
[2018-02-02 09:09:40,846 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:40,846 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:40,846 INFO L371 AbstractCegarLoop]: === Iteration 38 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:40,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1311460639, now seen corresponding path program 2 times
[2018-02-02 09:09:40,847 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:40,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:40,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:40,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:40,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:40,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked.
[2018-02-02 09:09:41,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:41,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-02 09:09:41,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-02 09:09:41,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-02 09:09:41,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:09:41,249 INFO L87 Difference]: Start difference. First operand 545 states and 572 transitions. Second operand 8 states.
[2018-02-02 09:09:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:41,838 INFO L93 Difference]: Finished difference Result 563 states and 589 transitions.
[2018-02-02 09:09:41,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 09:09:41,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191
[2018-02-02 09:09:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:41,840 INFO L225 Difference]: With dead ends: 563
[2018-02-02 09:09:41,840 INFO L226 Difference]: Without dead ends: 563
[2018-02-02 09:09:41,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2018-02-02 09:09:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states.
[2018-02-02 09:09:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 556.
[2018-02-02 09:09:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states.
[2018-02-02 09:09:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 587 transitions.
[2018-02-02 09:09:41,846 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 587 transitions. Word has length 191
[2018-02-02 09:09:41,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:41,846 INFO L432 AbstractCegarLoop]: Abstraction has 556 states and 587 transitions.
[2018-02-02 09:09:41,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-02 09:09:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 587 transitions.
[2018-02-02 09:09:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192
[2018-02-02 09:09:41,847 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:41,847 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:41,848 INFO L371 AbstractCegarLoop]: === Iteration 39 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:41,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1311460640, now seen corresponding path program 1 times
[2018-02-02 09:09:41,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:41,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:41,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:41,849 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:09:41,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:42,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked.
[2018-02-02 09:09:42,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:42,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-02-02 09:09:42,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-02 09:09:42,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-02 09:09:42,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2018-02-02 09:09:42,460 INFO L87 Difference]: Start difference. First operand 556 states and 587 transitions. Second operand 12 states.
[2018-02-02 09:09:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:42,933 INFO L93 Difference]: Finished difference Result 562 states and 587 transitions.
[2018-02-02 09:09:42,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 09:09:42,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 191
[2018-02-02 09:09:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:42,935 INFO L225 Difference]: With dead ends: 562
[2018-02-02 09:09:42,935 INFO L226 Difference]: Without dead ends: 562
[2018-02-02 09:09:42,936 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380
[2018-02-02 09:09:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states.
[2018-02-02 09:09:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 544.
[2018-02-02 09:09:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states.
[2018-02-02 09:09:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 572 transitions.
[2018-02-02 09:09:42,942 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 572 transitions. Word has length 191
[2018-02-02 09:09:42,942 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:42,942 INFO L432 AbstractCegarLoop]: Abstraction has 544 states and 572 transitions.
[2018-02-02 09:09:42,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-02 09:09:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 572 transitions.
[2018-02-02 09:09:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2018-02-02 09:09:42,943 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:42,943 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:42,944 INFO L371 AbstractCegarLoop]: === Iteration 40 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash -166105366, now seen corresponding path program 1 times
[2018-02-02 09:09:42,944 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:42,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:42,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:42,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:42,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:42,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked.
[2018-02-02 09:09:43,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:43,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2018-02-02 09:09:43,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 09:09:43,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 09:09:43,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:09:43,816 INFO L87 Difference]: Start difference. First operand 544 states and 572 transitions. Second operand 13 states.
[2018-02-02 09:09:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:44,603 INFO L93 Difference]: Finished difference Result 546 states and 571 transitions.
[2018-02-02 09:09:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 09:09:44,604 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 194
[2018-02-02 09:09:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:44,605 INFO L225 Difference]: With dead ends: 546
[2018-02-02 09:09:44,605 INFO L226 Difference]: Without dead ends: 546
[2018-02-02 09:09:44,605 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420
[2018-02-02 09:09:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states.
[2018-02-02 09:09:44,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542.
[2018-02-02 09:09:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states.
[2018-02-02 09:09:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 567 transitions.
[2018-02-02 09:09:44,608 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 567 transitions. Word has length 194
[2018-02-02 09:09:44,608 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:44,608 INFO L432 AbstractCegarLoop]: Abstraction has 542 states and 567 transitions.
[2018-02-02 09:09:44,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 09:09:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 567 transitions.
[2018-02-02 09:09:44,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2018-02-02 09:09:44,609 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:44,609 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:44,609 INFO L371 AbstractCegarLoop]: === Iteration 41 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:44,609 INFO L82 PathProgramCache]: Analyzing trace with hash -166105365, now seen corresponding path program 1 times
[2018-02-02 09:09:44,609 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:44,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:44,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:44,610 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:44,610 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:44,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:46,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 14 proven. 873 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked.
[2018-02-02 09:09:46,720 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:09:46,720 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:09:46,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:46,795 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:09:46,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10
[2018-02-02 09:09:46,990 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 10 treesize of output 9
[2018-02-02 09:09:47,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:47,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:47,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:47,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35
[2018-02-02 09:09:47,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26
[2018-02-02 09:09:47,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18
[2018-02-02 09:09:47,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:47,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:47,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:09:47,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23
[2018-02-02 09:09:47,362 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_16 Int)) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_16 80) |c_#length|) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_16) 0))) is different from true
[2018-02-02 09:09:47,424 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_16 Int)) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_16) 0) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_16 80) |c_create_data_#t~malloc22.base| 16)))) is different from true
[2018-02-02 09:09:47,426 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_16 Int)) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_16) 0) (= (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_16 80) c_create_data_~nextData~0.base 16) |c_#length|))) is different from true
[2018-02-02 09:09:47,505 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:47,505 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:47,506 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:47,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13
[2018-02-02 09:09:47,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:09:47,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26
[2018-02-02 09:09:47,520 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:09:47,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42
[2018-02-02 09:09:47,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 46
[2018-02-02 09:09:47,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts.
[2018-02-02 09:09:47,564 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:09:47,574 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:09:47,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:09:47,587 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:72
[2018-02-02 09:09:49,453 WARN L146 SmtUtils]: Spent 1836ms on a formula simplification. DAG size of input: 46 DAG size of output 42
[2018-02-02 09:09:49,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1311 trivial. 59 not checked.
[2018-02-02 09:09:49,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:09:49,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31
[2018-02-02 09:09:49,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states
[2018-02-02 09:09:49,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2018-02-02 09:09:49,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=689, Unknown=6, NotChecked=168, Total=992
[2018-02-02 09:09:49,568 INFO L87 Difference]: Start difference. First operand 542 states and 567 transitions. Second operand 32 states.
[2018-02-02 09:09:52,565 WARN L146 SmtUtils]: Spent 1793ms on a formula simplification. DAG size of input: 49 DAG size of output 49
[2018-02-02 09:09:53,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:53,133 INFO L93 Difference]: Finished difference Result 546 states and 569 transitions.
[2018-02-02 09:09:53,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 09:09:53,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 194
[2018-02-02 09:09:53,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:53,135 INFO L225 Difference]: With dead ends: 546
[2018-02-02 09:09:53,135 INFO L226 Difference]: Without dead ends: 546
[2018-02-02 09:09:53,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 216 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=241, Invalid=1481, Unknown=12, NotChecked=246, Total=1980
[2018-02-02 09:09:53,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states.
[2018-02-02 09:09:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 523.
[2018-02-02 09:09:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states.
[2018-02-02 09:09:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 543 transitions.
[2018-02-02 09:09:53,139 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 543 transitions. Word has length 194
[2018-02-02 09:09:53,140 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:53,140 INFO L432 AbstractCegarLoop]: Abstraction has 523 states and 543 transitions.
[2018-02-02 09:09:53,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states.
[2018-02-02 09:09:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 543 transitions.
[2018-02-02 09:09:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2018-02-02 09:09:53,140 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:53,141 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:53,141 INFO L371 AbstractCegarLoop]: === Iteration 42 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:53,141 INFO L82 PathProgramCache]: Analyzing trace with hash -326265980, now seen corresponding path program 1 times
[2018-02-02 09:09:53,141 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:53,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:53,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:53,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:53,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:53,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked.
[2018-02-02 09:09:53,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:53,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:09:53,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:09:53,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:09:53,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:09:53,197 INFO L87 Difference]: Start difference. First operand 523 states and 543 transitions. Second operand 5 states.
[2018-02-02 09:09:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:53,397 INFO L93 Difference]: Finished difference Result 538 states and 560 transitions.
[2018-02-02 09:09:53,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:09:53,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195
[2018-02-02 09:09:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:53,398 INFO L225 Difference]: With dead ends: 538
[2018-02-02 09:09:53,398 INFO L226 Difference]: Without dead ends: 538
[2018-02-02 09:09:53,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:09:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states.
[2018-02-02 09:09:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 522.
[2018-02-02 09:09:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states.
[2018-02-02 09:09:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 542 transitions.
[2018-02-02 09:09:53,404 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 542 transitions. Word has length 195
[2018-02-02 09:09:53,404 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:53,404 INFO L432 AbstractCegarLoop]: Abstraction has 522 states and 542 transitions.
[2018-02-02 09:09:53,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:09:53,404 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 542 transitions.
[2018-02-02 09:09:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196
[2018-02-02 09:09:53,405 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:53,405 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:53,405 INFO L371 AbstractCegarLoop]: === Iteration 43 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:53,405 INFO L82 PathProgramCache]: Analyzing trace with hash -326265979, now seen corresponding path program 1 times
[2018-02-02 09:09:53,405 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:53,406 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:53,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:53,406 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:53,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:53,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:09:54,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked.
[2018-02-02 09:09:54,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:54,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-02-02 09:09:54,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-02-02 09:09:54,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-02-02 09:09:54,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2018-02-02 09:09:54,042 INFO L87 Difference]: Start difference. First operand 522 states and 542 transitions. Second operand 10 states.
[2018-02-02 09:09:54,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:54,291 INFO L93 Difference]: Finished difference Result 547 states and 569 transitions.
[2018-02-02 09:09:54,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-02-02 09:09:54,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195
[2018-02-02 09:09:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:54,292 INFO L225 Difference]: With dead ends: 547
[2018-02-02 09:09:54,292 INFO L226 Difference]: Without dead ends: 547
[2018-02-02 09:09:54,292 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272
[2018-02-02 09:09:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states.
[2018-02-02 09:09:54,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 521.
[2018-02-02 09:09:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states.
[2018-02-02 09:09:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 541 transitions.
[2018-02-02 09:09:54,296 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 541 transitions. Word has length 195
[2018-02-02 09:09:54,296 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:54,296 INFO L432 AbstractCegarLoop]: Abstraction has 521 states and 541 transitions.
[2018-02-02 09:09:54,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-02-02 09:09:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 541 transitions.
[2018-02-02 09:09:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2018-02-02 09:09:54,297 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:54,297 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:54,297 INFO L371 AbstractCegarLoop]: === Iteration 44 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:54,297 INFO L82 PathProgramCache]: Analyzing trace with hash -713459111, now seen corresponding path program 1 times
[2018-02-02 09:09:54,297 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:54,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:54,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:54,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:54,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:54,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1370 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked.
[2018-02-02 09:09:55,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:09:55,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2018-02-02 09:09:55,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 09:09:55,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 09:09:55,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2018-02-02 09:09:55,410 INFO L87 Difference]: Start difference. First operand 521 states and 541 transitions. Second operand 13 states.
[2018-02-02 09:09:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:09:56,394 INFO L93 Difference]: Finished difference Result 527 states and 547 transitions.
[2018-02-02 09:09:56,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 09:09:56,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 196
[2018-02-02 09:09:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:09:56,396 INFO L225 Difference]: With dead ends: 527
[2018-02-02 09:09:56,396 INFO L226 Difference]: Without dead ends: 527
[2018-02-02 09:09:56,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380
[2018-02-02 09:09:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states.
[2018-02-02 09:09:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 520.
[2018-02-02 09:09:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states.
[2018-02-02 09:09:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 540 transitions.
[2018-02-02 09:09:56,399 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 540 transitions. Word has length 196
[2018-02-02 09:09:56,399 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:09:56,399 INFO L432 AbstractCegarLoop]: Abstraction has 520 states and 540 transitions.
[2018-02-02 09:09:56,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 09:09:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 540 transitions.
[2018-02-02 09:09:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197
[2018-02-02 09:09:56,400 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:09:56,400 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:56,400 INFO L371 AbstractCegarLoop]: === Iteration 45 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]===
[2018-02-02 09:09:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash -713459110, now seen corresponding path program 1 times
[2018-02-02 09:09:56,400 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:09:56,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:09:56,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:56,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:09:56,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:09:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:09:56,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:09:58,741 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 86 DAG size of output 58
[2018-02-02 09:09:59,299 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 74 DAG size of output 60
[2018-02-02 09:10:01,138 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 59 DAG size of output 43
[2018-02-02 09:10:01,721 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 48 DAG size of output 41
[2018-02-02 09:10:03,307 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 50 DAG size of output 43
Received shutdown request...
[2018-02-02 09:10:03,707 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-02-02 09:10:03,712 WARN L185 ceAbstractionStarter]: Timeout
[2018-02-02 09:10:03,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:10:03 BoogieIcfgContainer
[2018-02-02 09:10:03,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 09:10:03,714 INFO L168 Benchmark]: Toolchain (without parser) took 41897.11 ms. Allocated memory was 403.7 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 360.6 MB in the beginning and 664.9 MB in the end (delta: -304.3 MB). Peak memory consumption was 826.6 MB. Max. memory is 5.3 GB.
[2018-02-02 09:10:03,715 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 09:10:03,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.37 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 348.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB.
[2018-02-02 09:10:03,715 INFO L168 Benchmark]: Boogie Preprocessor took 32.08 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 09:10:03,715 INFO L168 Benchmark]: RCFGBuilder took 482.90 ms. Allocated memory is still 403.7 MB. Free memory was 347.4 MB in the beginning and 294.8 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 5.3 GB.
[2018-02-02 09:10:03,716 INFO L168 Benchmark]: TraceAbstraction took 41211.89 ms. Allocated memory was 403.7 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 294.8 MB in the beginning and 664.9 MB in the end (delta: -370.1 MB). Peak memory consumption was 760.8 MB. Max. memory is 5.3 GB.
[2018-02-02 09:10:03,717 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 167.37 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 348.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 32.08 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 482.90 ms. Allocated memory is still 403.7 MB. Free memory was 347.4 MB in the beginning and 294.8 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 41211.89 ms. Allocated memory was 403.7 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 294.8 MB in the beginning and 664.9 MB in the end (delta: -370.1 MB). Peak memory consumption was 760.8 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 pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 197 with TraceHistMax 21, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 6 procedures, 213 locations, 91 error locations. TIMEOUT Result, 41.1s OverallTime, 45 OverallIterations, 21 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6972 SDtfs, 4681 SDslu, 40823 SDs, 0 SdLazy, 14643 SolverSat, 543 SolverUnsat, 164 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3036 GetRequests, 2420 SyntacticMatches, 24 SemanticMatches, 592 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1940 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=38, 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.2s AutomataMinimizationTime, 44 MinimizatonAttempts, 564 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 6859 NumberOfCodeBlocks, 6243 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 6795 ConstructedInterpolants, 684 QuantifiedInterpolants, 21197126 SizeOfPredicates, 66 NumberOfNonLiveVariables, 6876 ConjunctsInSsa, 297 ConjunctsInUnsatCore, 64 InterpolantComputations, 32 PerfectInterpolantSequences, 16248/30047 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/complex_data_creation_test01_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-10-03-725.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-10-03-725.csv
Completed graceful shutdown