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_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c


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


This is Ultimate 0.1.23-8168ed2-m
[2018-04-11 22:17:28,175 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-04-11 22:17:28,177 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-04-11 22:17:28,190 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-04-11 22:17:28,190 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-04-11 22:17:28,191 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-04-11 22:17:28,192 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-04-11 22:17:28,194 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-04-11 22:17:28,196 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-04-11 22:17:28,197 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-04-11 22:17:28,197 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-04-11 22:17:28,198 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-04-11 22:17:28,199 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-04-11 22:17:28,200 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-04-11 22:17:28,201 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-04-11 22:17:28,203 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-04-11 22:17:28,205 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-04-11 22:17:28,207 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-04-11 22:17:28,208 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-04-11 22:17:28,209 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-04-11 22:17:28,212 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-04-11 22:17:28,212 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-04-11 22:17:28,212 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-04-11 22:17:28,213 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-04-11 22:17:28,214 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-04-11 22:17:28,215 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-04-11 22:17:28,216 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-04-11 22:17:28,216 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-04-11 22:17:28,217 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-04-11 22:17:28,217 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-04-11 22:17:28,218 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-04-11 22:17:28,218 INFO  L98         SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf
[2018-04-11 22:17:28,240 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-04-11 22:17:28,240 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-04-11 22:17:28,240 INFO  L131        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2018-04-11 22:17:28,241 INFO  L133        SettingsManager]:  * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG;
[2018-04-11 22:17:28,241 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-04-11 22:17:28,241 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-04-11 22:17:28,241 INFO  L131        SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-04-11 22:17:28,242 INFO  L133        SettingsManager]:  * Abstract domain for RCFG-of-the-future=VPDomain
[2018-04-11 22:17:28,242 INFO  L133        SettingsManager]:  * Parallel states before merging=1
[2018-04-11 22:17:28,242 INFO  L133        SettingsManager]:  * Use the RCFG-of-the-future interface=true
[2018-04-11 22:17:28,242 INFO  L131        SettingsManager]: Preferences of LTL2Aut differ from their defaults:
[2018-04-11 22:17:28,242 INFO  L133        SettingsManager]:  * Property to check=[] a 
 a: x > 42
[2018-04-11 22:17:28,243 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-04-11 22:17:28,243 INFO  L133        SettingsManager]:  * sizeof long=4
[2018-04-11 22:17:28,243 INFO  L133        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2018-04-11 22:17:28,243 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-04-11 22:17:28,243 INFO  L133        SettingsManager]:  * sizeof POINTER=4
[2018-04-11 22:17:28,243 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-04-11 22:17:28,243 INFO  L133        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2018-04-11 22:17:28,244 INFO  L133        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2018-04-11 22:17:28,244 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-04-11 22:17:28,244 INFO  L133        SettingsManager]:  * sizeof long double=12
[2018-04-11 22:17:28,244 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-04-11 22:17:28,244 INFO  L133        SettingsManager]:  * Size of a code block=SingleStatement
[2018-04-11 22:17:28,244 INFO  L133        SettingsManager]:  * Add additional assume for each assert=false
[2018-04-11 22:17:28,245 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-04-11 22:17:28,245 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-04-11 22:17:28,245 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-04-11 22:17:28,245 INFO  L133        SettingsManager]:  * Interpolant automaton=TWOTRACK
[2018-04-11 22:17:28,245 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-04-11 22:17:28,245 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-04-11 22:17:28,246 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-04-11 22:17:28,246 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:17:28,246 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-04-11 22:17:28,247 INFO  L131        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-04-11 22:17:28,247 INFO  L133        SettingsManager]:  * TransformationType=HEAP_SEPARATOR
[2018-04-11 22:17:28,247 INFO  L131        SettingsManager]: Preferences of Boogie Printer differ from their defaults:
[2018-04-11 22:17:28,247 INFO  L133        SettingsManager]:  * Dump path:=C:\Users\alex\AppData\Local\Temp\
[2018-04-11 22:17:28,279 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-04-11 22:17:28,289 INFO  L266   ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized
[2018-04-11 22:17:28,292 INFO  L222   ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-04-11 22:17:28,294 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-04-11 22:17:28,294 INFO  L276        PluginConnector]: CDTParser initialized
[2018-04-11 22:17:28,295 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c
[2018-04-11 22:17:28,617 INFO  L225              CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe16cd8fd6
[2018-04-11 22:17:28,732 INFO  L287              CDTParser]: IsIndexed: true
[2018-04-11 22:17:28,732 INFO  L288              CDTParser]: Found 1 translation units.
[2018-04-11 22:17:28,733 INFO  L168              CDTParser]: Scanning ArraysOfVariableLength2_true-valid-memsafety.c
[2018-04-11 22:17:28,734 INFO  L210   ultiparseSymbolTable]: Include resolver:
[2018-04-11 22:17:28,734 INFO  L215   ultiparseSymbolTable]: <empty include resolver>
[2018-04-11 22:17:28,734 INFO  L218   ultiparseSymbolTable]: Function table:
[2018-04-11 22:17:28,734 INFO  L221   ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength2_true-valid-memsafety.c
[2018-04-11 22:17:28,735 INFO  L221   ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength2_true-valid-memsafety.c
[2018-04-11 22:17:28,735 INFO  L221   ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar ('bar') in ArraysOfVariableLength2_true-valid-memsafety.c
[2018-04-11 22:17:28,735 INFO  L227   ultiparseSymbolTable]: Global variable table:
[2018-04-11 22:17:28,735 INFO  L233   ultiparseSymbolTable]: <empty global variable table>
[2018-04-11 22:17:28,750 INFO  L330              CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe16cd8fd6
[2018-04-11 22:17:28,755 INFO  L304   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-04-11 22:17:28,757 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2018-04-11 22:17:28,758 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-04-11 22:17:28,758 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-04-11 22:17:28,764 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-04-11 22:17:28,765 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:17:28" (1/1) ...
[2018-04-11 22:17:28,767 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fcc665b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28, skipping insertion in model container
[2018-04-11 22:17:28,767 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:17:28" (1/1) ...
[2018-04-11 22:17:28,781 INFO  L167             Dispatcher]: Using SV-COMP mode
[2018-04-11 22:17:28,793 INFO  L167             Dispatcher]: Using SV-COMP mode
[2018-04-11 22:17:28,933 INFO  L175          PostProcessor]: Settings: Checked method=main
[2018-04-11 22:17:28,963 INFO  L175          PostProcessor]: Settings: Checked method=main
[2018-04-11 22:17:28,968 INFO  L100         SccComputation]: Graph consists of 0 InCaSumBalls and 10 non ball SCCs. Number of states in SCCs 10.
[2018-04-11 22:17:28,977 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28 WrapperNode
[2018-04-11 22:17:28,977 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-04-11 22:17:28,978 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-04-11 22:17:28,978 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-04-11 22:17:28,978 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-04-11 22:17:28,988 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28" (1/1) ...
[2018-04-11 22:17:28,988 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28" (1/1) ...
[2018-04-11 22:17:28,997 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28" (1/1) ...
[2018-04-11 22:17:28,997 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28" (1/1) ...
[2018-04-11 22:17:29,001 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28" (1/1) ...
[2018-04-11 22:17:29,006 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28" (1/1) ...
[2018-04-11 22:17:29,007 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28" (1/1) ...
[2018-04-11 22:17:29,009 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-04-11 22:17:29,010 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-04-11 22:17:29,010 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-04-11 22:17:29,010 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-04-11 22:17:29,011 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28" (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-04-11 22:17:29,079 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-04-11 22:17:29,079 INFO  L136     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-04-11 22:17:29,079 INFO  L136     BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar
[2018-04-11 22:17:29,079 INFO  L136     BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo
[2018-04-11 22:17:29,079 INFO  L136     BoogieDeclarations]: Found implementation of procedure main
[2018-04-11 22:17:29,079 INFO  L128     BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__bar
[2018-04-11 22:17:29,079 INFO  L128     BoogieDeclarations]: Found specification of procedure read~int
[2018-04-11 22:17:29,079 INFO  L128     BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo
[2018-04-11 22:17:29,080 INFO  L128     BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-04-11 22:17:29,080 INFO  L128     BoogieDeclarations]: Found specification of procedure write~int
[2018-04-11 22:17:29,080 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-04-11 22:17:29,080 INFO  L128     BoogieDeclarations]: Found specification of procedure main
[2018-04-11 22:17:29,080 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-04-11 22:17:29,080 INFO  L128     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-04-11 22:17:29,080 INFO  L128     BoogieDeclarations]: Found specification of procedure write~unchecked~int
[2018-04-11 22:17:29,442 INFO  L259             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-04-11 22:17:29,443 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:17:29 BoogieIcfgContainer
[2018-04-11 22:17:29,443 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-04-11 22:17:29,444 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-04-11 22:17:29,444 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-04-11 22:17:29,448 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-04-11 22:17:29,448 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:17:28" (1/3) ...
[2018-04-11 22:17:29,449 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3072458b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:17:29, skipping insertion in model container
[2018-04-11 22:17:29,450 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:17:28" (2/3) ...
[2018-04-11 22:17:29,450 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3072458b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:17:29, skipping insertion in model container
[2018-04-11 22:17:29,450 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:17:29" (3/3) ...
[2018-04-11 22:17:29,452 INFO  L107   eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c
[2018-04-11 22:17:29,461 INFO  L131   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-04-11 22:17:29,469 INFO  L143   ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations.
[2018-04-11 22:17:29,507 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2018-04-11 22:17:29,508 INFO  L369      AbstractCegarLoop]: Interprodecural is true
[2018-04-11 22:17:29,508 INFO  L370      AbstractCegarLoop]: Hoare is true
[2018-04-11 22:17:29,508 INFO  L371      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-04-11 22:17:29,508 INFO  L372      AbstractCegarLoop]: Backedges is TWOTRACK
[2018-04-11 22:17:29,509 INFO  L373      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-04-11 22:17:29,509 INFO  L374      AbstractCegarLoop]: Difference is false
[2018-04-11 22:17:29,509 INFO  L375      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-04-11 22:17:29,509 INFO  L380      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-04-11 22:17:29,510 INFO  L87    2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-04-11 22:17:29,525 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states.
[2018-04-11 22:17:29,531 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2018-04-11 22:17:29,531 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:17:29,532 INFO  L355         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:17:29,532 INFO  L408      AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:17:29,537 INFO  L82        PathProgramCache]: Analyzing trace with hash 1517835154, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:17:29,550 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:17:29,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:17:29,586 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:17:29,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:29,603 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:17:29,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:29,649 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:17:29,649 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2
[2018-04-11 22:17:29,652 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 2 states
[2018-04-11 22:17:29,665 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2018-04-11 22:17:29,665 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-04-11 22:17:29,667 INFO  L87              Difference]: Start difference. First operand 89 states. Second operand 2 states.
[2018-04-11 22:17:29,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:17:29,691 INFO  L93              Difference]: Finished difference Result 169 states and 189 transitions.
[2018-04-11 22:17:29,692 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2018-04-11 22:17:29,692 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 14
[2018-04-11 22:17:29,693 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:17:29,699 INFO  L225             Difference]: With dead ends: 169
[2018-04-11 22:17:29,700 INFO  L226             Difference]: Without dead ends: 86
[2018-04-11 22:17:29,703 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2018-04-11 22:17:29,718 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-04-11 22:17:29,738 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2018-04-11 22:17:29,739 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 86 states.
[2018-04-11 22:17:29,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions.
[2018-04-11 22:17:29,742 INFO  L78                 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 14
[2018-04-11 22:17:29,742 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:17:29,742 INFO  L459      AbstractCegarLoop]: Abstraction has 86 states and 91 transitions.
[2018-04-11 22:17:29,743 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2018-04-11 22:17:29,743 INFO  L276                IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions.
[2018-04-11 22:17:29,743 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-04-11 22:17:29,744 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:17:29,744 INFO  L355         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:17:29,744 INFO  L408      AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:17:29,744 INFO  L82        PathProgramCache]: Analyzing trace with hash -693346302, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:17:29,755 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:17:29,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:17:29,773 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:17:29,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:29,798 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:17:29,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:29,835 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:17:29,836 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4
[2018-04-11 22:17:29,837 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-04-11 22:17:29,837 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-04-11 22:17:29,837 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-04-11 22:17:29,838 INFO  L87              Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 4 states.
[2018-04-11 22:17:29,897 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:17:29,897 INFO  L93              Difference]: Finished difference Result 110 states and 118 transitions.
[2018-04-11 22:17:29,897 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-04-11 22:17:29,898 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2018-04-11 22:17:29,898 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:17:29,901 INFO  L225             Difference]: With dead ends: 110
[2018-04-11 22:17:29,902 INFO  L226             Difference]: Without dead ends: 93
[2018-04-11 22:17:29,903 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-04-11 22:17:29,903 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2018-04-11 22:17:29,916 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85.
[2018-04-11 22:17:29,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2018-04-11 22:17:29,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions.
[2018-04-11 22:17:29,918 INFO  L78                 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 15
[2018-04-11 22:17:29,919 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:17:29,919 INFO  L459      AbstractCegarLoop]: Abstraction has 85 states and 89 transitions.
[2018-04-11 22:17:29,919 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-04-11 22:17:29,919 INFO  L276                IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions.
[2018-04-11 22:17:29,920 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-04-11 22:17:29,920 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:17:29,920 INFO  L355         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:17:29,920 INFO  L408      AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:17:29,920 INFO  L82        PathProgramCache]: Analyzing trace with hash 1457275385, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:17:29,932 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:17:29,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:17:29,960 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:17:30,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:30,042 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:17:30,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:30,105 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:17:30,106 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 7
[2018-04-11 22:17:30,107 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-04-11 22:17:30,107 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-04-11 22:17:30,108 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-04-11 22:17:30,108 INFO  L87              Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 7 states.
[2018-04-11 22:17:30,251 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:17:30,251 INFO  L93              Difference]: Finished difference Result 188 states and 200 transitions.
[2018-04-11 22:17:30,251 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2018-04-11 22:17:30,252 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 21
[2018-04-11 22:17:30,252 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:17:30,253 INFO  L225             Difference]: With dead ends: 188
[2018-04-11 22:17:30,254 INFO  L226             Difference]: Without dead ends: 114
[2018-04-11 22:17:30,255 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2018-04-11 22:17:30,255 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2018-04-11 22:17:30,264 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107.
[2018-04-11 22:17:30,265 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2018-04-11 22:17:30,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions.
[2018-04-11 22:17:30,267 INFO  L78                 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 21
[2018-04-11 22:17:30,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:17:30,267 INFO  L459      AbstractCegarLoop]: Abstraction has 107 states and 113 transitions.
[2018-04-11 22:17:30,268 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-04-11 22:17:30,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions.
[2018-04-11 22:17:30,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-04-11 22:17:30,268 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:17:30,269 INFO  L355         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:17:30,269 INFO  L408      AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:17:30,269 INFO  L82        PathProgramCache]: Analyzing trace with hash 80098363, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:17:30,275 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:17:30,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:17:30,296 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:17:30,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:30,367 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:17:30,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:30,449 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:17:30,449 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9
[2018-04-11 22:17:30,450 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-04-11 22:17:30,450 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-04-11 22:17:30,450 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-04-11 22:17:30,451 INFO  L87              Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 9 states.
[2018-04-11 22:17:30,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:17:30,687 INFO  L93              Difference]: Finished difference Result 210 states and 222 transitions.
[2018-04-11 22:17:30,688 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-04-11 22:17:30,688 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 29
[2018-04-11 22:17:30,689 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:17:30,690 INFO  L225             Difference]: With dead ends: 210
[2018-04-11 22:17:30,690 INFO  L226             Difference]: Without dead ends: 124
[2018-04-11 22:17:30,691 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2018-04-11 22:17:30,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2018-04-11 22:17:30,700 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117.
[2018-04-11 22:17:30,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 117 states.
[2018-04-11 22:17:30,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions.
[2018-04-11 22:17:30,702 INFO  L78                 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 29
[2018-04-11 22:17:30,703 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:17:30,703 INFO  L459      AbstractCegarLoop]: Abstraction has 117 states and 122 transitions.
[2018-04-11 22:17:30,703 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-04-11 22:17:30,703 INFO  L276                IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions.
[2018-04-11 22:17:30,705 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-04-11 22:17:30,705 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:17:30,705 INFO  L355         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:17:30,706 INFO  L408      AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:17:30,706 INFO  L82        PathProgramCache]: Analyzing trace with hash -666706721, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:17:30,721 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:17:30,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:17:30,740 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:17:30,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:30,756 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:17:30,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:30,833 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:17:30,833 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5
[2018-04-11 22:17:30,834 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-04-11 22:17:30,834 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-04-11 22:17:30,834 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-04-11 22:17:30,834 INFO  L87              Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 5 states.
[2018-04-11 22:17:30,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:17:30,879 INFO  L93              Difference]: Finished difference Result 204 states and 216 transitions.
[2018-04-11 22:17:30,879 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-04-11 22:17:30,880 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 41
[2018-04-11 22:17:30,880 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:17:30,885 INFO  L225             Difference]: With dead ends: 204
[2018-04-11 22:17:30,885 INFO  L226             Difference]: Without dead ends: 124
[2018-04-11 22:17:30,886 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-04-11 22:17:30,886 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2018-04-11 22:17:30,899 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120.
[2018-04-11 22:17:30,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2018-04-11 22:17:30,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions.
[2018-04-11 22:17:30,901 INFO  L78                 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 41
[2018-04-11 22:17:30,901 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:17:30,901 INFO  L459      AbstractCegarLoop]: Abstraction has 120 states and 125 transitions.
[2018-04-11 22:17:30,902 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-04-11 22:17:30,902 INFO  L276                IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions.
[2018-04-11 22:17:30,903 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-04-11 22:17:30,903 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:17:30,903 INFO  L355         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:17:30,903 INFO  L408      AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:17:30,903 INFO  L82        PathProgramCache]: Analyzing trace with hash -699612892, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:17:30,915 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:17:30,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:17:30,937 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:17:30,956 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:17:30,957 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:30,975 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:30,976 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-04-11 22:17:31,032 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:17:31,033 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5
[2018-04-11 22:17:31,033 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:31,035 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars,  End of recursive call: 1 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:17:31,036 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5
[2018-04-11 22:17:31,066 WARN  L1033  $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#valid| (store |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| 0)))) is different from true
[2018-04-11 22:17:31,073 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:17:31,073 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:17:31,074 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-04-11 22:17:31,075 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:31,080 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars,  End of recursive call: 1 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:17:31,080 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11
[2018-04-11 22:17:31,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:31,121 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:17:31,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:31,323 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:17:31,323 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11
[2018-04-11 22:17:31,323 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 22:17:31,323 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 22:17:31,324 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=79, Unknown=1, NotChecked=18, Total=132
[2018-04-11 22:17:31,324 INFO  L87              Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 12 states.
[2018-04-11 22:17:32,157 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:17:32,158 INFO  L93              Difference]: Finished difference Result 122 states and 127 transitions.
[2018-04-11 22:17:32,158 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2018-04-11 22:17:32,158 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 41
[2018-04-11 22:17:32,159 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:17:32,160 INFO  L225             Difference]: With dead ends: 122
[2018-04-11 22:17:32,160 INFO  L226             Difference]: Without dead ends: 119
[2018-04-11 22:17:32,161 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=4, NotChecked=34, Total=380
[2018-04-11 22:17:32,161 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2018-04-11 22:17:32,171 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117.
[2018-04-11 22:17:32,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 117 states.
[2018-04-11 22:17:32,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions.
[2018-04-11 22:17:32,173 INFO  L78                 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 41
[2018-04-11 22:17:32,173 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:17:32,173 INFO  L459      AbstractCegarLoop]: Abstraction has 117 states and 122 transitions.
[2018-04-11 22:17:32,174 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 22:17:32,174 INFO  L276                IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions.
[2018-04-11 22:17:32,175 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-04-11 22:17:32,175 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:17:32,175 INFO  L355         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:17:32,175 INFO  L408      AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:17:32,175 INFO  L82        PathProgramCache]: Analyzing trace with hash -699612891, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:17:32,182 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:17:32,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:17:32,206 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:17:32,214 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:17:32,215 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:32,222 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:17:32,222 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:32,227 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:32,227 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-04-11 22:17:32,273 WARN  L1033  $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true
[2018-04-11 22:17:32,286 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-04-11 22:17:32,287 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:32,293 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-04-11 22:17:32,293 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:32,295 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:17:32,296 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7
[2018-04-11 22:17:32,319 WARN  L1033  $PredicateComparison]: unable to prove that (and (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (and (= (store |c_old(#length)| v_prenex_1 (* 4 v_prenex_2)) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_1)))) (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n)))) is different from true
[2018-04-11 22:17:32,343 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:17:32,344 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:17:32,345 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:17:32,345 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:32,360 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17
[2018-04-11 22:17:32,360 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:17:32,384 INFO  L267         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars,  End of recursive call: 4 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:17:32,391 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:33
[2018-04-11 22:17:32,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:32,448 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:17:32,545 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 15
[2018-04-11 22:17:40,671 WARN  L151               SmtUtils]: Spent 8060ms on a formula simplification. DAG size of input: 71 DAG size of output 31
[2018-04-11 22:17:40,725 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 8
[2018-04-11 22:17:44,939 WARN  L148               SmtUtils]: Spent 4036ms on a formula simplification that was a NOOP. DAG size: 38
[2018-04-11 22:17:44,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:17:44,998 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:17:44,998 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 15
[2018-04-11 22:17:44,999 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-04-11 22:17:44,999 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-04-11 22:17:45,000 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=142, Unknown=2, NotChecked=50, Total=240
[2018-04-11 22:17:45,000 INFO  L87              Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 16 states.
[2018-04-11 22:17:45,295 WARN  L151               SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 52 DAG size of output 48
[2018-04-11 22:17:45,442 WARN  L151               SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 56 DAG size of output 52
[2018-04-11 22:17:57,433 WARN  L151               SmtUtils]: Spent 2130ms on a formula simplification. DAG size of input: 47 DAG size of output 43
[2018-04-11 22:18:01,939 WARN  L148               SmtUtils]: Spent 2052ms on a formula simplification that was a NOOP. DAG size: 38
[2018-04-11 22:18:02,287 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:18:02,288 INFO  L93              Difference]: Finished difference Result 188 states and 208 transitions.
[2018-04-11 22:18:02,288 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2018-04-11 22:18:02,288 INFO  L78                 Accepts]: Start accepts. Automaton has 16 states. Word has length 41
[2018-04-11 22:18:02,289 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:18:02,290 INFO  L225             Difference]: With dead ends: 188
[2018-04-11 22:18:02,290 INFO  L226             Difference]: Without dead ends: 186
[2018-04-11 22:18:02,291 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=8, NotChecked=94, Total=702
[2018-04-11 22:18:02,291 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 186 states.
[2018-04-11 22:18:02,303 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 129.
[2018-04-11 22:18:02,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 129 states.
[2018-04-11 22:18:02,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions.
[2018-04-11 22:18:02,305 INFO  L78                 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 41
[2018-04-11 22:18:02,306 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:18:02,306 INFO  L459      AbstractCegarLoop]: Abstraction has 129 states and 135 transitions.
[2018-04-11 22:18:02,306 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-04-11 22:18:02,306 INFO  L276                IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions.
[2018-04-11 22:18:02,307 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2018-04-11 22:18:02,307 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:18:02,307 INFO  L355         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:18:02,308 INFO  L408      AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:18:02,308 INFO  L82        PathProgramCache]: Analyzing trace with hash 521847270, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:18:02,323 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:18:02,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:18:02,352 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:18:02,364 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:18:02,365 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:02,385 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:18:02,386 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:02,399 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:02,400 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-04-11 22:18:02,426 WARN  L1033  $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (and (= 0 (select |c_old(#valid)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|)) (= |c_#length| (store |c_old(#length)| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))))) is different from true
[2018-04-11 22:18:02,435 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-04-11 22:18:02,436 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:02,443 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-04-11 22:18:02,443 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:02,447 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:18:02,447 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7
[2018-04-11 22:18:02,474 WARN  L1033  $PredicateComparison]: unable to prove that (and (exists ((|__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base| Int) (__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n Int)) (= (select |c_#length| |__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~#a~0.base|) (* 4 __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__foo_~n))) (exists ((v_prenex_16 Int) (v_prenex_17 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_16)) (= (store |c_old(#length)| v_prenex_16 (* 4 v_prenex_17)) |c_#length|)))) is different from true
[2018-04-11 22:18:02,492 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:18:02,495 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17
[2018-04-11 22:18:02,496 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:02,513 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:18:02,514 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:18:02,514 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:18:02,515 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:02,528 INFO  L267         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars,  End of recursive call: 4 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:18:02,529 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27
[2018-04-11 22:18:02,607 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:18:02,617 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32
[2018-04-11 22:18:02,617 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:18:02,642 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:18:02,643 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:18:02,644 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:18:02,644 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:02,660 INFO  L267         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars,  End of recursive call: 6 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:18:02,660 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:38, output treesize:52
[2018-04-11 22:18:02,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked.
[2018-04-11 22:18:02,718 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:18:04,806 WARN  L148               SmtUtils]: Spent 2042ms on a formula simplification that was a NOOP. DAG size: 26
[2018-04-11 22:18:06,009 WARN  L148               SmtUtils]: Spent 1182ms on a formula simplification that was a NOOP. DAG size: 26
[2018-04-11 22:18:06,079 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:18:06,079 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:18:06,080 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7
[2018-04-11 22:18:06,080 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:06,091 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:18:06,091 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:18:06,092 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16
[2018-04-11 22:18:06,092 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:18:06,100 INFO  L267         ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:18:06,100 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:20
[2018-04-11 22:18:06,935 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:18:06,952 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:18:19,338 WARN  L151               SmtUtils]: Spent 11720ms on a formula simplification. DAG size of input: 99 DAG size of output 41
[2018-04-11 22:18:27,795 WARN  L148               SmtUtils]: Spent 2237ms on a formula simplification that was a NOOP. DAG size: 39
[2018-04-11 22:18:27,842 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 10
[2018-04-11 22:18:30,291 WARN  L151               SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 54 DAG size of output 42
[2018-04-11 22:18:30,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:18:30,357 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:18:30,357 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22
[2018-04-11 22:18:30,358 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-04-11 22:18:30,358 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-04-11 22:18:30,358 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=353, Unknown=7, NotChecked=78, Total=506
[2018-04-11 22:18:30,358 INFO  L87              Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 23 states.
[2018-04-11 22:18:51,637 WARN  L151               SmtUtils]: Spent 10631ms on a formula simplification. DAG size of input: 70 DAG size of output 66
[2018-04-11 22:19:05,268 WARN  L148               SmtUtils]: Spent 8512ms on a formula simplification that was a NOOP. DAG size: 67
[2018-04-11 22:19:07,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:07,840 INFO  L93              Difference]: Finished difference Result 326 states and 371 transitions.
[2018-04-11 22:19:07,841 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2018-04-11 22:19:07,841 INFO  L78                 Accepts]: Start accepts. Automaton has 23 states. Word has length 57
[2018-04-11 22:19:07,842 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:07,844 INFO  L225             Difference]: With dead ends: 326
[2018-04-11 22:19:07,844 INFO  L226             Difference]: Without dead ends: 324
[2018-04-11 22:19:07,846 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 54.7s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=8, NotChecked=182, Total=2352
[2018-04-11 22:19:07,846 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2018-04-11 22:19:07,871 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 220.
[2018-04-11 22:19:07,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 220 states.
[2018-04-11 22:19:07,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 255 transitions.
[2018-04-11 22:19:07,873 INFO  L78                 Accepts]: Start accepts. Automaton has 220 states and 255 transitions. Word has length 57
[2018-04-11 22:19:07,873 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:07,873 INFO  L459      AbstractCegarLoop]: Abstraction has 220 states and 255 transitions.
[2018-04-11 22:19:07,873 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-04-11 22:19:07,873 INFO  L276                IsEmpty]: Start isEmpty. Operand 220 states and 255 transitions.
[2018-04-11 22:19:07,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2018-04-11 22:19:07,874 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:07,874 INFO  L355         BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:07,874 INFO  L408      AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:07,881 INFO  L82        PathProgramCache]: Analyzing trace with hash 1227537339, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:07,891 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:07,910 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:07,913 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:07,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:19:07,930 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:07,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:19:07,970 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:07,970 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8
[2018-04-11 22:19:07,970 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-04-11 22:19:07,971 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-04-11 22:19:07,971 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2018-04-11 22:19:07,971 INFO  L87              Difference]: Start difference. First operand 220 states and 255 transitions. Second operand 8 states.
[2018-04-11 22:19:08,070 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:08,071 INFO  L93              Difference]: Finished difference Result 262 states and 306 transitions.
[2018-04-11 22:19:08,071 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2018-04-11 22:19:08,071 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 57
[2018-04-11 22:19:08,071 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:08,073 INFO  L225             Difference]: With dead ends: 262
[2018-04-11 22:19:08,073 INFO  L226             Difference]: Without dead ends: 245
[2018-04-11 22:19:08,074 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132
[2018-04-11 22:19:08,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2018-04-11 22:19:08,098 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244.
[2018-04-11 22:19:08,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 244 states.
[2018-04-11 22:19:08,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 285 transitions.
[2018-04-11 22:19:08,100 INFO  L78                 Accepts]: Start accepts. Automaton has 244 states and 285 transitions. Word has length 57
[2018-04-11 22:19:08,100 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:08,100 INFO  L459      AbstractCegarLoop]: Abstraction has 244 states and 285 transitions.
[2018-04-11 22:19:08,100 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-04-11 22:19:08,100 INFO  L276                IsEmpty]: Start isEmpty. Operand 244 states and 285 transitions.
[2018-04-11 22:19:08,101 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-04-11 22:19:08,101 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:08,102 INFO  L355         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:08,102 INFO  L408      AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:08,102 INFO  L82        PathProgramCache]: Analyzing trace with hash -1002603825, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:08,109 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:08,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:08,139 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:08,177 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-04-11 22:19:08,177 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:08,181 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars,  End of recursive call: 1 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:08,181 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14
[2018-04-11 22:19:08,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:19:08,208 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:08,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:19:08,286 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:19:08,286 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10
[2018-04-11 22:19:08,287 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-04-11 22:19:08,287 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-04-11 22:19:08,287 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2018-04-11 22:19:08,287 INFO  L87              Difference]: Start difference. First operand 244 states and 285 transitions. Second operand 11 states.
[2018-04-11 22:19:08,494 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:08,494 INFO  L93              Difference]: Finished difference Result 270 states and 313 transitions.
[2018-04-11 22:19:08,495 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2018-04-11 22:19:08,495 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 58
[2018-04-11 22:19:08,495 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:08,497 INFO  L225             Difference]: With dead ends: 270
[2018-04-11 22:19:08,497 INFO  L226             Difference]: Without dead ends: 269
[2018-04-11 22:19:08,498 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272
[2018-04-11 22:19:08,498 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 269 states.
[2018-04-11 22:19:08,535 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 248.
[2018-04-11 22:19:08,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 248 states.
[2018-04-11 22:19:08,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 291 transitions.
[2018-04-11 22:19:08,538 INFO  L78                 Accepts]: Start accepts. Automaton has 248 states and 291 transitions. Word has length 58
[2018-04-11 22:19:08,538 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:08,538 INFO  L459      AbstractCegarLoop]: Abstraction has 248 states and 291 transitions.
[2018-04-11 22:19:08,538 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-04-11 22:19:08,538 INFO  L276                IsEmpty]: Start isEmpty. Operand 248 states and 291 transitions.
[2018-04-11 22:19:08,539 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2018-04-11 22:19:08,539 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:08,540 INFO  L355         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:08,540 INFO  L408      AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:08,540 INFO  L82        PathProgramCache]: Analyzing trace with hash -445614296, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:08,552 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:08,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:08,584 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:08,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:19:08,620 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:08,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:19:08,677 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:19:08,677 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9
[2018-04-11 22:19:08,677 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-04-11 22:19:08,678 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-04-11 22:19:08,678 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2018-04-11 22:19:08,678 INFO  L87              Difference]: Start difference. First operand 248 states and 291 transitions. Second operand 9 states.
[2018-04-11 22:19:08,862 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:08,862 INFO  L93              Difference]: Finished difference Result 414 states and 483 transitions.
[2018-04-11 22:19:08,862 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2018-04-11 22:19:08,863 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 65
[2018-04-11 22:19:08,863 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:08,864 INFO  L225             Difference]: With dead ends: 414
[2018-04-11 22:19:08,864 INFO  L226             Difference]: Without dead ends: 222
[2018-04-11 22:19:08,865 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 119 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2018-04-11 22:19:08,866 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 222 states.
[2018-04-11 22:19:08,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 211.
[2018-04-11 22:19:08,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 211 states.
[2018-04-11 22:19:08,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions.
[2018-04-11 22:19:08,896 INFO  L78                 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 65
[2018-04-11 22:19:08,896 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:08,896 INFO  L459      AbstractCegarLoop]: Abstraction has 211 states and 235 transitions.
[2018-04-11 22:19:08,896 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-04-11 22:19:08,896 INFO  L276                IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions.
[2018-04-11 22:19:08,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2018-04-11 22:19:08,897 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:08,897 INFO  L355         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:08,898 INFO  L408      AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:08,898 INFO  L82        PathProgramCache]: Analyzing trace with hash 165743771, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:08,907 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:08,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:08,939 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:09,024 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:19:09,024 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:09,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:19:09,093 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:09,093 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13
[2018-04-11 22:19:09,093 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-04-11 22:19:09,093 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-04-11 22:19:09,093 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2018-04-11 22:19:09,094 INFO  L87              Difference]: Start difference. First operand 211 states and 235 transitions. Second operand 13 states.
[2018-04-11 22:19:09,272 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:09,272 INFO  L93              Difference]: Finished difference Result 380 states and 426 transitions.
[2018-04-11 22:19:09,272 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2018-04-11 22:19:09,272 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 65
[2018-04-11 22:19:09,273 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:09,274 INFO  L225             Difference]: With dead ends: 380
[2018-04-11 22:19:09,274 INFO  L226             Difference]: Without dead ends: 227
[2018-04-11 22:19:09,275 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420
[2018-04-11 22:19:09,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 227 states.
[2018-04-11 22:19:09,302 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226.
[2018-04-11 22:19:09,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 226 states.
[2018-04-11 22:19:09,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions.
[2018-04-11 22:19:09,304 INFO  L78                 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 65
[2018-04-11 22:19:09,305 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:09,305 INFO  L459      AbstractCegarLoop]: Abstraction has 226 states and 248 transitions.
[2018-04-11 22:19:09,305 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-04-11 22:19:09,305 INFO  L276                IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions.
[2018-04-11 22:19:09,306 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-04-11 22:19:09,306 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:09,306 INFO  L355         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:09,307 INFO  L408      AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:09,307 INFO  L82        PathProgramCache]: Analyzing trace with hash 1185889501, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:09,315 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:09,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:09,341 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:09,425 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-04-11 22:19:09,426 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:09,495 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15
[2018-04-11 22:19:09,495 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:09,503 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2018-04-11 22:19:09,504 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:09,507 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:09,507 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11
[2018-04-11 22:19:09,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-04-11 22:19:09,538 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:09,538 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11
[2018-04-11 22:19:09,538 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-04-11 22:19:09,538 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-04-11 22:19:09,539 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2018-04-11 22:19:09,539 INFO  L87              Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 12 states.
[2018-04-11 22:19:09,940 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:09,940 INFO  L93              Difference]: Finished difference Result 241 states and 261 transitions.
[2018-04-11 22:19:09,941 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2018-04-11 22:19:09,941 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 73
[2018-04-11 22:19:09,941 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:09,942 INFO  L225             Difference]: With dead ends: 241
[2018-04-11 22:19:09,942 INFO  L226             Difference]: Without dead ends: 240
[2018-04-11 22:19:09,942 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240
[2018-04-11 22:19:09,943 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 240 states.
[2018-04-11 22:19:09,962 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 227.
[2018-04-11 22:19:09,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 227 states.
[2018-04-11 22:19:09,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 250 transitions.
[2018-04-11 22:19:09,963 INFO  L78                 Accepts]: Start accepts. Automaton has 227 states and 250 transitions. Word has length 73
[2018-04-11 22:19:09,963 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:09,963 INFO  L459      AbstractCegarLoop]: Abstraction has 227 states and 250 transitions.
[2018-04-11 22:19:09,963 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-04-11 22:19:09,964 INFO  L276                IsEmpty]: Start isEmpty. Operand 227 states and 250 transitions.
[2018-04-11 22:19:09,964 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2018-04-11 22:19:09,964 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:09,965 INFO  L355         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:09,965 INFO  L408      AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:09,965 INFO  L82        PathProgramCache]: Analyzing trace with hash 1185889500, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:09,974 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:09,996 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:09,999 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:10,009 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:19:10,010 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:10,026 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:10,026 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-04-11 22:19:10,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2018-04-11 22:19:10,065 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:10,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2018-04-11 22:19:10,101 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:19:10,102 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4
[2018-04-11 22:19:10,102 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-04-11 22:19:10,102 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-04-11 22:19:10,102 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-04-11 22:19:10,103 INFO  L87              Difference]: Start difference. First operand 227 states and 250 transitions. Second operand 5 states.
[2018-04-11 22:19:10,178 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:10,179 INFO  L93              Difference]: Finished difference Result 227 states and 250 transitions.
[2018-04-11 22:19:10,179 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2018-04-11 22:19:10,179 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 73
[2018-04-11 22:19:10,179 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:10,181 INFO  L225             Difference]: With dead ends: 227
[2018-04-11 22:19:10,181 INFO  L226             Difference]: Without dead ends: 226
[2018-04-11 22:19:10,181 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-04-11 22:19:10,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2018-04-11 22:19:10,211 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226.
[2018-04-11 22:19:10,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 226 states.
[2018-04-11 22:19:10,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions.
[2018-04-11 22:19:10,213 INFO  L78                 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 73
[2018-04-11 22:19:10,213 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:10,213 INFO  L459      AbstractCegarLoop]: Abstraction has 226 states and 248 transitions.
[2018-04-11 22:19:10,213 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-04-11 22:19:10,213 INFO  L276                IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions.
[2018-04-11 22:19:10,214 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2018-04-11 22:19:10,214 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:10,214 INFO  L355         BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:10,215 INFO  L408      AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:10,215 INFO  L82        PathProgramCache]: Analyzing trace with hash -910864110, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:10,224 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:10,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:10,253 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:10,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-04-11 22:19:10,327 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:10,408 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-04-11 22:19:10,428 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:10,428 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15
[2018-04-11 22:19:10,428 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-04-11 22:19:10,428 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-04-11 22:19:10,429 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210
[2018-04-11 22:19:10,429 INFO  L87              Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 15 states.
[2018-04-11 22:19:11,520 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:11,521 INFO  L93              Difference]: Finished difference Result 407 states and 449 transitions.
[2018-04-11 22:19:11,521 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2018-04-11 22:19:11,521 INFO  L78                 Accepts]: Start accepts. Automaton has 15 states. Word has length 81
[2018-04-11 22:19:11,521 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:11,523 INFO  L225             Difference]: With dead ends: 407
[2018-04-11 22:19:11,523 INFO  L226             Difference]: Without dead ends: 248
[2018-04-11 22:19:11,524 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552
[2018-04-11 22:19:11,524 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 248 states.
[2018-04-11 22:19:11,546 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247.
[2018-04-11 22:19:11,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 247 states.
[2018-04-11 22:19:11,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 268 transitions.
[2018-04-11 22:19:11,548 INFO  L78                 Accepts]: Start accepts. Automaton has 247 states and 268 transitions. Word has length 81
[2018-04-11 22:19:11,557 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:11,557 INFO  L459      AbstractCegarLoop]: Abstraction has 247 states and 268 transitions.
[2018-04-11 22:19:11,557 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-04-11 22:19:11,558 INFO  L276                IsEmpty]: Start isEmpty. Operand 247 states and 268 transitions.
[2018-04-11 22:19:11,558 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2018-04-11 22:19:11,558 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:11,558 INFO  L355         BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:11,558 INFO  L408      AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:11,559 INFO  L82        PathProgramCache]: Analyzing trace with hash -1982601529, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:11,565 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:11,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:11,591 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:11,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-04-11 22:19:11,657 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:11,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-04-11 22:19:11,830 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:19:11,830 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 13
[2018-04-11 22:19:11,830 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-04-11 22:19:11,831 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-04-11 22:19:11,831 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2018-04-11 22:19:11,831 INFO  L87              Difference]: Start difference. First operand 247 states and 268 transitions. Second operand 13 states.
[2018-04-11 22:19:11,993 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:11,994 INFO  L93              Difference]: Finished difference Result 406 states and 445 transitions.
[2018-04-11 22:19:11,994 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2018-04-11 22:19:11,994 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 85
[2018-04-11 22:19:11,994 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:11,996 INFO  L225             Difference]: With dead ends: 406
[2018-04-11 22:19:11,996 INFO  L226             Difference]: Without dead ends: 239
[2018-04-11 22:19:11,997 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 151 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306
[2018-04-11 22:19:11,997 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2018-04-11 22:19:12,027 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235.
[2018-04-11 22:19:12,028 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 235 states.
[2018-04-11 22:19:12,029 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 253 transitions.
[2018-04-11 22:19:12,029 INFO  L78                 Accepts]: Start accepts. Automaton has 235 states and 253 transitions. Word has length 85
[2018-04-11 22:19:12,029 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:12,030 INFO  L459      AbstractCegarLoop]: Abstraction has 235 states and 253 transitions.
[2018-04-11 22:19:12,030 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-04-11 22:19:12,030 INFO  L276                IsEmpty]: Start isEmpty. Operand 235 states and 253 transitions.
[2018-04-11 22:19:12,031 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2018-04-11 22:19:12,031 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:12,031 INFO  L355         BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:12,031 INFO  L408      AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:12,031 INFO  L82        PathProgramCache]: Analyzing trace with hash 1400008503, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:12,041 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:12,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:12,072 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:12,095 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8
[2018-04-11 22:19:12,097 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-04-11 22:19:12,097 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:12,112 INFO  L267         ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:12,122 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars,  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:12,122 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11
[2018-04-11 22:19:12,238 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28
[2018-04-11 22:19:12,241 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16
[2018-04-11 22:19:12,241 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:12,252 INFO  L267         ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:12,253 INFO  L267         ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars,  End of recursive call: 3 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:12,253 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11
[2018-04-11 22:19:16,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-04-11 22:19:16,552 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:17,000 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12
[2018-04-11 22:19:17,008 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2018-04-11 22:19:17,008 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:17,010 INFO  L267         ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars,  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:17,013 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars,  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:17,013 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9
[2018-04-11 22:19:17,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2018-04-11 22:19:17,091 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:17,092 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 39
[2018-04-11 22:19:17,092 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-04-11 22:19:17,092 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-04-11 22:19:17,093 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1329, Unknown=0, NotChecked=0, Total=1482
[2018-04-11 22:19:17,093 INFO  L87              Difference]: Start difference. First operand 235 states and 253 transitions. Second operand 39 states.
[2018-04-11 22:19:25,578 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:25,578 INFO  L93              Difference]: Finished difference Result 399 states and 435 transitions.
[2018-04-11 22:19:25,578 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. 
[2018-04-11 22:19:25,578 INFO  L78                 Accepts]: Start accepts. Automaton has 39 states. Word has length 93
[2018-04-11 22:19:25,578 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:25,580 INFO  L225             Difference]: With dead ends: 399
[2018-04-11 22:19:25,580 INFO  L226             Difference]: Without dead ends: 305
[2018-04-11 22:19:25,581 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=611, Invalid=5241, Unknown=0, NotChecked=0, Total=5852
[2018-04-11 22:19:25,581 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 305 states.
[2018-04-11 22:19:25,603 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 221.
[2018-04-11 22:19:25,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 221 states.
[2018-04-11 22:19:25,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 237 transitions.
[2018-04-11 22:19:25,604 INFO  L78                 Accepts]: Start accepts. Automaton has 221 states and 237 transitions. Word has length 93
[2018-04-11 22:19:25,604 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:25,604 INFO  L459      AbstractCegarLoop]: Abstraction has 221 states and 237 transitions.
[2018-04-11 22:19:25,604 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-04-11 22:19:25,604 INFO  L276                IsEmpty]: Start isEmpty. Operand 221 states and 237 transitions.
[2018-04-11 22:19:25,605 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2018-04-11 22:19:25,605 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:25,605 INFO  L355         BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:25,605 INFO  L408      AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:25,605 INFO  L82        PathProgramCache]: Analyzing trace with hash 1367102332, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:25,612 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:25,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:25,637 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:25,640 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:19:25,640 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,649 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:19:25,649 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,653 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,653 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-04-11 22:19:25,681 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-04-11 22:19:25,682 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,684 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-04-11 22:19:25,684 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,685 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:25,686 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7
[2018-04-11 22:19:25,726 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:25,728 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17
[2018-04-11 22:19:25,729 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,745 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:25,746 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:25,746 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:19:25,746 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,755 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:25,755 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23
[2018-04-11 22:19:25,839 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-04-11 22:19:25,840 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,845 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-04-11 22:19:25,846 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,847 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:25,848 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7
[2018-04-11 22:19:25,871 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:25,872 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:25,873 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:19:25,873 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:25,902 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32
[2018-04-11 22:19:25,902 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:25,932 INFO  L267         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars,  End of recursive call: 6 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:19:25,932 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:58
[2018-04-11 22:19:25,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2018-04-11 22:19:25,992 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:26,051 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,117 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,127 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,136 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,146 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,155 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,165 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,174 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,191 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,201 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,210 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,219 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,228 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,237 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,247 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,258 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,279 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,287 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,296 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,305 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,314 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:26,327 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 64
[2018-04-11 22:19:26,455 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 64
[2018-04-11 22:19:26,507 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 64
[2018-04-11 22:19:26,558 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 64
[2018-04-11 22:19:26,685 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:26,686 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:26,686 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19
[2018-04-11 22:19:26,687 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:26,722 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:26,722 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:26,723 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12
[2018-04-11 22:19:26,723 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:26,732 INFO  L267         ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:19:26,732 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:28
[2018-04-11 22:19:26,855 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:26,973 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,018 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,061 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,105 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,146 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,192 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,237 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,297 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,342 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,386 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,428 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,469 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 48
[2018-04-11 22:19:27,521 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 100
[2018-04-11 22:19:27,971 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 100
[2018-04-11 22:19:28,301 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 100
[2018-04-11 22:19:28,636 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 100
[2018-04-11 22:19:29,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2018-04-11 22:19:29,139 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:29,139 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22
[2018-04-11 22:19:29,139 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-04-11 22:19:29,139 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-04-11 22:19:29,139 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506
[2018-04-11 22:19:29,140 INFO  L87              Difference]: Start difference. First operand 221 states and 237 transitions. Second operand 23 states.
[2018-04-11 22:19:30,836 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:30,837 INFO  L93              Difference]: Finished difference Result 227 states and 246 transitions.
[2018-04-11 22:19:30,837 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2018-04-11 22:19:30,837 INFO  L78                 Accepts]: Start accepts. Automaton has 23 states. Word has length 93
[2018-04-11 22:19:30,837 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:30,838 INFO  L225             Difference]: With dead ends: 227
[2018-04-11 22:19:30,838 INFO  L226             Difference]: Without dead ends: 226
[2018-04-11 22:19:30,839 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190
[2018-04-11 22:19:30,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2018-04-11 22:19:30,861 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226.
[2018-04-11 22:19:30,861 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 226 states.
[2018-04-11 22:19:30,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 243 transitions.
[2018-04-11 22:19:30,862 INFO  L78                 Accepts]: Start accepts. Automaton has 226 states and 243 transitions. Word has length 93
[2018-04-11 22:19:30,862 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:30,863 INFO  L459      AbstractCegarLoop]: Abstraction has 226 states and 243 transitions.
[2018-04-11 22:19:30,863 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-04-11 22:19:30,863 INFO  L276                IsEmpty]: Start isEmpty. Operand 226 states and 243 transitions.
[2018-04-11 22:19:30,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2018-04-11 22:19:30,864 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:30,864 INFO  L355         BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:30,864 INFO  L408      AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:30,864 INFO  L82        PathProgramCache]: Analyzing trace with hash -1499412932, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:30,877 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:30,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:30,922 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:30,942 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:30,943 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:30,944 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-04-11 22:19:30,944 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:30,951 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars,  End of recursive call: 1 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:30,951 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15
[2018-04-11 22:19:30,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 69 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2018-04-11 22:19:30,970 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:31,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 69 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2018-04-11 22:19:31,029 INFO  L320   seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences.
[2018-04-11 22:19:31,030 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8
[2018-04-11 22:19:31,030 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-04-11 22:19:31,030 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-04-11 22:19:31,030 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2018-04-11 22:19:31,030 INFO  L87              Difference]: Start difference. First operand 226 states and 243 transitions. Second operand 9 states.
[2018-04-11 22:19:31,116 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:31,116 INFO  L93              Difference]: Finished difference Result 226 states and 243 transitions.
[2018-04-11 22:19:31,116 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2018-04-11 22:19:31,116 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 109
[2018-04-11 22:19:31,116 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:31,117 INFO  L225             Difference]: With dead ends: 226
[2018-04-11 22:19:31,118 INFO  L226             Difference]: Without dead ends: 225
[2018-04-11 22:19:31,118 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2018-04-11 22:19:31,118 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 225 states.
[2018-04-11 22:19:31,142 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225.
[2018-04-11 22:19:31,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 225 states.
[2018-04-11 22:19:31,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 239 transitions.
[2018-04-11 22:19:31,143 INFO  L78                 Accepts]: Start accepts. Automaton has 225 states and 239 transitions. Word has length 109
[2018-04-11 22:19:31,144 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:31,144 INFO  L459      AbstractCegarLoop]: Abstraction has 225 states and 239 transitions.
[2018-04-11 22:19:31,144 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-04-11 22:19:31,144 INFO  L276                IsEmpty]: Start isEmpty. Operand 225 states and 239 transitions.
[2018-04-11 22:19:31,145 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2018-04-11 22:19:31,145 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:31,145 INFO  L355         BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:31,145 INFO  L408      AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:31,146 INFO  L82        PathProgramCache]: Analyzing trace with hash 543476210, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:31,156 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:31,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:31,192 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:31,245 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:31,246 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22
[2018-04-11 22:19:31,246 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:31,259 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:31,260 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:31,260 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:19:31,260 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:31,267 INFO  L267         ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars,  End of recursive call: 3 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:31,268 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:28
[2018-04-11 22:19:31,358 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2018-04-11 22:19:31,358 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:31,518 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:31,518 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:31,519 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19
[2018-04-11 22:19:31,519 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:31,530 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17
[2018-04-11 22:19:31,531 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:31,540 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26
[2018-04-11 22:19:31,541 INFO  L267         ElimStorePlain]: Start of recursive call 4:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:31,549 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:31,549 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:31,550 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9
[2018-04-11 22:19:31,550 INFO  L267         ElimStorePlain]: Start of recursive call 5:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:31,555 INFO  L267         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars,  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:31,556 INFO  L202         ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:66, output treesize:11
[2018-04-11 22:19:31,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2018-04-11 22:19:31,676 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:31,676 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23
[2018-04-11 22:19:31,676 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-04-11 22:19:31,677 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-04-11 22:19:31,677 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552
[2018-04-11 22:19:31,677 INFO  L87              Difference]: Start difference. First operand 225 states and 239 transitions. Second operand 24 states.
[2018-04-11 22:19:33,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:33,237 INFO  L93              Difference]: Finished difference Result 277 states and 301 transitions.
[2018-04-11 22:19:33,237 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2018-04-11 22:19:33,238 INFO  L78                 Accepts]: Start accepts. Automaton has 24 states. Word has length 117
[2018-04-11 22:19:33,238 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:33,239 INFO  L225             Difference]: With dead ends: 277
[2018-04-11 22:19:33,239 INFO  L226             Difference]: Without dead ends: 276
[2018-04-11 22:19:33,239 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=309, Invalid=1761, Unknown=0, NotChecked=0, Total=2070
[2018-04-11 22:19:33,240 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 276 states.
[2018-04-11 22:19:33,266 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 239.
[2018-04-11 22:19:33,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 239 states.
[2018-04-11 22:19:33,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 254 transitions.
[2018-04-11 22:19:33,267 INFO  L78                 Accepts]: Start accepts. Automaton has 239 states and 254 transitions. Word has length 117
[2018-04-11 22:19:33,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:33,267 INFO  L459      AbstractCegarLoop]: Abstraction has 239 states and 254 transitions.
[2018-04-11 22:19:33,268 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-04-11 22:19:33,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions.
[2018-04-11 22:19:33,268 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2018-04-11 22:19:33,268 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:33,268 INFO  L355         BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:33,268 INFO  L408      AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:33,268 INFO  L82        PathProgramCache]: Analyzing trace with hash -332106685, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:33,274 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:33,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:33,306 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:33,340 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-04-11 22:19:33,340 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:33,344 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars,  End of recursive call: 1 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:33,344 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14
[2018-04-11 22:19:33,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2018-04-11 22:19:33,411 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:33,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2018-04-11 22:19:33,518 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:33,518 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16
[2018-04-11 22:19:33,519 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-04-11 22:19:33,519 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-04-11 22:19:33,519 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272
[2018-04-11 22:19:33,519 INFO  L87              Difference]: Start difference. First operand 239 states and 254 transitions. Second operand 17 states.
[2018-04-11 22:19:33,968 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:33,968 INFO  L93              Difference]: Finished difference Result 290 states and 316 transitions.
[2018-04-11 22:19:33,968 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2018-04-11 22:19:33,968 INFO  L78                 Accepts]: Start accepts. Automaton has 17 states. Word has length 118
[2018-04-11 22:19:33,969 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:33,970 INFO  L225             Difference]: With dead ends: 290
[2018-04-11 22:19:33,970 INFO  L226             Difference]: Without dead ends: 289
[2018-04-11 22:19:33,970 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 217 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870
[2018-04-11 22:19:33,970 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2018-04-11 22:19:33,998 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 241.
[2018-04-11 22:19:33,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 241 states.
[2018-04-11 22:19:33,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 256 transitions.
[2018-04-11 22:19:33,999 INFO  L78                 Accepts]: Start accepts. Automaton has 241 states and 256 transitions. Word has length 118
[2018-04-11 22:19:33,999 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:33,999 INFO  L459      AbstractCegarLoop]: Abstraction has 241 states and 256 transitions.
[2018-04-11 22:19:33,999 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-04-11 22:19:33,999 INFO  L276                IsEmpty]: Start isEmpty. Operand 241 states and 256 transitions.
[2018-04-11 22:19:34,000 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2018-04-11 22:19:34,000 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:34,000 INFO  L355         BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:34,000 INFO  L408      AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:34,001 INFO  L82        PathProgramCache]: Analyzing trace with hash 936921255, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:34,009 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:34,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:34,039 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:34,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 107 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2018-04-11 22:19:34,111 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:34,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 107 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2018-04-11 22:19:34,204 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:34,205 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19
[2018-04-11 22:19:34,205 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-04-11 22:19:34,205 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-04-11 22:19:34,205 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342
[2018-04-11 22:19:34,205 INFO  L87              Difference]: Start difference. First operand 241 states and 256 transitions. Second operand 19 states.
[2018-04-11 22:19:34,521 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:34,521 INFO  L93              Difference]: Finished difference Result 442 states and 476 transitions.
[2018-04-11 22:19:34,521 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2018-04-11 22:19:34,521 INFO  L78                 Accepts]: Start accepts. Automaton has 19 states. Word has length 125
[2018-04-11 22:19:34,522 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:34,523 INFO  L225             Difference]: With dead ends: 442
[2018-04-11 22:19:34,523 INFO  L226             Difference]: Without dead ends: 301
[2018-04-11 22:19:34,523 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 227 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=844, Unknown=0, NotChecked=0, Total=1056
[2018-04-11 22:19:34,524 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 301 states.
[2018-04-11 22:19:34,565 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 226.
[2018-04-11 22:19:34,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 226 states.
[2018-04-11 22:19:34,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 234 transitions.
[2018-04-11 22:19:34,566 INFO  L78                 Accepts]: Start accepts. Automaton has 226 states and 234 transitions. Word has length 125
[2018-04-11 22:19:34,567 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:34,567 INFO  L459      AbstractCegarLoop]: Abstraction has 226 states and 234 transitions.
[2018-04-11 22:19:34,567 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-04-11 22:19:34,567 INFO  L276                IsEmpty]: Start isEmpty. Operand 226 states and 234 transitions.
[2018-04-11 22:19:34,567 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2018-04-11 22:19:34,567 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:34,567 INFO  L355         BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:34,568 INFO  L408      AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:34,568 INFO  L82        PathProgramCache]: Analyzing trace with hash 1289322601, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:34,574 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:34,603 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:34,606 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:34,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 116 backedges. 76 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2018-04-11 22:19:34,659 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:34,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 116 backedges. 76 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2018-04-11 22:19:34,759 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:34,760 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 15
[2018-04-11 22:19:34,760 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-04-11 22:19:34,760 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-04-11 22:19:34,760 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210
[2018-04-11 22:19:34,761 INFO  L87              Difference]: Start difference. First operand 226 states and 234 transitions. Second operand 15 states.
[2018-04-11 22:19:35,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:35,005 INFO  L93              Difference]: Finished difference Result 331 states and 347 transitions.
[2018-04-11 22:19:35,005 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2018-04-11 22:19:35,005 INFO  L78                 Accepts]: Start accepts. Automaton has 15 states. Word has length 133
[2018-04-11 22:19:35,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:35,007 INFO  L225             Difference]: With dead ends: 331
[2018-04-11 22:19:35,007 INFO  L226             Difference]: Without dead ends: 229
[2018-04-11 22:19:35,008 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 247 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600
[2018-04-11 22:19:35,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 229 states.
[2018-04-11 22:19:35,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226.
[2018-04-11 22:19:35,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 226 states.
[2018-04-11 22:19:35,039 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 232 transitions.
[2018-04-11 22:19:35,039 INFO  L78                 Accepts]: Start accepts. Automaton has 226 states and 232 transitions. Word has length 133
[2018-04-11 22:19:35,040 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:35,040 INFO  L459      AbstractCegarLoop]: Abstraction has 226 states and 232 transitions.
[2018-04-11 22:19:35,040 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-04-11 22:19:35,040 INFO  L276                IsEmpty]: Start isEmpty. Operand 226 states and 232 transitions.
[2018-04-11 22:19:35,041 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2018-04-11 22:19:35,041 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:35,041 INFO  L355         BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:35,041 INFO  L408      AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:35,041 INFO  L82        PathProgramCache]: Analyzing trace with hash -1045760738, now seen corresponding path program 3 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:35,047 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:35,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:35,087 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:35,217 INFO  L134       CoverageAnalysis]: Checked inductivity of 138 backedges. 69 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2018-04-11 22:19:35,217 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:35,294 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15
[2018-04-11 22:19:35,295 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:35,301 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15
[2018-04-11 22:19:35,301 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:35,304 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:35,304 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11
[2018-04-11 22:19:35,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 138 backedges. 69 proven. 11 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2018-04-11 22:19:35,411 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:35,411 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21
[2018-04-11 22:19:35,412 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-04-11 22:19:35,412 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-04-11 22:19:35,412 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462
[2018-04-11 22:19:35,412 INFO  L87              Difference]: Start difference. First operand 226 states and 232 transitions. Second operand 22 states.
[2018-04-11 22:19:35,869 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:35,870 INFO  L93              Difference]: Finished difference Result 242 states and 250 transitions.
[2018-04-11 22:19:35,870 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2018-04-11 22:19:35,870 INFO  L78                 Accepts]: Start accepts. Automaton has 22 states. Word has length 141
[2018-04-11 22:19:35,870 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:35,871 INFO  L225             Difference]: With dead ends: 242
[2018-04-11 22:19:35,871 INFO  L226             Difference]: Without dead ends: 241
[2018-04-11 22:19:35,872 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992
[2018-04-11 22:19:35,872 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 241 states.
[2018-04-11 22:19:35,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 234.
[2018-04-11 22:19:35,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 234 states.
[2018-04-11 22:19:35,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 241 transitions.
[2018-04-11 22:19:35,909 INFO  L78                 Accepts]: Start accepts. Automaton has 234 states and 241 transitions. Word has length 141
[2018-04-11 22:19:35,909 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:35,909 INFO  L459      AbstractCegarLoop]: Abstraction has 234 states and 241 transitions.
[2018-04-11 22:19:35,909 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-04-11 22:19:35,909 INFO  L276                IsEmpty]: Start isEmpty. Operand 234 states and 241 transitions.
[2018-04-11 22:19:35,910 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2018-04-11 22:19:35,910 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:35,910 INFO  L355         BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:35,910 INFO  L408      AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:35,910 INFO  L82        PathProgramCache]: Analyzing trace with hash -287754157, now seen corresponding path program 4 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:35,916 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:35,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:35,957 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:36,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 161 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2018-04-11 22:19:36,051 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:36,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 161 backedges. 99 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2018-04-11 22:19:36,167 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:36,167 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 21
[2018-04-11 22:19:36,167 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-04-11 22:19:36,168 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-04-11 22:19:36,168 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420
[2018-04-11 22:19:36,168 INFO  L87              Difference]: Start difference. First operand 234 states and 241 transitions. Second operand 21 states.
[2018-04-11 22:19:36,479 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:36,479 INFO  L93              Difference]: Finished difference Result 375 states and 390 transitions.
[2018-04-11 22:19:36,479 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2018-04-11 22:19:36,480 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states. Word has length 149
[2018-04-11 22:19:36,480 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:36,481 INFO  L225             Difference]: With dead ends: 375
[2018-04-11 22:19:36,481 INFO  L226             Difference]: Without dead ends: 266
[2018-04-11 22:19:36,481 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 270 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260
[2018-04-11 22:19:36,482 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2018-04-11 22:19:36,513 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260.
[2018-04-11 22:19:36,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 260 states.
[2018-04-11 22:19:36,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 267 transitions.
[2018-04-11 22:19:36,514 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 267 transitions. Word has length 149
[2018-04-11 22:19:36,514 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:36,514 INFO  L459      AbstractCegarLoop]: Abstraction has 260 states and 267 transitions.
[2018-04-11 22:19:36,515 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-04-11 22:19:36,515 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 267 transitions.
[2018-04-11 22:19:36,515 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2018-04-11 22:19:36,515 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:36,516 INFO  L355         BasicCegarLoop]: trace histogram [6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:36,516 INFO  L408      AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:36,516 INFO  L82        PathProgramCache]: Analyzing trace with hash 1866410062, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:36,529 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:36,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:36,573 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:37,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 168 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2018-04-11 22:19:37,039 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:37,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 168 backedges. 109 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2018-04-11 22:19:37,243 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:37,244 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19
[2018-04-11 22:19:37,244 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-04-11 22:19:37,245 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-04-11 22:19:37,245 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342
[2018-04-11 22:19:37,245 INFO  L87              Difference]: Start difference. First operand 260 states and 267 transitions. Second operand 19 states.
[2018-04-11 22:19:37,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:37,490 INFO  L93              Difference]: Finished difference Result 391 states and 405 transitions.
[2018-04-11 22:19:37,490 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2018-04-11 22:19:37,490 INFO  L78                 Accepts]: Start accepts. Automaton has 19 states. Word has length 163
[2018-04-11 22:19:37,491 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:37,491 INFO  L225             Difference]: With dead ends: 391
[2018-04-11 22:19:37,491 INFO  L226             Difference]: Without dead ends: 264
[2018-04-11 22:19:37,492 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 301 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812
[2018-04-11 22:19:37,492 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 264 states.
[2018-04-11 22:19:37,532 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260.
[2018-04-11 22:19:37,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 260 states.
[2018-04-11 22:19:37,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 265 transitions.
[2018-04-11 22:19:37,533 INFO  L78                 Accepts]: Start accepts. Automaton has 260 states and 265 transitions. Word has length 163
[2018-04-11 22:19:37,534 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:37,534 INFO  L459      AbstractCegarLoop]: Abstraction has 260 states and 265 transitions.
[2018-04-11 22:19:37,534 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-04-11 22:19:37,534 INFO  L276                IsEmpty]: Start isEmpty. Operand 260 states and 265 transitions.
[2018-04-11 22:19:37,535 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 172
[2018-04-11 22:19:37,535 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:37,535 INFO  L355         BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:37,536 INFO  L408      AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:37,536 INFO  L82        PathProgramCache]: Analyzing trace with hash -1118968381, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:37,544 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:37,603 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:37,607 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:37,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2018-04-11 22:19:37,667 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:37,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2018-04-11 22:19:37,912 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:37,912 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16
[2018-04-11 22:19:37,913 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-04-11 22:19:37,913 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-04-11 22:19:37,913 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240
[2018-04-11 22:19:37,913 INFO  L87              Difference]: Start difference. First operand 260 states and 265 transitions. Second operand 16 states.
[2018-04-11 22:19:38,165 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:38,165 INFO  L93              Difference]: Finished difference Result 312 states and 324 transitions.
[2018-04-11 22:19:38,165 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2018-04-11 22:19:38,165 INFO  L78                 Accepts]: Start accepts. Automaton has 16 states. Word has length 171
[2018-04-11 22:19:38,165 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:38,166 INFO  L225             Difference]: With dead ends: 312
[2018-04-11 22:19:38,166 INFO  L226             Difference]: Without dead ends: 296
[2018-04-11 22:19:38,167 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756
[2018-04-11 22:19:38,167 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 296 states.
[2018-04-11 22:19:38,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 293.
[2018-04-11 22:19:38,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 293 states.
[2018-04-11 22:19:38,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 304 transitions.
[2018-04-11 22:19:38,225 INFO  L78                 Accepts]: Start accepts. Automaton has 293 states and 304 transitions. Word has length 171
[2018-04-11 22:19:38,226 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:38,226 INFO  L459      AbstractCegarLoop]: Abstraction has 293 states and 304 transitions.
[2018-04-11 22:19:38,226 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-04-11 22:19:38,226 INFO  L276                IsEmpty]: Start isEmpty. Operand 293 states and 304 transitions.
[2018-04-11 22:19:38,227 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 194
[2018-04-11 22:19:38,227 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:38,227 INFO  L355         BasicCegarLoop]: trace histogram [9, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:38,228 INFO  L408      AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:38,228 INFO  L82        PathProgramCache]: Analyzing trace with hash 506429987, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:38,242 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:38,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:38,312 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:38,396 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:38,397 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:38,398 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:19:38,398 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:38,408 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22
[2018-04-11 22:19:38,409 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:38,416 INFO  L267         ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars,  End of recursive call: 3 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:38,417 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:28
[2018-04-11 22:19:38,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 300 backedges. 112 proven. 31 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2018-04-11 22:19:38,623 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:38,852 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26
[2018-04-11 22:19:38,853 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:38,866 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:38,866 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:38,867 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2018-04-11 22:19:38,867 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:38,877 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17
[2018-04-11 22:19:38,878 INFO  L267         ElimStorePlain]: Start of recursive call 4:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:38,886 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:38,887 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:38,887 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9
[2018-04-11 22:19:38,887 INFO  L267         ElimStorePlain]: Start of recursive call 5:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:38,893 INFO  L267         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars,  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:38,893 INFO  L202         ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:66, output treesize:11
[2018-04-11 22:19:39,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 300 backedges. 104 proven. 39 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2018-04-11 22:19:39,107 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:39,107 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31
[2018-04-11 22:19:39,108 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 32 states
[2018-04-11 22:19:39,108 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2018-04-11 22:19:39,108 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992
[2018-04-11 22:19:39,108 INFO  L87              Difference]: Start difference. First operand 293 states and 304 transitions. Second operand 32 states.
[2018-04-11 22:19:41,088 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:41,088 INFO  L93              Difference]: Finished difference Result 319 states and 336 transitions.
[2018-04-11 22:19:41,088 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2018-04-11 22:19:41,088 INFO  L78                 Accepts]: Start accepts. Automaton has 32 states. Word has length 193
[2018-04-11 22:19:41,089 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:41,090 INFO  L225             Difference]: With dead ends: 319
[2018-04-11 22:19:41,090 INFO  L226             Difference]: Without dead ends: 318
[2018-04-11 22:19:41,092 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=440, Invalid=3100, Unknown=0, NotChecked=0, Total=3540
[2018-04-11 22:19:41,092 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2018-04-11 22:19:41,148 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 300.
[2018-04-11 22:19:41,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 300 states.
[2018-04-11 22:19:41,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 312 transitions.
[2018-04-11 22:19:41,150 INFO  L78                 Accepts]: Start accepts. Automaton has 300 states and 312 transitions. Word has length 193
[2018-04-11 22:19:41,150 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:41,150 INFO  L459      AbstractCegarLoop]: Abstraction has 300 states and 312 transitions.
[2018-04-11 22:19:41,150 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 32 states.
[2018-04-11 22:19:41,150 INFO  L276                IsEmpty]: Start isEmpty. Operand 300 states and 312 transitions.
[2018-04-11 22:19:41,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2018-04-11 22:19:41,151 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:41,151 INFO  L355         BasicCegarLoop]: trace histogram [9, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:41,151 INFO  L408      AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:41,151 INFO  L82        PathProgramCache]: Analyzing trace with hash -1480539598, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:41,157 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:41,216 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:41,221 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:41,372 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-04-11 22:19:41,373 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:41,379 INFO  L267         ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars,  End of recursive call: 1 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:41,379 INFO  L202         ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14
[2018-04-11 22:19:41,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 305 backedges. 132 proven. 16 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2018-04-11 22:19:41,617 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:42,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 305 backedges. 132 proven. 16 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2018-04-11 22:19:42,038 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:42,038 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22
[2018-04-11 22:19:42,038 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 23 states
[2018-04-11 22:19:42,039 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2018-04-11 22:19:42,039 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506
[2018-04-11 22:19:42,039 INFO  L87              Difference]: Start difference. First operand 300 states and 312 transitions. Second operand 23 states.
[2018-04-11 22:19:42,751 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:42,752 INFO  L93              Difference]: Finished difference Result 337 states and 354 transitions.
[2018-04-11 22:19:42,789 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2018-04-11 22:19:42,789 INFO  L78                 Accepts]: Start accepts. Automaton has 23 states. Word has length 194
[2018-04-11 22:19:42,790 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:42,791 INFO  L225             Difference]: With dead ends: 337
[2018-04-11 22:19:42,792 INFO  L226             Difference]: Without dead ends: 336
[2018-04-11 22:19:42,792 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 359 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1367, Unknown=0, NotChecked=0, Total=1640
[2018-04-11 22:19:42,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 336 states.
[2018-04-11 22:19:42,839 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301.
[2018-04-11 22:19:42,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 301 states.
[2018-04-11 22:19:42,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 313 transitions.
[2018-04-11 22:19:42,841 INFO  L78                 Accepts]: Start accepts. Automaton has 301 states and 313 transitions. Word has length 194
[2018-04-11 22:19:42,841 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:42,841 INFO  L459      AbstractCegarLoop]: Abstraction has 301 states and 313 transitions.
[2018-04-11 22:19:42,841 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 23 states.
[2018-04-11 22:19:42,841 INFO  L276                IsEmpty]: Start isEmpty. Operand 301 states and 313 transitions.
[2018-04-11 22:19:42,842 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2018-04-11 22:19:42,842 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:42,842 INFO  L355         BasicCegarLoop]: trace histogram [10, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:42,842 INFO  L408      AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:42,842 INFO  L82        PathProgramCache]: Analyzing trace with hash 1552170968, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:42,848 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:42,893 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:42,897 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:43,027 INFO  L134       CoverageAnalysis]: Checked inductivity of 349 backedges. 156 proven. 36 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2018-04-11 22:19:43,027 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:43,170 INFO  L134       CoverageAnalysis]: Checked inductivity of 349 backedges. 156 proven. 36 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2018-04-11 22:19:43,189 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:43,189 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25
[2018-04-11 22:19:43,190 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-04-11 22:19:43,190 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-04-11 22:19:43,190 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600
[2018-04-11 22:19:43,190 INFO  L87              Difference]: Start difference. First operand 301 states and 313 transitions. Second operand 25 states.
[2018-04-11 22:19:43,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:43,679 INFO  L93              Difference]: Finished difference Result 489 states and 516 transitions.
[2018-04-11 22:19:43,679 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2018-04-11 22:19:43,679 INFO  L78                 Accepts]: Start accepts. Automaton has 25 states. Word has length 201
[2018-04-11 22:19:43,680 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:43,681 INFO  L225             Difference]: With dead ends: 489
[2018-04-11 22:19:43,681 INFO  L226             Difference]: Without dead ends: 360
[2018-04-11 22:19:43,682 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 369 SyntacticMatches, 9 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=363, Invalid=1617, Unknown=0, NotChecked=0, Total=1980
[2018-04-11 22:19:43,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 360 states.
[2018-04-11 22:19:43,726 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 346.
[2018-04-11 22:19:43,726 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 346 states.
[2018-04-11 22:19:43,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 360 transitions.
[2018-04-11 22:19:43,727 INFO  L78                 Accepts]: Start accepts. Automaton has 346 states and 360 transitions. Word has length 201
[2018-04-11 22:19:43,728 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:43,728 INFO  L459      AbstractCegarLoop]: Abstraction has 346 states and 360 transitions.
[2018-04-11 22:19:43,728 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-04-11 22:19:43,728 INFO  L276                IsEmpty]: Start isEmpty. Operand 346 states and 360 transitions.
[2018-04-11 22:19:43,729 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 218
[2018-04-11 22:19:43,729 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:43,729 INFO  L355         BasicCegarLoop]: trace histogram [9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:43,729 INFO  L408      AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:43,729 INFO  L82        PathProgramCache]: Analyzing trace with hash -927285809, now seen corresponding path program 1 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:43,742 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:43,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:43,804 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:43,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 402 backedges. 219 proven. 12 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked.
[2018-04-11 22:19:43,925 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:44,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 402 backedges. 219 proven. 12 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked.
[2018-04-11 22:19:44,061 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:44,061 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 21
[2018-04-11 22:19:44,062 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-04-11 22:19:44,062 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-04-11 22:19:44,062 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420
[2018-04-11 22:19:44,063 INFO  L87              Difference]: Start difference. First operand 346 states and 360 transitions. Second operand 21 states.
[2018-04-11 22:19:44,455 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:44,456 INFO  L93              Difference]: Finished difference Result 491 states and 520 transitions.
[2018-04-11 22:19:44,456 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2018-04-11 22:19:44,456 INFO  L78                 Accepts]: Start accepts. Automaton has 21 states. Word has length 217
[2018-04-11 22:19:44,456 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:44,457 INFO  L225             Difference]: With dead ends: 491
[2018-04-11 22:19:44,457 INFO  L226             Difference]: Without dead ends: 349
[2018-04-11 22:19:44,458 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 406 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260
[2018-04-11 22:19:44,458 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 349 states.
[2018-04-11 22:19:44,503 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346.
[2018-04-11 22:19:44,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 346 states.
[2018-04-11 22:19:44,504 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 358 transitions.
[2018-04-11 22:19:44,504 INFO  L78                 Accepts]: Start accepts. Automaton has 346 states and 358 transitions. Word has length 217
[2018-04-11 22:19:44,505 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:44,505 INFO  L459      AbstractCegarLoop]: Abstraction has 346 states and 358 transitions.
[2018-04-11 22:19:44,505 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-04-11 22:19:44,505 INFO  L276                IsEmpty]: Start isEmpty. Operand 346 states and 358 transitions.
[2018-04-11 22:19:44,506 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2018-04-11 22:19:44,506 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:44,506 INFO  L355         BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:44,506 INFO  L408      AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:44,507 INFO  L82        PathProgramCache]: Analyzing trace with hash 1779362948, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:44,515 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:44,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:44,568 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:44,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 450 backedges. 217 proven. 28 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked.
[2018-04-11 22:19:44,799 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:44,948 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15
[2018-04-11 22:19:44,948 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:44,955 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15
[2018-04-11 22:19:44,955 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:44,958 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:44,958 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11
[2018-04-11 22:19:45,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 450 backedges. 210 proven. 35 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked.
[2018-04-11 22:19:45,157 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:45,157 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29
[2018-04-11 22:19:45,157 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 30 states
[2018-04-11 22:19:45,158 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2018-04-11 22:19:45,158 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870
[2018-04-11 22:19:45,158 INFO  L87              Difference]: Start difference. First operand 346 states and 358 transitions. Second operand 30 states.
[2018-04-11 22:19:45,913 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:45,913 INFO  L93              Difference]: Finished difference Result 362 states and 376 transitions.
[2018-04-11 22:19:45,913 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2018-04-11 22:19:45,914 INFO  L78                 Accepts]: Start accepts. Automaton has 30 states. Word has length 225
[2018-04-11 22:19:45,914 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:45,915 INFO  L225             Difference]: With dead ends: 362
[2018-04-11 22:19:45,915 INFO  L226             Difference]: Without dead ends: 361
[2018-04-11 22:19:45,916 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=301, Invalid=1679, Unknown=0, NotChecked=0, Total=1980
[2018-04-11 22:19:45,916 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 361 states.
[2018-04-11 22:19:45,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 354.
[2018-04-11 22:19:45,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 354 states.
[2018-04-11 22:19:45,961 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 367 transitions.
[2018-04-11 22:19:45,962 INFO  L78                 Accepts]: Start accepts. Automaton has 354 states and 367 transitions. Word has length 225
[2018-04-11 22:19:45,962 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:45,962 INFO  L459      AbstractCegarLoop]: Abstraction has 354 states and 367 transitions.
[2018-04-11 22:19:45,962 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 30 states.
[2018-04-11 22:19:45,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 354 states and 367 transitions.
[2018-04-11 22:19:45,963 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2018-04-11 22:19:45,963 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:45,963 INFO  L355         BasicCegarLoop]: trace histogram [10, 10, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:45,963 INFO  L408      AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:45,963 INFO  L82        PathProgramCache]: Analyzing trace with hash -1634047559, now seen corresponding path program 3 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:45,969 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:46,033 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:46,038 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:46,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 499 backedges. 276 proven. 36 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked.
[2018-04-11 22:19:46,213 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:46,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 499 backedges. 276 proven. 36 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked.
[2018-04-11 22:19:46,382 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:46,382 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 27
[2018-04-11 22:19:46,382 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-04-11 22:19:46,383 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-04-11 22:19:46,383 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2018-04-11 22:19:46,383 INFO  L87              Difference]: Start difference. First operand 354 states and 367 transitions. Second operand 27 states.
[2018-04-11 22:19:46,898 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:46,898 INFO  L93              Difference]: Finished difference Result 541 states and 566 transitions.
[2018-04-11 22:19:46,898 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2018-04-11 22:19:46,898 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states. Word has length 233
[2018-04-11 22:19:46,899 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:46,900 INFO  L225             Difference]: With dead ends: 541
[2018-04-11 22:19:46,900 INFO  L226             Difference]: Without dead ends: 392
[2018-04-11 22:19:46,901 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 429 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=1885, Unknown=0, NotChecked=0, Total=2256
[2018-04-11 22:19:46,901 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2018-04-11 22:19:46,947 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388.
[2018-04-11 22:19:46,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 388 states.
[2018-04-11 22:19:46,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 401 transitions.
[2018-04-11 22:19:46,949 INFO  L78                 Accepts]: Start accepts. Automaton has 388 states and 401 transitions. Word has length 233
[2018-04-11 22:19:46,949 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:46,949 INFO  L459      AbstractCegarLoop]: Abstraction has 388 states and 401 transitions.
[2018-04-11 22:19:46,949 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-04-11 22:19:46,949 INFO  L276                IsEmpty]: Start isEmpty. Operand 388 states and 401 transitions.
[2018-04-11 22:19:46,950 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2018-04-11 22:19:46,950 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:46,950 INFO  L355         BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:46,950 INFO  L408      AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:46,950 INFO  L82        PathProgramCache]: Analyzing trace with hash -1047236695, now seen corresponding path program 2 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:46,956 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:47,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:47,023 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:47,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 476 backedges. 262 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked.
[2018-04-11 22:19:47,138 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:47,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 476 backedges. 262 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked.
[2018-04-11 22:19:47,431 INFO  L320   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-04-11 22:19:47,431 INFO  L335   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 25
[2018-04-11 22:19:47,431 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-04-11 22:19:47,431 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-04-11 22:19:47,432 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600
[2018-04-11 22:19:47,432 INFO  L87              Difference]: Start difference. First operand 388 states and 401 transitions. Second operand 25 states.
[2018-04-11 22:19:47,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-04-11 22:19:47,800 INFO  L93              Difference]: Finished difference Result 559 states and 586 transitions.
[2018-04-11 22:19:47,820 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2018-04-11 22:19:47,820 INFO  L78                 Accepts]: Start accepts. Automaton has 25 states. Word has length 237
[2018-04-11 22:19:47,820 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-04-11 22:19:47,821 INFO  L225             Difference]: With dead ends: 559
[2018-04-11 22:19:47,821 INFO  L226             Difference]: Without dead ends: 392
[2018-04-11 22:19:47,822 INFO  L567         BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 440 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560
[2018-04-11 22:19:47,823 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 392 states.
[2018-04-11 22:19:47,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388.
[2018-04-11 22:19:47,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 388 states.
[2018-04-11 22:19:47,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 399 transitions.
[2018-04-11 22:19:47,869 INFO  L78                 Accepts]: Start accepts. Automaton has 388 states and 399 transitions. Word has length 237
[2018-04-11 22:19:47,869 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-04-11 22:19:47,869 INFO  L459      AbstractCegarLoop]: Abstraction has 388 states and 399 transitions.
[2018-04-11 22:19:47,869 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-04-11 22:19:47,869 INFO  L276                IsEmpty]: Start isEmpty. Operand 388 states and 399 transitions.
[2018-04-11 22:19:47,870 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 246
[2018-04-11 22:19:47,870 INFO  L347         BasicCegarLoop]: Found error trace
[2018-04-11 22:19:47,870 INFO  L355         BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-04-11 22:19:47,870 INFO  L408      AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__barErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr3RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_c__fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]===
[2018-04-11 22:19:47,871 INFO  L82        PathProgramCache]: Analyzing trace with hash -655571618, now seen corresponding path program 3 times
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-04-11 22:19:47,876 INFO  L68    tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy
[2018-04-11 22:19:47,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-04-11 22:19:47,936 INFO  L270         TraceCheckSpWp]: Computing forward predicates...
[2018-04-11 22:19:47,941 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:19:47,941 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:47,949 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-04-11 22:19:47,949 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:47,955 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars,  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:47,955 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-04-11 22:19:47,992 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-04-11 22:19:47,992 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:47,997 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-04-11 22:19:47,998 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:47,999 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:47,999 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7
[2018-04-11 22:19:48,020 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,021 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17
[2018-04-11 22:19:48,021 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,032 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,033 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,033 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:19:48,034 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,040 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:48,040 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:23
[2018-04-11 22:19:48,108 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-04-11 22:19:48,108 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,112 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-04-11 22:19:48,112 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,113 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:48,113 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7
[2018-04-11 22:19:48,131 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,140 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32
[2018-04-11 22:19:48,140 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:48,167 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,168 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,168 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:19:48,168 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,186 INFO  L267         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars,  End of recursive call: 6 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:19:48,186 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:58
[2018-04-11 22:19:48,278 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-04-11 22:19:48,278 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,282 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-04-11 22:19:48,283 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,284 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:48,284 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7
[2018-04-11 22:19:48,307 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,317 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32
[2018-04-11 22:19:48,317 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:48,343 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,344 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,344 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:19:48,344 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,362 INFO  L267         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars,  End of recursive call: 6 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:19:48,363 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:58
[2018-04-11 22:19:48,475 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-04-11 22:19:48,475 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,479 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-04-11 22:19:48,479 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,481 INFO  L267         ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 1 xjuncts.
[2018-04-11 22:19:48,481 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7
[2018-04-11 22:19:48,502 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,503 INFO  L700             Elim1Store]: detected not equals via solver
[2018-04-11 22:19:48,503 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-04-11 22:19:48,503 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:48,522 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32
[2018-04-11 22:19:48,522 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 2 xjuncts.
[2018-04-11 22:19:48,545 INFO  L267         ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars,  End of recursive call: 6 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:19:48,545 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:58
[2018-04-11 22:19:48,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked.
[2018-04-11 22:19:48,712 INFO  L314         TraceCheckSpWp]: Computing backward predicates...
[2018-04-11 22:19:48,786 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,847 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,853 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,860 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,867 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,874 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,880 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,887 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,895 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,902 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,909 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,916 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,923 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,930 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,937 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,943 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,950 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,956 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,963 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,973 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,982 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:48,995 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,002 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,008 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,015 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,021 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,028 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,034 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,040 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,047 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,053 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,060 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,066 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,073 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,079 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,086 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,092 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 27
[2018-04-11 22:19:49,102 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 64
[2018-04-11 22:19:49,216 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 64
[2018-04-11 22:19:49,264 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 64
[2018-04-11 22:19:49,311 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 64
[2018-04-11 22:19:49,422 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:49,422 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:49,422 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12
[2018-04-11 22:19:49,423 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:49,432 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:49,432 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:49,433 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19
[2018-04-11 22:19:49,433 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:49,440 INFO  L267         ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars,  End of recursive call: 2 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:19:49,440 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:28
[2018-04-11 22:19:49,529 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,532 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 15
[2018-04-11 22:19:49,626 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,633 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,728 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,735 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,744 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,752 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,760 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,768 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,777 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,784 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,793 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,800 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,809 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,817 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,827 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,835 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,844 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,851 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,860 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,868 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,877 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,884 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,893 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,900 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,909 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,916 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,925 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,933 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,942 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,949 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,958 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,965 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,974 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,982 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:49,991 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:49,998 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,007 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,014 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,023 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,031 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,039 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,047 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,056 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,063 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,073 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,087 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,096 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,103 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,112 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,119 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,128 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,136 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,144 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,152 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,161 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,168 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 36
[2018-04-11 22:19:50,178 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,197 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 80
[2018-04-11 22:19:50,422 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,441 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 80
[2018-04-11 22:19:50,559 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,585 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 80
[2018-04-11 22:19:50,703 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 9
[2018-04-11 22:19:50,722 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 80
[2018-04-11 22:19:50,952 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:50,952 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:50,953 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27
[2018-04-11 22:19:50,953 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:50,967 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:50,968 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:19:50,968 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12
[2018-04-11 22:19:50,968 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:19:50,978 INFO  L267         ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars,  End of recursive call: 4 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:19:50,978 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:58, output treesize:36
[2018-04-11 22:19:51,122 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:51,354 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:51,458 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:51,562 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:51,666 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:51,776 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:51,879 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:51,982 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:52,087 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:52,201 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:52,305 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:52,408 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:52,511 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:52,615 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:52,723 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:52,830 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:52,943 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:53,046 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:53,156 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:53,260 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:53,363 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 75
[2018-04-11 22:19:53,476 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 144
[2018-04-11 22:19:55,929 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 144
[2018-04-11 22:19:58,110 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 144
[2018-04-11 22:20:00,281 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 144
[2018-04-11 22:20:02,669 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:20:02,670 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:20:02,670 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2018-04-11 22:20:02,670 INFO  L267         ElimStorePlain]: Start of recursive call 2:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:20:02,683 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:20:02,684 INFO  L682             Elim1Store]: detected equality via solver
[2018-04-11 22:20:02,684 INFO  L477             Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12
[2018-04-11 22:20:02,684 INFO  L267         ElimStorePlain]: Start of recursive call 3:  End of recursive call:  and 1 xjuncts.
[2018-04-11 22:20:02,694 INFO  L267         ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars,  End of recursive call: 6 dim-0 vars,  and 2 xjuncts.
[2018-04-11 22:20:02,694 INFO  L202         ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:66, output treesize:44
[2018-04-11 22:20:02,885 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 66
[2018-04-11 22:20:03,302 WARN  L130   XnfTransformerHelper]: expecting exponential blowup for input size 6
[2018-04-11 22:20:03,352 WARN  L152   XnfTransformerHelper]: Simplifying disjunction of 37044 conjuctions. This might take some time...
[2018-04-11 22:21:48,108 INFO  L170   XnfTransformerHelper]: Simplified to disjunction of 37044 conjuctions. 
Received shutdown request...
[2018-04-11 22:21:49,616 INFO  L175         TraceCheckSpWp]: Timeout while computing interpolants
[2018-04-11 22:21:49,616 WARN  L519      AbstractCegarLoop]: Verification canceled
[2018-04-11 22:21:49,620 WARN  L197   ceAbstractionStarter]: Timeout
[2018-04-11 22:21:49,620 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:21:49 BoogieIcfgContainer
[2018-04-11 22:21:49,620 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-04-11 22:21:49,621 INFO  L168              Benchmark]: Toolchain (without parser) took 260865.41 ms. Allocated memory was 300.4 MB in the beginning and 543.7 MB in the end (delta: 243.3 MB). Free memory was 243.7 MB in the beginning and 381.2 MB in the end (delta: -137.4 MB). Peak memory consumption was 619.9 MB. Max. memory is 5.3 GB.
[2018-04-11 22:21:49,622 INFO  L168              Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 300.4 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-04-11 22:21:49,622 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 219.82 ms. Allocated memory is still 300.4 MB. Free memory was 243.7 MB in the beginning and 233.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB.
[2018-04-11 22:21:49,622 INFO  L168              Benchmark]: Boogie Preprocessor took 31.47 ms. Allocated memory is still 300.4 MB. Free memory was 233.6 MB in the beginning and 231.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-04-11 22:21:49,622 INFO  L168              Benchmark]: RCFGBuilder took 433.48 ms. Allocated memory was 300.4 MB in the beginning and 457.7 MB in the end (delta: 157.3 MB). Free memory was 231.6 MB in the beginning and 419.0 MB in the end (delta: -187.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB.
[2018-04-11 22:21:49,623 INFO  L168              Benchmark]: TraceAbstraction took 260175.77 ms. Allocated memory was 457.7 MB in the beginning and 543.7 MB in the end (delta: 86.0 MB). Free memory was 419.0 MB in the beginning and 381.2 MB in the end (delta: 37.8 MB). Peak memory consumption was 637.9 MB. Max. memory is 5.3 GB.
[2018-04-11 22:21:49,624 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.20 ms. Allocated memory is still 300.4 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB.
 * CACSL2BoogieTranslator took 219.82 ms. Allocated memory is still 300.4 MB. Free memory was 243.7 MB in the beginning and 233.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB.
 * Boogie Preprocessor took 31.47 ms. Allocated memory is still 300.4 MB. Free memory was 233.6 MB in the beginning and 231.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
 * RCFGBuilder took 433.48 ms. Allocated memory was 300.4 MB in the beginning and 457.7 MB in the end (delta: 157.3 MB). Free memory was 231.6 MB in the beginning and 419.0 MB in the end (delta: -187.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB.
 * TraceAbstraction took 260175.77 ms. Allocated memory was 457.7 MB in the beginning and 543.7 MB in the end (delta: 86.0 MB). Free memory was 419.0 MB in the beginning and 381.2 MB in the end (delta: 37.8 MB). Peak memory consumption was 637.9 MB. Max. memory is 5.3 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 14). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 14]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 14). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 23). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 23). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 23). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 23). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 37). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 34). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 37). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction)
    Unable to prove that all allocated memory was freed (line 31). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction)
    Unable to prove that pointer dereference always succeeds (line 34). Cancelled  while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 1 quantifier alternations, while XnfDer was eliminating 57 quantified variables from 14 xjuncts.
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 89 locations, 11 error locations. TIMEOUT Result, 260.1s OverallTime, 35 OverallIterations, 10 TraceHistogramMax, 78.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2836 SDtfs, 5321 SDslu, 22206 SDs, 0 SdLazy, 13630 SolverSat, 776 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 24.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7864 GetRequests, 6847 SyntacticMatches, 131 SemanticMatches, 886 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 7756 ImplicationChecksByTransitivity, 100.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=33, 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: 1.0s AutomataMinimizationTime, 34 MinimizatonAttempts, 593 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 56.8s InterpolantComputationTime, 3728 NumberOfCodeBlocks, 3728 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 7388 ConstructedInterpolants, 557 QuantifiedInterpolants, 4303496 SizeOfPredicates, 291 NumberOfNonLiveVariables, 9494 ConjunctsInSsa, 512 ConjunctsInUnsatCore, 68 InterpolantComputations, 24 PerfectInterpolantSequences, 7648/8290 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_22-21-49-630.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_22-21-49-630.csv
Completed graceful shutdown