java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.23-acfac67
[2018-01-28 20:58:13,470 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-01-28 20:58:13,472 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-28 20:58:13,490 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-28 20:58:13,490 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-28 20:58:13,491 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-28 20:58:13,493 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-28 20:58:13,499 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-28 20:58:13,502 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-28 20:58:13,504 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-28 20:58:13,505 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-28 20:58:13,505 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-28 20:58:13,511 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-28 20:58:13,512 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-28 20:58:13,513 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-28 20:58:13,527 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-28 20:58:13,529 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-28 20:58:13,531 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-28 20:58:13,532 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-28 20:58:13,534 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-28 20:58:13,537 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-28 20:58:13,538 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-28 20:58:13,538 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-28 20:58:13,551 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-28 20:58:13,552 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-28 20:58:13,554 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-28 20:58:13,554 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-28 20:58:13,559 INFO  L177        SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-28 20:58:13,560 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-28 20:58:13,560 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-28 20:58:13,561 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-01-28 20:58:13,561 INFO  L98         SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-28 20:58:13,593 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-01-28 20:58:13,593 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-28 20:58:13,594 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-28 20:58:13,594 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-01-28 20:58:13,595 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-28 20:58:13,595 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-28 20:58:13,595 INFO  L133        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2018-01-28 20:58:13,596 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-28 20:58:13,596 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-01-28 20:58:13,596 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-01-28 20:58:13,596 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-01-28 20:58:13,597 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-01-28 20:58:13,597 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-01-28 20:58:13,597 INFO  L133        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2018-01-28 20:58:13,598 INFO  L133        SettingsManager]:  * Bitprecise bitfields=true
[2018-01-28 20:58:13,599 INFO  L133        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2018-01-28 20:58:13,599 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-28 20:58:13,599 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-01-28 20:58:13,599 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-28 20:58:13,599 INFO  L133        SettingsManager]:  * Size of a code block=SingleStatement
[2018-01-28 20:58:13,599 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-01-28 20:58:13,600 INFO  L133        SettingsManager]:  * Add additional assume for each assert=false
[2018-01-28 20:58:13,600 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-01-28 20:58:13,600 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-28 20:58:13,600 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-28 20:58:13,600 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-01-28 20:58:13,601 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-01-28 20:58:13,601 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-28 20:58:13,605 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-01-28 20:58:13,605 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-28 20:58:13,606 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-28 20:58:13,606 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-28 20:58:13,612 INFO  L131        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-28 20:58:13,612 INFO  L133        SettingsManager]:  * TransformationType=HEAP_SEPARATOR
[2018-01-28 20:58:13,699 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-28 20:58:13,718 INFO  L266   ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-28 20:58:13,727 INFO  L222   ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-28 20:58:13,729 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-01-28 20:58:13,729 INFO  L276        PluginConnector]: CDTParser initialized
[2018-01-28 20:58:13,730 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i
[2018-01-28 20:58:13,996 INFO  L304   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-28 20:58:14,014 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-28 20:58:14,015 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-28 20:58:14,015 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-28 20:58:14,024 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-28 20:58:14,026 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:58:13" (1/1) ...
[2018-01-28 20:58:14,030 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d08f096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14, skipping insertion in model container
[2018-01-28 20:58:14,030 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:58:13" (1/1) ...
[2018-01-28 20:58:14,079 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-28 20:58:14,205 INFO  L153             Dispatcher]: Using SV-COMP mode
[2018-01-28 20:58:14,368 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-28 20:58:14,390 INFO  L450          PostProcessor]: Settings: Checked method=main
[2018-01-28 20:58:14,405 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14 WrapperNode
[2018-01-28 20:58:14,405 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-28 20:58:14,406 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-28 20:58:14,407 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-28 20:58:14,407 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-01-28 20:58:14,425 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14" (1/1) ...
[2018-01-28 20:58:14,425 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14" (1/1) ...
[2018-01-28 20:58:14,449 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14" (1/1) ...
[2018-01-28 20:58:14,450 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14" (1/1) ...
[2018-01-28 20:58:14,455 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14" (1/1) ...
[2018-01-28 20:58:14,459 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14" (1/1) ...
[2018-01-28 20:58:14,464 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14" (1/1) ...
[2018-01-28 20:58:14,473 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-28 20:58:14,473 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-28 20:58:14,473 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-01-28 20:58:14,474 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-01-28 20:58:14,475 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-28 20:58:14,568 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-28 20:58:14,568 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-28 20:58:14,568 INFO  L136     BoogieDeclarations]: Found implementation of procedure test_fun
[2018-01-28 20:58:14,568 INFO  L136     BoogieDeclarations]: Found implementation of procedure main
[2018-01-28 20:58:14,569 INFO  L128     BoogieDeclarations]: Found specification of procedure write~int
[2018-01-28 20:58:14,569 INFO  L128     BoogieDeclarations]: Found specification of procedure read~int
[2018-01-28 20:58:14,569 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-28 20:58:14,569 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-28 20:58:14,569 INFO  L128     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-28 20:58:14,569 INFO  L128     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-28 20:58:14,570 INFO  L128     BoogieDeclarations]: Found specification of procedure test_fun
[2018-01-28 20:58:14,570 INFO  L128     BoogieDeclarations]: Found specification of procedure main
[2018-01-28 20:58:14,570 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-28 20:58:14,570 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-28 20:58:14,795 INFO  L257             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-28 20:58:14,796 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:58:14 BoogieIcfgContainer
[2018-01-28 20:58:14,796 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-28 20:58:14,797 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-28 20:58:14,797 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-01-28 20:58:14,799 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-01-28 20:58:14,799 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 08:58:13" (1/3) ...
[2018-01-28 20:58:14,800 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668c08dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:58:14, skipping insertion in model container
[2018-01-28 20:58:14,800 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:58:14" (2/3) ...
[2018-01-28 20:58:14,800 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668c08dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:58:14, skipping insertion in model container
[2018-01-28 20:58:14,800 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:58:14" (3/3) ...
[2018-01-28 20:58:14,802 INFO  L107   eAbstractionObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i
[2018-01-28 20:58:14,808 INFO  L128   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-28 20:58:14,813 INFO  L140   ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations.
[2018-01-28 20:58:14,858 INFO  L322      AbstractCegarLoop]: Interprodecural is true
[2018-01-28 20:58:14,859 INFO  L323      AbstractCegarLoop]: Hoare is true
[2018-01-28 20:58:14,859 INFO  L324      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-28 20:58:14,859 INFO  L325      AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-28 20:58:14,859 INFO  L326      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-28 20:58:14,859 INFO  L327      AbstractCegarLoop]: Difference is false
[2018-01-28 20:58:14,859 INFO  L328      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-28 20:58:14,860 INFO  L333      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-28 20:58:14,860 INFO  L87    2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-28 20:58:14,881 INFO  L276                IsEmpty]: Start isEmpty. Operand 72 states.
[2018-01-28 20:58:14,888 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-01-28 20:58:14,889 INFO  L322         BasicCegarLoop]: Found error trace
[2018-01-28 20:58:14,890 INFO  L330         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 20:58:14,890 INFO  L371      AbstractCegarLoop]: === Iteration 1 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-28 20:58:14,895 INFO  L82        PathProgramCache]: Analyzing trace with hash 1594263380, now seen corresponding path program 1 times
[2018-01-28 20:58:14,898 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 20:58:14,898 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 20:58:14,957 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:14,957 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 20:58:14,958 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:15,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 20:58:15,030 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-28 20:58:15,206 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 20:58:15,209 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 20:58:15,210 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-28 20:58:15,212 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-28 20:58:15,227 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-28 20:58:15,227 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-01-28 20:58:15,230 INFO  L87              Difference]: Start difference. First operand 72 states. Second operand 6 states.
[2018-01-28 20:58:15,481 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 20:58:15,481 INFO  L93              Difference]: Finished difference Result 118 states and 135 transitions.
[2018-01-28 20:58:15,482 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-01-28 20:58:15,483 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 23
[2018-01-28 20:58:15,483 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 20:58:15,493 INFO  L225             Difference]: With dead ends: 118
[2018-01-28 20:58:15,494 INFO  L226             Difference]: Without dead ends: 63
[2018-01-28 20:58:15,497 INFO  L533         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-01-28 20:58:15,511 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2018-01-28 20:58:15,530 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2018-01-28 20:58:15,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2018-01-28 20:58:15,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions.
[2018-01-28 20:58:15,535 INFO  L78                 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 23
[2018-01-28 20:58:15,535 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-28 20:58:15,535 INFO  L432      AbstractCegarLoop]: Abstraction has 63 states and 66 transitions.
[2018-01-28 20:58:15,535 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-28 20:58:15,536 INFO  L276                IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions.
[2018-01-28 20:58:15,536 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-01-28 20:58:15,537 INFO  L322         BasicCegarLoop]: Found error trace
[2018-01-28 20:58:15,537 INFO  L330         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 20:58:15,537 INFO  L371      AbstractCegarLoop]: === Iteration 2 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-28 20:58:15,537 INFO  L82        PathProgramCache]: Analyzing trace with hash 1594263381, now seen corresponding path program 1 times
[2018-01-28 20:58:15,538 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 20:58:15,538 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 20:58:15,539 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:15,539 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 20:58:15,539 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:15,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 20:58:15,562 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-28 20:58:15,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 20:58:15,721 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 20:58:15,721 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-28 20:58:15,723 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-28 20:58:15,724 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-28 20:58:15,724 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-01-28 20:58:15,724 INFO  L87              Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 8 states.
[2018-01-28 20:58:16,025 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 20:58:16,025 INFO  L93              Difference]: Finished difference Result 101 states and 107 transitions.
[2018-01-28 20:58:16,026 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-01-28 20:58:16,026 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 23
[2018-01-28 20:58:16,027 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 20:58:16,031 INFO  L225             Difference]: With dead ends: 101
[2018-01-28 20:58:16,031 INFO  L226             Difference]: Without dead ends: 95
[2018-01-28 20:58:16,033 INFO  L533         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110
[2018-01-28 20:58:16,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-01-28 20:58:16,046 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90.
[2018-01-28 20:58:16,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2018-01-28 20:58:16,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions.
[2018-01-28 20:58:16,048 INFO  L78                 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 23
[2018-01-28 20:58:16,049 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-28 20:58:16,049 INFO  L432      AbstractCegarLoop]: Abstraction has 90 states and 96 transitions.
[2018-01-28 20:58:16,049 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-28 20:58:16,049 INFO  L276                IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions.
[2018-01-28 20:58:16,050 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-01-28 20:58:16,050 INFO  L322         BasicCegarLoop]: Found error trace
[2018-01-28 20:58:16,051 INFO  L330         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 20:58:16,051 INFO  L371      AbstractCegarLoop]: === Iteration 3 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-28 20:58:16,052 INFO  L82        PathProgramCache]: Analyzing trace with hash 954625981, now seen corresponding path program 1 times
[2018-01-28 20:58:16,052 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 20:58:16,052 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 20:58:16,053 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:16,053 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 20:58:16,054 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:16,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 20:58:16,079 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-28 20:58:16,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 20:58:16,160 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 20:58:16,160 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-28 20:58:16,160 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-28 20:58:16,160 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-28 20:58:16,160 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-01-28 20:58:16,161 INFO  L87              Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 6 states.
[2018-01-28 20:58:16,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 20:58:16,319 INFO  L93              Difference]: Finished difference Result 99 states and 104 transitions.
[2018-01-28 20:58:16,325 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-01-28 20:58:16,325 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 26
[2018-01-28 20:58:16,326 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 20:58:16,327 INFO  L225             Difference]: With dead ends: 99
[2018-01-28 20:58:16,327 INFO  L226             Difference]: Without dead ends: 93
[2018-01-28 20:58:16,328 INFO  L533         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-01-28 20:58:16,328 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2018-01-28 20:58:16,345 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90.
[2018-01-28 20:58:16,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2018-01-28 20:58:16,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions.
[2018-01-28 20:58:16,347 INFO  L78                 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 26
[2018-01-28 20:58:16,347 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-28 20:58:16,348 INFO  L432      AbstractCegarLoop]: Abstraction has 90 states and 95 transitions.
[2018-01-28 20:58:16,348 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-28 20:58:16,348 INFO  L276                IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions.
[2018-01-28 20:58:16,349 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2018-01-28 20:58:16,349 INFO  L322         BasicCegarLoop]: Found error trace
[2018-01-28 20:58:16,350 INFO  L330         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 20:58:16,351 INFO  L371      AbstractCegarLoop]: === Iteration 4 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-28 20:58:16,351 INFO  L82        PathProgramCache]: Analyzing trace with hash -1829160480, now seen corresponding path program 1 times
[2018-01-28 20:58:16,351 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 20:58:16,351 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 20:58:16,352 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:16,352 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 20:58:16,353 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:16,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 20:58:16,374 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-28 20:58:16,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 20:58:16,670 INFO  L308   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-28 20:58:16,670 INFO  L209   onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-28 20:58:16,682 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 20:58:16,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 20:58:16,709 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-01-28 20:58:16,755 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-01-28 20:58:16,757 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-01-28 20:58:16,761 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-01-28 20:58:16,761 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11
[2018-01-28 20:58:17,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-28 20:58:17,111 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-28 20:58:17,111 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17
[2018-01-28 20:58:17,111 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-01-28 20:58:17,112 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-01-28 20:58:17,112 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306
[2018-01-28 20:58:17,112 INFO  L87              Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 18 states.
[2018-01-28 20:58:17,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 20:58:17,705 INFO  L93              Difference]: Finished difference Result 94 states and 99 transitions.
[2018-01-28 20:58:17,706 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2018-01-28 20:58:17,706 INFO  L78                 Accepts]: Start accepts. Automaton has 18 states. Word has length 36
[2018-01-28 20:58:17,706 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 20:58:17,707 INFO  L225             Difference]: With dead ends: 94
[2018-01-28 20:58:17,708 INFO  L226             Difference]: Without dead ends: 88
[2018-01-28 20:58:17,708 INFO  L533         BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756
[2018-01-28 20:58:17,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2018-01-28 20:58:17,714 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 59.
[2018-01-28 20:58:17,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-01-28 20:58:17,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions.
[2018-01-28 20:58:17,715 INFO  L78                 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 36
[2018-01-28 20:58:17,715 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-28 20:58:17,716 INFO  L432      AbstractCegarLoop]: Abstraction has 59 states and 62 transitions.
[2018-01-28 20:58:17,716 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-01-28 20:58:17,716 INFO  L276                IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions.
[2018-01-28 20:58:17,716 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-01-28 20:58:17,716 INFO  L322         BasicCegarLoop]: Found error trace
[2018-01-28 20:58:17,717 INFO  L330         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-28 20:58:17,717 INFO  L371      AbstractCegarLoop]: === Iteration 5 === [test_funErr8RequiresViolation, test_funErr6RequiresViolation, test_funErr11RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr9RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]===
[2018-01-28 20:58:17,717 INFO  L82        PathProgramCache]: Analyzing trace with hash 2027793746, now seen corresponding path program 1 times
[2018-01-28 20:58:17,717 INFO  L209   onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-28 20:58:17,717 INFO  L67    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-28 20:58:17,718 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:17,718 INFO  L101   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-28 20:58:17,718 INFO  L117   rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-28 20:58:17,730 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-28 20:58:17,731 WARN  L137   erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level).  Set option :produce-proofs to true to get complete proofs.
[2018-01-28 20:58:17,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-01-28 20:58:17,779 INFO  L320   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-28 20:58:17,779 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-28 20:58:17,779 INFO  L409      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-28 20:58:17,779 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-28 20:58:17,780 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-28 20:58:17,780 INFO  L87              Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 4 states.
[2018-01-28 20:58:17,839 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-28 20:58:17,839 INFO  L93              Difference]: Finished difference Result 59 states and 62 transitions.
[2018-01-28 20:58:17,839 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-01-28 20:58:17,839 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 39
[2018-01-28 20:58:17,840 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-28 20:58:17,840 INFO  L225             Difference]: With dead ends: 59
[2018-01-28 20:58:17,840 INFO  L226             Difference]: Without dead ends: 0
[2018-01-28 20:58:17,841 INFO  L533         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-01-28 20:58:17,841 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2018-01-28 20:58:17,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2018-01-28 20:58:17,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2018-01-28 20:58:17,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2018-01-28 20:58:17,841 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39
[2018-01-28 20:58:17,842 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-01-28 20:58:17,842 INFO  L432      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2018-01-28 20:58:17,842 INFO  L433      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-28 20:58:17,842 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2018-01-28 20:58:17,842 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2018-01-28 20:58:17,847 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2018-01-28 20:58:18,461 WARN  L146               SmtUtils]: Spent 524ms on a formula simplification. DAG size of input: 57 DAG size of output 51
[2018-01-28 20:58:18,886 WARN  L146               SmtUtils]: Spent 416ms on a formula simplification. DAG size of input: 51 DAG size of output 46
[2018-01-28 20:58:18,890 INFO  L399   ceAbstractionStarter]: For program point  L1(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,890 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.initEXIT(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,891 INFO  L395   ceAbstractionStarter]: At program point  ULTIMATE.initENTRY(lines 1 563)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-28 20:58:18,891 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.initFINAL(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,891 INFO  L399   ceAbstractionStarter]: For program point  L542(line 542)  no Hoare annotation was computed.
[2018-01-28 20:58:18,891 INFO  L399   ceAbstractionStarter]: For program point  test_funErr6RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,891 INFO  L399   ceAbstractionStarter]: For program point  L540(lines 540 555)  no Hoare annotation was computed.
[2018-01-28 20:58:18,891 INFO  L399   ceAbstractionStarter]: For program point  L546(lines 546 549)  no Hoare annotation was computed.
[2018-01-28 20:58:18,891 INFO  L399   ceAbstractionStarter]: For program point  L545(line 545)  no Hoare annotation was computed.
[2018-01-28 20:58:18,891 INFO  L399   ceAbstractionStarter]: For program point  L544(line 544)  no Hoare annotation was computed.
[2018-01-28 20:58:18,891 INFO  L399   ceAbstractionStarter]: For program point  L543(line 543)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  test_funErr5RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L395   ceAbstractionStarter]: At program point  L546'''''(lines 546 549)  the Hoare annotation is:  (or (not (= (select |#valid| |test_fun_#in~a.base|) 1)) (not (= 0 |test_fun_#in~a.offset|)) (let ((.cse0 (= test_fun_~a.offset 0)) (.cse1 (= 1 (select |#valid| test_fun_~a.base))) (.cse2 (<= |test_fun_#in~N| test_fun_~N))) (or (and .cse0 .cse1 .cse2 (<= 1 test_fun_~i~2) (exists ((v_main_~array_size~6_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_1) (select |#length| test_fun_~a.base)) (<= test_fun_~N v_main_~array_size~6_BEFORE_CALL_1))) (exists ((v_main_~array_size~6_BEFORE_CALL_1 Int)) (and (<= (+ test_fun_~i~2 1) v_main_~array_size~6_BEFORE_CALL_1) (= (* 4 v_main_~array_size~6_BEFORE_CALL_1) (select |#length| test_fun_~a.base))))) (let ((.cse3 (select |#length| test_fun_~a.base))) (and (<= 4 .cse3) .cse0 (= 0 test_fun_~i~2) .cse1 .cse2 (exists ((v_main_~array_size~6_BEFORE_CALL_1 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~6_BEFORE_CALL_1) (= (* 4 v_main_~array_size~6_BEFORE_CALL_1) (select |#length| test_fun_~a.base)))) (<= (* 4 test_fun_~N) .cse3))))) (< (select |#length| |test_fun_#in~a.base|) 4) (not (exists ((v_main_~array_size~6_BEFORE_CALL_1 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~6_BEFORE_CALL_1) (= (* 4 v_main_~array_size~6_BEFORE_CALL_1) (select |#length| |test_fun_#in~a.base|))))))
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  L548(line 548)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  L547(line 547)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  test_funErr7RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  test_funErr11RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  L552''(line 552)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  L550''(line 550)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  L550'''''(lines 550 553)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  L546'(line 546)  no Hoare annotation was computed.
[2018-01-28 20:58:18,892 INFO  L399   ceAbstractionStarter]: For program point  L546''''(line 546)  no Hoare annotation was computed.
[2018-01-28 20:58:18,893 INFO  L399   ceAbstractionStarter]: For program point  L545'''''(line 545)  no Hoare annotation was computed.
[2018-01-28 20:58:18,893 INFO  L399   ceAbstractionStarter]: For program point  L550'(line 550)  no Hoare annotation was computed.
[2018-01-28 20:58:18,893 INFO  L399   ceAbstractionStarter]: For program point  test_funErr8RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,893 INFO  L399   ceAbstractionStarter]: For program point  test_funEXIT(lines 540 555)  no Hoare annotation was computed.
[2018-01-28 20:58:18,893 INFO  L399   ceAbstractionStarter]: For program point  test_funErr3RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,893 INFO  L399   ceAbstractionStarter]: For program point  L551'''(line 551)  no Hoare annotation was computed.
[2018-01-28 20:58:18,893 INFO  L399   ceAbstractionStarter]: For program point  L550''''(line 550)  no Hoare annotation was computed.
[2018-01-28 20:58:18,893 INFO  L399   ceAbstractionStarter]: For program point  L547''''(line 547)  no Hoare annotation was computed.
[2018-01-28 20:58:18,893 INFO  L402   ceAbstractionStarter]: At program point  test_funENTRY(lines 540 555)  the Hoare annotation is:  true
[2018-01-28 20:58:18,893 INFO  L399   ceAbstractionStarter]: For program point  L547'(line 547)  no Hoare annotation was computed.
[2018-01-28 20:58:18,894 INFO  L399   ceAbstractionStarter]: For program point  L551''''(line 551)  no Hoare annotation was computed.
[2018-01-28 20:58:18,894 INFO  L399   ceAbstractionStarter]: For program point  test_funErr0RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,894 INFO  L399   ceAbstractionStarter]: For program point  L547''(line 547)  no Hoare annotation was computed.
[2018-01-28 20:58:18,894 INFO  L399   ceAbstractionStarter]: For program point  L551'(line 551)  no Hoare annotation was computed.
[2018-01-28 20:58:18,894 INFO  L399   ceAbstractionStarter]: For program point  test_funErr1RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,894 INFO  L399   ceAbstractionStarter]: For program point  test_funErr2RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,895 INFO  L399   ceAbstractionStarter]: For program point  L551''(line 551)  no Hoare annotation was computed.
[2018-01-28 20:58:18,895 INFO  L399   ceAbstractionStarter]: For program point  L545''''(line 545)  no Hoare annotation was computed.
[2018-01-28 20:58:18,895 INFO  L399   ceAbstractionStarter]: For program point  L547'''(line 547)  no Hoare annotation was computed.
[2018-01-28 20:58:18,895 INFO  L399   ceAbstractionStarter]: For program point  L548'(line 548)  no Hoare annotation was computed.
[2018-01-28 20:58:18,896 INFO  L399   ceAbstractionStarter]: For program point  test_funErr10RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,896 INFO  L399   ceAbstractionStarter]: For program point  L545'''(lines 545 554)  no Hoare annotation was computed.
[2018-01-28 20:58:18,896 INFO  L399   ceAbstractionStarter]: For program point  L552(line 552)  no Hoare annotation was computed.
[2018-01-28 20:58:18,896 INFO  L399   ceAbstractionStarter]: For program point  L551(line 551)  no Hoare annotation was computed.
[2018-01-28 20:58:18,896 INFO  L399   ceAbstractionStarter]: For program point  L552'(line 552)  no Hoare annotation was computed.
[2018-01-28 20:58:18,896 INFO  L399   ceAbstractionStarter]: For program point  L550(lines 550 553)  no Hoare annotation was computed.
[2018-01-28 20:58:18,896 INFO  L399   ceAbstractionStarter]: For program point  L545'''''''(lines 545 554)  no Hoare annotation was computed.
[2018-01-28 20:58:18,896 INFO  L395   ceAbstractionStarter]: At program point  L545''''''(lines 545 554)  the Hoare annotation is:  (let ((.cse4 (select |#length| test_fun_~a.base))) (let ((.cse0 (<= 4 .cse4)) (.cse1 (= test_fun_~a.offset 0)) (.cse2 (= 1 (select |#valid| test_fun_~a.base))) (.cse3 (<= |test_fun_#in~N| test_fun_~N))) (or (and .cse0 .cse1 (= 0 test_fun_~i~2) .cse2 .cse3 (exists ((v_main_~array_size~6_BEFORE_CALL_1 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~6_BEFORE_CALL_1) (= (* 4 v_main_~array_size~6_BEFORE_CALL_1) (select |#length| test_fun_~a.base)))) (<= (* 4 test_fun_~N) .cse4)) (not (= (select |#valid| |test_fun_#in~a.base|) 1)) (not (= 0 |test_fun_#in~a.offset|)) (and .cse0 .cse1 .cse2 .cse3 (<= 1 test_fun_~i~2) (exists ((v_main_~array_size~6_BEFORE_CALL_1 Int)) (and (= (* 4 v_main_~array_size~6_BEFORE_CALL_1) (select |#length| test_fun_~a.base)) (<= test_fun_~N v_main_~array_size~6_BEFORE_CALL_1)))) (< (select |#length| |test_fun_#in~a.base|) 4) (not (exists ((v_main_~array_size~6_BEFORE_CALL_1 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~6_BEFORE_CALL_1) (= (* 4 v_main_~array_size~6_BEFORE_CALL_1) (select |#length| |test_fun_#in~a.base|))))))))
[2018-01-28 20:58:18,897 INFO  L399   ceAbstractionStarter]: For program point  test_funErr9RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,897 INFO  L399   ceAbstractionStarter]: For program point  L546''(line 546)  no Hoare annotation was computed.
[2018-01-28 20:58:18,897 INFO  L399   ceAbstractionStarter]: For program point  L545'(lines 545 554)  no Hoare annotation was computed.
[2018-01-28 20:58:18,897 INFO  L399   ceAbstractionStarter]: For program point  test_funErr4RequiresViolation(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,897 INFO  L399   ceAbstractionStarter]: For program point  L548''(line 548)  no Hoare annotation was computed.
[2018-01-28 20:58:18,897 INFO  L402   ceAbstractionStarter]: At program point  ULTIMATE.startENTRY(lines 1 563)  the Hoare annotation is:  true
[2018-01-28 20:58:18,897 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,897 INFO  L402   ceAbstractionStarter]: At program point  L1(lines 1 563)  the Hoare annotation is:  true
[2018-01-28 20:58:18,898 INFO  L399   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(lines 1 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,898 INFO  L399   ceAbstractionStarter]: For program point  L561'(line 561)  no Hoare annotation was computed.
[2018-01-28 20:58:18,898 INFO  L399   ceAbstractionStarter]: For program point  L562'(line 562)  no Hoare annotation was computed.
[2018-01-28 20:58:18,898 INFO  L395   ceAbstractionStarter]: At program point  L562(line 562)  the Hoare annotation is:  (let ((.cse0 (* 4 main_~array_size~6))) (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= 0 main_~numbers~6.offset) (<= 1 main_~array_size~6) (= 0 |main_#t~malloc10.offset|) (= (store |#valid| |main_#t~malloc10.base| (select (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc10.base|)) |old(#valid)|) (= 1 (select |#valid| main_~numbers~6.base)) (= .cse0 (select |#length| |main_#t~malloc10.base|)) (= .cse0 (select |#length| main_~numbers~6.base))))
[2018-01-28 20:58:18,898 INFO  L399   ceAbstractionStarter]: For program point  L561(line 561)  no Hoare annotation was computed.
[2018-01-28 20:58:18,898 INFO  L399   ceAbstractionStarter]: For program point  L557(line 557)  no Hoare annotation was computed.
[2018-01-28 20:58:18,898 INFO  L399   ceAbstractionStarter]: For program point  mainFINAL(lines 556 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,899 INFO  L399   ceAbstractionStarter]: For program point  L559(line 559)  no Hoare annotation was computed.
[2018-01-28 20:58:18,899 INFO  L399   ceAbstractionStarter]: For program point  L558(lines 558 560)  no Hoare annotation was computed.
[2018-01-28 20:58:18,899 INFO  L399   ceAbstractionStarter]: For program point  mainEXIT(lines 556 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,899 INFO  L395   ceAbstractionStarter]: At program point  mainENTRY(lines 556 563)  the Hoare annotation is:  (= |#valid| |old(#valid)|)
[2018-01-28 20:58:18,899 INFO  L399   ceAbstractionStarter]: For program point  L558''(lines 558 560)  no Hoare annotation was computed.
[2018-01-28 20:58:18,899 INFO  L399   ceAbstractionStarter]: For program point  L557'(line 557)  no Hoare annotation was computed.
[2018-01-28 20:58:18,899 INFO  L399   ceAbstractionStarter]: For program point  mainErr0EnsuresViolation(lines 556 563)  no Hoare annotation was computed.
[2018-01-28 20:58:18,906 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,909 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,909 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,910 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,910 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,910 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,911 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,911 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,913 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,913 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,914 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,914 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,914 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,914 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,915 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,920 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,921 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,931 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,931 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,932 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,932 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,932 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,932 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,933 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,933 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,933 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,933 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,934 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,934 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,934 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,936 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,937 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,939 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,940 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,940 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,940 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,940 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,941 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,941 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,941 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,941 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,942 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,942 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,946 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,946 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,947 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,947 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,947 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,948 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,948 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,948 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,948 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,949 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,949 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,953 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,953 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,955 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:58:18 BoogieIcfgContainer
[2018-01-28 20:58:18,955 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-28 20:58:18,957 INFO  L168              Benchmark]: Toolchain (without parser) took 4960.28 ms. Allocated memory was 306.2 MB in the beginning and 492.3 MB in the end (delta: 186.1 MB). Free memory was 265.1 MB in the beginning and 414.1 MB in the end (delta: -149.0 MB). Peak memory consumption was 128.2 MB. Max. memory is 5.3 GB.
[2018-01-28 20:58:18,959 INFO  L168              Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 306.2 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-28 20:58:18,960 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 390.99 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB.
[2018-01-28 20:58:18,961 INFO  L168              Benchmark]: Boogie Preprocessor took 66.44 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-28 20:58:18,961 INFO  L168              Benchmark]: RCFGBuilder took 322.77 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 232.2 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB.
[2018-01-28 20:58:18,961 INFO  L168              Benchmark]: TraceAbstraction took 4158.92 ms. Allocated memory was 306.2 MB in the beginning and 492.3 MB in the end (delta: 186.1 MB). Free memory was 232.2 MB in the beginning and 414.1 MB in the end (delta: -181.9 MB). Peak memory consumption was 95.3 MB. Max. memory is 5.3 GB.
[2018-01-28 20:58:18,964 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.25 ms. Allocated memory is still 306.2 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
 * CACSL2BoogieTranslator took 390.99 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB.
 * Boogie Preprocessor took 66.44 ms. Allocated memory is still 306.2 MB. Free memory was 255.1 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
 * RCFGBuilder took 322.77 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 232.2 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB.
 * TraceAbstraction took 4158.92 ms. Allocated memory was 306.2 MB in the beginning and 492.3 MB in the end (delta: 186.1 MB). Free memory was 232.2 MB in the beginning and 414.1 MB in the end (delta: -181.9 MB). Peak memory consumption was 95.3 MB. Max. memory is 5.3 GB.
 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor:
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
  - GenericResult: Unfinished Backtranslation
    Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
  - GenericResult: Unfinished Backtranslation
    unknown boogie variable #length
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 1]: pointer dereference always succeeds
    For all program executions holds that pointer dereference always succeeds at this location
  - PositiveResult [Line: 556]: all allocated memory was freed
    For all program executions holds that all allocated memory was freed at this location
  - AllSpecificationsHoldResult: All specifications hold
    13 specifications checked. All of them hold
  - InvariantResult [Line: 546]: Loop Invariant
[2018-01-28 20:58:18,972 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,972 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,972 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,973 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,973 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,973 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,973 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,974 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,974 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,974 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,974 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,975 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,975 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,975 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,975 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,977 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,977 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,977 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,977 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,978 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,978 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,978 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,978 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,978 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,979 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,979 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,979 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,979 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,979 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,980 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
    Derived loop invariant: (((!(\valid[a] == 1) || !(0 == a)) || (((((a == 0 && 1 == \valid[a]) && \old(N) <= N) && 1 <= i) && (\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_1)) && (\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: i + 1 <= v_main_~array_size~6_BEFORE_CALL_1 && 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[a])) || ((((((4 <= unknown-#length-unknown[a] && a == 0) && 0 == i) && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_1 && 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 4 * N <= unknown-#length-unknown[a])) || unknown-#length-unknown[a] < 4) || !(\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_1 && 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[a])
  - InvariantResult [Line: 545]: Loop Invariant
[2018-01-28 20:58:18,981 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,981 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,982 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,982 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,982 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,982 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,982 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,983 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,983 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,983 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,983 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,983 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,983 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,985 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,985 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,985 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,986 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,986 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,986 WARN  L343   cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~6_BEFORE_CALL_1,QUANTIFIED]
[2018-01-28 20:58:18,986 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,986 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,987 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,987 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,987 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,987 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
[2018-01-28 20:58:18,987 WARN  L1215  BoogieBacktranslator]: unknown boogie variable #length
    Derived loop invariant: ((((((((((4 <= unknown-#length-unknown[a] && a == 0) && 0 == i) && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_1 && 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[a])) && 4 * N <= unknown-#length-unknown[a]) || !(\valid[a] == 1)) || !(0 == a)) || (((((4 <= unknown-#length-unknown[a] && a == 0) && 1 == \valid[a]) && \old(N) <= N) && 1 <= i) && (\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[a] && N <= v_main_~array_size~6_BEFORE_CALL_1))) || unknown-#length-unknown[a] < 4) || !(\exists v_main_~array_size~6_BEFORE_CALL_1 : int :: \old(N) <= v_main_~array_size~6_BEFORE_CALL_1 && 4 * v_main_~array_size~6_BEFORE_CALL_1 == unknown-#length-unknown[a])
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 72 locations, 13 error locations. SAFE Result, 4.0s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 270 SDtfs, 750 SDslu, 856 SDs, 0 SdLazy, 483 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 11 NumberOfFragments, 266 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 230 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 177 ConstructedInterpolants, 23 QuantifiedInterpolants, 36980 SizeOfPredicates, 8 NumberOfNonLiveVariables, 95 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 4/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_20-58-18-993.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array02-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_20-58-18-993.csv
Received shutdown request...