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-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4cf2d92 [2018-03-28 13:21:52,185 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-28 13:21:52,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-28 13:21:52,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-28 13:21:52,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-28 13:21:52,199 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-28 13:21:52,200 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-28 13:21:52,202 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-28 13:21:52,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-28 13:21:52,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-28 13:21:52,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-28 13:21:52,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-28 13:21:52,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-28 13:21:52,208 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-28 13:21:52,209 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-28 13:21:52,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-28 13:21:52,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-28 13:21:52,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-28 13:21:52,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-28 13:21:52,217 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-28 13:21:52,219 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-28 13:21:52,219 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-28 13:21:52,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-28 13:21:52,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-28 13:21:52,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-28 13:21:52,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-28 13:21:52,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-28 13:21:52,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-28 13:21:52,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-28 13:21:52,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-28 13:21:52,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-28 13:21:52,225 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-03-28 13:21:52,248 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-28 13:21:52,248 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-28 13:21:52,248 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-28 13:21:52,248 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-28 13:21:52,248 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-28 13:21:52,249 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-28 13:21:52,249 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-28 13:21:52,249 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-28 13:21:52,249 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-28 13:21:52,249 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-28 13:21:52,249 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-28 13:21:52,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-28 13:21:52,250 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-28 13:21:52,250 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-28 13:21:52,250 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-28 13:21:52,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-28 13:21:52,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-28 13:21:52,250 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-28 13:21:52,250 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-28 13:21:52,251 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-28 13:21:52,251 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-28 13:21:52,251 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-28 13:21:52,251 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-28 13:21:52,251 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-28 13:21:52,251 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-28 13:21:52,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-28 13:21:52,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-28 13:21:52,252 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-28 13:21:52,252 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-28 13:21:52,252 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-28 13:21:52,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-28 13:21:52,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:21:52,253 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-28 13:21:52,253 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-28 13:21:52,253 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-28 13:21:52,254 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-28 13:21:52,254 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-28 13:21:52,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-28 13:21:52,294 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-28 13:21:52,296 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-28 13:21:52,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-28 13:21:52,298 INFO L276 PluginConnector]: CDTParser initialized [2018-03-28 13:21:52,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-28 13:21:52,625 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb96e6a2bb [2018-03-28 13:21:52,759 INFO L291 CDTParser]: IsIndexed: true [2018-03-28 13:21:52,759 INFO L292 CDTParser]: Found 1 translation units. [2018-03-28 13:21:52,760 INFO L171 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-28 13:21:52,761 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-28 13:21:52,761 INFO L215 ultiparseSymbolTable]: [2018-03-28 13:21:52,761 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-28 13:21:52,761 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-28 13:21:52,762 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-28 13:21:52,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-28 13:21:52,762 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-28 13:21:52,779 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb96e6a2bb [2018-03-28 13:21:52,783 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-28 13:21:52,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-28 13:21:52,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-28 13:21:52,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-28 13:21:52,793 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-28 13:21:52,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 01:21:52" (1/1) ... [2018-03-28 13:21:52,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1f4dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:52, skipping insertion in model container [2018-03-28 13:21:52,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 01:21:52" (1/1) ... [2018-03-28 13:21:52,811 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 13:21:52,824 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 13:21:52,953 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 13:21:52,986 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 13:21:52,993 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-03-28 13:21:53,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53 WrapperNode [2018-03-28 13:21:53,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-28 13:21:53,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-28 13:21:53,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-28 13:21:53,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-28 13:21:53,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53" (1/1) ... [2018-03-28 13:21:53,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53" (1/1) ... [2018-03-28 13:21:53,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53" (1/1) ... [2018-03-28 13:21:53,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53" (1/1) ... [2018-03-28 13:21:53,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53" (1/1) ... [2018-03-28 13:21:53,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53" (1/1) ... [2018-03-28 13:21:53,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53" (1/1) ... [2018-03-28 13:21:53,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-28 13:21:53,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-28 13:21:53,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-28 13:21:53,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-28 13:21:53,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53" (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-03-28 13:21:53,115 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-28 13:21:53,115 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-28 13:21:53,116 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-28 13:21:53,116 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-03-28 13:21:53,116 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-03-28 13:21:53,116 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-28 13:21:53,116 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-28 13:21:53,116 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-28 13:21:53,117 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-28 13:21:53,117 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-03-28 13:21:53,117 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-28 13:21:53,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-28 13:21:53,117 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-28 13:21:53,117 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-28 13:21:53,118 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-28 13:21:53,118 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-28 13:21:53,574 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-03-28 13:21:53,589 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-28 13:21:53,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 01:21:53 BoogieIcfgContainer [2018-03-28 13:21:53,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-28 13:21:53,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-28 13:21:53,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-28 13:21:53,593 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-28 13:21:53,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 01:21:52" (1/3) ... [2018-03-28 13:21:53,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bb779d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 01:21:53, skipping insertion in model container [2018-03-28 13:21:53,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:21:53" (2/3) ... [2018-03-28 13:21:53,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53bb779d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 01:21:53, skipping insertion in model container [2018-03-28 13:21:53,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 01:21:53" (3/3) ... [2018-03-28 13:21:53,595 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-28 13:21:53,602 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-28 13:21:53,609 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-03-28 13:21:53,658 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-28 13:21:53,659 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-28 13:21:53,659 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-28 13:21:53,659 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-28 13:21:53,659 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-28 13:21:53,659 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-28 13:21:53,659 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-28 13:21:53,659 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-28 13:21:53,660 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-28 13:21:53,660 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-28 13:21:53,675 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-03-28 13:21:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-28 13:21:53,679 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:53,680 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:21:53,680 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 13:21:53,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970878, 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-03-28 13:21:53,695 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:53,745 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:53,797 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-03-28 13:21:53,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:53,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:53,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 13:21:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:53,827 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:21:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:53,882 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:21:53,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 13:21:53,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 13:21:53,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 13:21:53,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 13:21:53,899 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-03-28 13:21:54,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:21:54,216 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-03-28 13:21:54,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 13:21:54,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-03-28 13:21:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:21:54,235 INFO L225 Difference]: With dead ends: 268 [2018-03-28 13:21:54,235 INFO L226 Difference]: Without dead ends: 243 [2018-03-28 13:21:54,239 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-28 13:21:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-03-28 13:21:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-03-28 13:21:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-03-28 13:21:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-03-28 13:21:54,292 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-03-28 13:21:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:21:54,293 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-03-28 13:21:54,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 13:21:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-03-28 13:21:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-28 13:21:54,294 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:54,295 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:21:54,295 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 13:21:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970879, 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-03-28 13:21:54,304 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:54,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:54,331 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-03-28 13:21:54,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:54,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:54,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 13:21:54,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-03-28 13:21:54,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:54,356 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-03-28 13:21:54,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-28 13:21:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:54,365 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:21:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:54,432 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:21:54,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-28 13:21:54,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-28 13:21:54,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-28 13:21:54,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 13:21:54,435 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-03-28 13:21:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:21:54,577 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-03-28 13:21:54,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 13:21:54,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-03-28 13:21:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:21:54,579 INFO L225 Difference]: With dead ends: 233 [2018-03-28 13:21:54,580 INFO L226 Difference]: Without dead ends: 232 [2018-03-28 13:21:54,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 13:21:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-03-28 13:21:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-03-28 13:21:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-03-28 13:21:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-03-28 13:21:54,593 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-03-28 13:21:54,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:21:54,593 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-03-28 13:21:54,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-28 13:21:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-03-28 13:21:54,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-28 13:21:54,594 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:54,594 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:21:54,594 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 13:21:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970880, 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-03-28 13:21:54,603 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:54,625 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:54,643 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-03-28 13:21:54,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:54,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:54,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 13:21:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:54,677 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:21:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:54,749 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:21:54,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 13:21:54,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 13:21:54,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 13:21:54,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-28 13:21:54,750 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-03-28 13:21:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:21:54,868 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-03-28 13:21:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-28 13:21:54,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-03-28 13:21:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:21:54,869 INFO L225 Difference]: With dead ends: 148 [2018-03-28 13:21:54,869 INFO L226 Difference]: Without dead ends: 126 [2018-03-28 13:21:54,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-28 13:21:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-03-28 13:21:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-03-28 13:21:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-03-28 13:21:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-03-28 13:21:54,879 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-03-28 13:21:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:21:54,880 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-03-28 13:21:54,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 13:21:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-03-28 13:21:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-28 13:21:54,880 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:54,880 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:21:54,881 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 13:21:54,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970881, 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-03-28 13:21:54,887 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:54,903 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:54,912 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-03-28 13:21:54,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:54,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:54,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 13:21:54,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 11 [2018-03-28 13:21:54,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:54,965 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-03-28 13:21:54,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-03-28 13:21:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:54,971 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:21:55,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-03-28 13:21:55,337 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:21:55,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-03-28 13:21:55,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-28 13:21:55,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-28 13:21:55,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-03-28 13:21:55,338 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-03-28 13:21:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:21:55,413 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-03-28 13:21:55,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 13:21:55,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-03-28 13:21:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:21:55,415 INFO L225 Difference]: With dead ends: 126 [2018-03-28 13:21:55,415 INFO L226 Difference]: Without dead ends: 125 [2018-03-28 13:21:55,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-03-28 13:21:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-03-28 13:21:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-03-28 13:21:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-03-28 13:21:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-03-28 13:21:55,425 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-03-28 13:21:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:21:55,426 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-03-28 13:21:55,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-28 13:21:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-03-28 13:21:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-28 13:21:55,427 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:55,427 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] [2018-03-28 13:21:55,427 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 13:21:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2009038742, 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-03-28 13:21:55,440 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:55,474 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:55,487 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:21:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:55,541 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:21:55,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-28 13:21:55,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 13:21:55,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 13:21:55,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-28 13:21:55,542 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-03-28 13:21:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:21:55,586 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-03-28 13:21:55,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 13:21:55,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-03-28 13:21:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:21:55,588 INFO L225 Difference]: With dead ends: 230 [2018-03-28 13:21:55,588 INFO L226 Difference]: Without dead ends: 129 [2018-03-28 13:21:55,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-03-28 13:21:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-03-28 13:21:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-03-28 13:21:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-03-28 13:21:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-03-28 13:21:55,597 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-03-28 13:21:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:21:55,598 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-03-28 13:21:55,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 13:21:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-03-28 13:21:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-28 13:21:55,599 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:55,599 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:21:55,600 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 13:21:55,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1651014666, 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-03-28 13:21:55,611 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:55,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:55,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:55,665 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:21:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:55,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 13:21:55,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-28 13:21:55,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-28 13:21:55,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-28 13:21:55,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-03-28 13:21:55,769 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-03-28 13:21:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:21:55,835 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-03-28 13:21:55,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-28 13:21:55,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-03-28 13:21:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:21:55,837 INFO L225 Difference]: With dead ends: 242 [2018-03-28 13:21:55,837 INFO L226 Difference]: Without dead ends: 141 [2018-03-28 13:21:55,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-03-28 13:21:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-03-28 13:21:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-03-28 13:21:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-03-28 13:21:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-03-28 13:21:55,846 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-03-28 13:21:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:21:55,846 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-03-28 13:21:55,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-28 13:21:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-03-28 13:21:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-28 13:21:55,848 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:55,848 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:21:55,848 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 13:21:55,848 INFO L82 PathProgramCache]: Analyzing trace with hash 264713398, now seen corresponding path program 2 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-03-28 13:21:55,855 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:55,881 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:55,923 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:21:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:21:56,071 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 13:21:56,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-03-28 13:21:56,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-28 13:21:56,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-28 13:21:56,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-03-28 13:21:56,072 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-03-28 13:21:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:21:56,143 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-03-28 13:21:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-28 13:21:56,144 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-03-28 13:21:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:21:56,146 INFO L225 Difference]: With dead ends: 254 [2018-03-28 13:21:56,146 INFO L226 Difference]: Without dead ends: 153 [2018-03-28 13:21:56,147 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=197, Unknown=0, NotChecked=0, Total=342 [2018-03-28 13:21:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-03-28 13:21:56,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-03-28 13:21:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-03-28 13:21:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-03-28 13:21:56,156 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-03-28 13:21:56,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:21:56,157 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-03-28 13:21:56,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-28 13:21:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-03-28 13:21:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-03-28 13:21:56,159 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:21:56,159 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:21:56,159 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-28 13:21:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1439447690, now seen corresponding path program 3 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-03-28 13:21:56,174 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:21:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:21:56,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:21:56,228 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-03-28 13:21:56,230 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-03-28 13:21:56,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-03-28 13:21:56,245 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 21 treesize of output 16 [2018-03-28 13:21:56,247 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,248 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-03-28 13:21:56,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-03-28 13:21:56,268 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 30 treesize of output 23 [2018-03-28 13:21:56,271 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,272 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,273 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,273 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 60 [2018-03-28 13:21:56,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-03-28 13:21:56,300 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 39 treesize of output 30 [2018-03-28 13:21:56,303 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,304 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,304 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,305 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,305 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,306 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,307 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 93 [2018-03-28 13:21:56,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-03-28 13:21:56,345 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 48 treesize of output 37 [2018-03-28 13:21:56,348 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,349 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,350 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,350 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,351 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,352 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,352 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,353 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,354 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,355 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,355 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 132 [2018-03-28 13:21:56,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-03-28 13:21:56,399 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 57 treesize of output 44 [2018-03-28 13:21:56,407 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,408 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,409 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,409 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,410 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,411 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,411 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,412 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,413 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,413 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,414 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,415 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,415 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,416 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,417 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,417 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 179 [2018-03-28 13:21:56,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-03-28 13:21:56,537 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 66 treesize of output 51 [2018-03-28 13:21:56,542 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,542 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,543 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,544 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,545 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,545 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,546 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,549 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,550 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,550 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,551 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,552 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,552 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,553 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,554 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,555 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,556 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,556 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,561 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,562 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,571 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,576 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 234 [2018-03-28 13:21:56,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-03-28 13:21:56,770 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 62 treesize of output 48 [2018-03-28 13:21:56,775 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,776 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,777 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,777 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,778 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,779 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,779 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,780 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,781 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,781 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,782 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,783 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,783 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,784 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,784 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,785 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,786 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,786 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,787 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,788 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,788 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,789 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:21:56,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 164 [2018-03-28 13:21:56,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:21:56,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-03-28 13:22:12,158 WARN L148 SmtUtils]: Spent 330ms on a formula simplification that was a NOOP. DAG size: 88 [2018-03-28 13:23:23,090 WARN L151 SmtUtils]: Spent 70836ms on a formula simplification. DAG size of input: 3677 DAG size of output 64 [2018-03-28 13:23:23,265 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 146 treesize of output 126 [2018-03-28 13:23:23,272 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 149 [2018-03-28 13:23:23,281 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,289 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 114 [2018-03-28 13:23:23,304 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,309 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,310 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:23,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 139 [2018-03-28 13:23:23,327 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,332 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,337 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,344 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,344 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:23,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 172 [2018-03-28 13:23:23,356 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,359 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,364 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,368 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,373 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,376 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,380 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,381 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:23,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 215 [2018-03-28 13:23:23,413 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,417 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,424 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,427 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,432 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,437 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,441 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,444 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,450 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,454 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,458 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,459 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:23,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 266 [2018-03-28 13:23:23,474 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,478 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,481 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,483 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,486 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,490 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,493 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,497 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,502 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,504 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,509 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,511 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,514 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,516 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,519 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,524 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,525 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:23,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 325 [2018-03-28 13:23:23,542 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,545 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,548 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,551 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,554 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,557 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,560 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,564 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,567 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,572 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,574 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,577 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,579 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,596 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,599 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,602 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,604 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,607 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,610 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,614 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,616 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,619 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,652 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-03-28 13:23:23,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 381 [2018-03-28 13:23:23,664 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,665 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,667 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,668 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,670 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,671 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,673 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,674 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,676 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,677 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,679 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,680 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,682 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,683 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,685 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,686 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,688 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,689 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,691 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,692 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,694 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,695 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,696 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,698 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,700 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,701 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,703 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,704 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,707 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,708 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 445 [2018-03-28 13:23:23,774 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,777 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,785 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,786 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,788 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,789 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,790 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,792 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,793 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,794 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,795 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,797 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,798 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,799 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,800 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,801 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,802 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,803 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,804 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,806 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,806 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,808 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,809 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,810 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,811 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,812 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,813 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,814 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,815 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,816 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,818 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,819 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,820 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,821 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,822 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,823 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,825 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,826 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,828 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:23,867 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-03-28 13:23:23,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 544 [2018-03-28 13:23:23,870 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,004 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,066 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,144 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,181 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,212 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,256 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,305 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:24,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-28 13:23:24,518 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:10815, output treesize:197 [2018-03-28 13:23:24,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 137 [2018-03-28 13:23:24,698 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,699 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,700 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,701 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,702 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,702 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,703 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,704 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,705 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,706 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,706 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,707 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,708 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,708 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,709 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,710 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,710 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,711 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,712 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,713 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,713 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,714 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,715 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,715 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,716 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,716 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,717 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,718 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,719 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,720 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,721 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,722 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,723 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,724 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,724 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,725 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,726 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,726 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,727 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,728 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,728 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,729 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,730 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,731 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,731 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,732 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,733 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,734 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,734 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,735 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,736 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,737 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,737 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,738 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,739 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,739 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,740 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,740 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,741 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,742 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,742 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,743 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,744 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,744 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,745 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,746 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,747 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,747 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,748 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,749 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,749 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,750 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,750 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,751 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,751 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,752 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:23:24,753 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:23:24,831 INFO L303 Elim1Store]: Index analysis took 147 ms [2018-03-28 13:23:24,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 20 select indices, 20 select index equivalence classes, 53 disjoint index pairs (out of 190 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 566 [2018-03-28 13:23:24,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:23:25,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:25,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:23:25,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:7 [2018-03-28 13:23:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 142 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:23:25,201 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:23:28,324 WARN L148 SmtUtils]: Spent 2721ms on a formula simplification that was a NOOP. DAG size: 128 [2018-03-28 13:23:28,676 WARN L148 SmtUtils]: Spent 349ms on a formula simplification that was a NOOP. DAG size: 84 [2018-03-28 13:23:29,073 WARN L148 SmtUtils]: Spent 396ms on a formula simplification that was a NOOP. DAG size: 96 [2018-03-28 13:23:29,278 WARN L148 SmtUtils]: Spent 204ms on a formula simplification that was a NOOP. DAG size: 94 [2018-03-28 13:24:09,919 WARN L148 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 118 [2018-03-28 13:24:30,324 WARN L148 SmtUtils]: Spent 175ms on a formula simplification that was a NOOP. DAG size: 121 Received shutdown request... [2018-03-28 13:24:39,630 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-28 13:24:39,631 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-28 13:24:39,636 WARN L197 ceAbstractionStarter]: Timeout [2018-03-28 13:24:39,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 01:24:39 BoogieIcfgContainer [2018-03-28 13:24:39,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-28 13:24:39,638 INFO L168 Benchmark]: Toolchain (without parser) took 166853.68 ms. Allocated memory was 304.1 MB in the beginning and 519.6 MB in the end (delta: 215.5 MB). Free memory was 247.7 MB in the beginning and 298.2 MB in the end (delta: -50.5 MB). Peak memory consumption was 165.0 MB. Max. memory is 5.3 GB. [2018-03-28 13:24:39,639 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-28 13:24:39,639 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.97 ms. Allocated memory is still 304.1 MB. Free memory was 246.7 MB in the beginning and 236.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-03-28 13:24:39,639 INFO L168 Benchmark]: Boogie Preprocessor took 43.11 ms. Allocated memory is still 304.1 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-28 13:24:39,639 INFO L168 Benchmark]: RCFGBuilder took 537.09 ms. Allocated memory was 304.1 MB in the beginning and 465.0 MB in the end (delta: 161.0 MB). Free memory was 234.6 MB in the beginning and 417.6 MB in the end (delta: -183.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-03-28 13:24:39,640 INFO L168 Benchmark]: TraceAbstraction took 166046.63 ms. Allocated memory was 465.0 MB in the beginning and 519.6 MB in the end (delta: 54.5 MB). Free memory was 417.3 MB in the beginning and 298.2 MB in the end (delta: 119.1 MB). Peak memory consumption was 173.6 MB. Max. memory is 5.3 GB. [2018-03-28 13:24:39,642 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.18 ms. Allocated memory is still 304.1 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 220.97 ms. Allocated memory is still 304.1 MB. Free memory was 246.7 MB in the beginning and 236.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.11 ms. Allocated memory is still 304.1 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 537.09 ms. Allocated memory was 304.1 MB in the beginning and 465.0 MB in the end (delta: 161.0 MB). Free memory was 234.6 MB in the beginning and 417.6 MB in the end (delta: -183.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 166046.63 ms. Allocated memory was 465.0 MB in the beginning and 519.6 MB in the end (delta: 54.5 MB). Free memory was 417.3 MB in the beginning and 298.2 MB in the end (delta: 119.1 MB). Peak memory consumption was 173.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 165.9s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 788 SDtfs, 750 SDslu, 1125 SDs, 0 SdLazy, 376 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 382 ConstructedInterpolants, 12 QuantifiedInterpolants, 34110 SizeOfPredicates, 12 NumberOfNonLiveVariables, 623 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/112 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/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-28_13-24-39-656.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-28_13-24-39-656.csv Completed graceful shutdown