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-835382a-m [2018-04-05 18:05:29,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 18:05:29,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 18:05:29,326 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 18:05:29,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 18:05:29,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 18:05:29,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 18:05:29,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 18:05:29,336 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 18:05:29,337 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 18:05:29,338 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 18:05:29,338 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 18:05:29,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 18:05:29,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 18:05:29,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 18:05:29,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 18:05:29,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 18:05:29,351 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 18:05:29,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 18:05:29,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 18:05:29,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 18:05:29,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 18:05:29,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 18:05:29,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 18:05:29,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 18:05:29,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 18:05:29,361 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 18:05:29,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 18:05:29,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 18:05:29,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 18:05:29,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 18:05:29,365 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-05 18:05:29,403 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 18:05:29,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 18:05:29,404 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 18:05:29,404 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 18:05:29,404 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 18:05:29,408 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 18:05:29,408 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 18:05:29,408 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 18:05:29,408 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 18:05:29,409 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 18:05:29,409 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 18:05:29,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 18:05:29,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 18:05:29,410 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 18:05:29,410 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 18:05:29,410 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 18:05:29,410 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 18:05:29,410 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 18:05:29,411 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 18:05:29,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 18:05:29,412 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 18:05:29,412 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 18:05:29,412 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 18:05:29,412 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 18:05:29,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 18:05:29,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 18:05:29,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 18:05:29,413 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 18:05:29,413 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 18:05:29,413 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 18:05:29,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 18:05:29,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:05:29,414 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 18:05:29,416 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 18:05:29,416 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 18:05:29,417 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 18:05:29,417 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 18:05:29,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 18:05:29,490 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 18:05:29,496 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 18:05:29,498 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 18:05:29,498 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 18:05:29,502 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-04-05 18:05:29,856 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf37345e58 [2018-04-05 18:05:29,993 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 18:05:29,993 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 18:05:29,994 INFO L168 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-05 18:05:29,996 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 18:05:29,996 INFO L215 ultiparseSymbolTable]: [2018-04-05 18:05:29,997 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 18:05:29,997 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-05 18:05:29,997 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 18:05:29,997 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-04-05 18:05:29,997 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-04-05 18:05:30,017 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf37345e58 [2018-04-05 18:05:30,022 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 18:05:30,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 18:05:30,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 18:05:30,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 18:05:30,037 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 18:05:30,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:05:30" (1/1) ... [2018-04-05 18:05:30,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b87014a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30, skipping insertion in model container [2018-04-05 18:05:30,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:05:30" (1/1) ... [2018-04-05 18:05:30,065 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 18:05:30,082 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 18:05:30,287 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 18:05:30,323 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 18:05:30,330 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-05 18:05:30,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30 WrapperNode [2018-04-05 18:05:30,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 18:05:30,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 18:05:30,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 18:05:30,347 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 18:05:30,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30" (1/1) ... [2018-04-05 18:05:30,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30" (1/1) ... [2018-04-05 18:05:30,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30" (1/1) ... [2018-04-05 18:05:30,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30" (1/1) ... [2018-04-05 18:05:30,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30" (1/1) ... [2018-04-05 18:05:30,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30" (1/1) ... [2018-04-05 18:05:30,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30" (1/1) ... [2018-04-05 18:05:30,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 18:05:30,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 18:05:30,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 18:05:30,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 18:05:30,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 18:05:30,464 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 18:05:30,465 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 18:05:30,465 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 18:05:30,465 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-05 18:05:30,465 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-05 18:05:30,465 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 18:05:30,465 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 18:05:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 18:05:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 18:05:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-05 18:05:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 18:05:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 18:05:30,466 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 18:05:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 18:05:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 18:05:30,467 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 18:05:31,028 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-05 18:05:31,043 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 18:05:31,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:05:31 BoogieIcfgContainer [2018-04-05 18:05:31,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 18:05:31,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 18:05:31,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 18:05:31,048 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 18:05:31,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:05:30" (1/3) ... [2018-04-05 18:05:31,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcd027f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:05:31, skipping insertion in model container [2018-04-05 18:05:31,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:05:30" (2/3) ... [2018-04-05 18:05:31,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dcd027f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:05:31, skipping insertion in model container [2018-04-05 18:05:31,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:05:31" (3/3) ... [2018-04-05 18:05:31,052 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-05 18:05:31,063 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 18:05:31,070 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-05 18:05:31,126 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 18:05:31,127 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 18:05:31,127 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 18:05:31,127 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 18:05:31,127 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 18:05:31,128 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 18:05:31,128 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 18:05:31,128 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 18:05:31,128 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 18:05:31,129 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 18:05:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-04-05 18:05:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-05 18:05:31,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:05:31,154 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:05:31,154 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-04-05 18:05:31,159 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-04-05 18:05:31,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:05:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:05:31,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:05:31,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:05:31,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:31,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:31,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 18:05:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:31,287 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:05:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:31,371 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:05:31,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 18:05:31,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 18:05:31,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 18:05:31,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 18:05:31,392 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-04-05 18:05:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:05:31,924 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-04-05 18:05:31,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 18:05:31,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-05 18:05:31,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:05:31,946 INFO L225 Difference]: With dead ends: 268 [2018-04-05 18:05:31,946 INFO L226 Difference]: Without dead ends: 243 [2018-04-05 18:05:31,950 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-04-05 18:05:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-05 18:05:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-04-05 18:05:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-05 18:05:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-04-05 18:05:32,002 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-04-05 18:05:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:05:32,003 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-04-05 18:05:32,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 18:05:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-04-05 18:05:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-05 18:05:32,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:05:32,006 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:05:32,007 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-04-05 18:05:32,007 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-04-05 18:05:32,021 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:05:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:05:32,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:05:32,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:05:32,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:32,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:32,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 18:05:32,113 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-04-05 18:05:32,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:32,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 18:05:32,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-05 18:05:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:32,213 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:05:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:32,257 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:05:32,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 18:05:32,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 18:05:32,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 18:05:32,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 18:05:32,259 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-04-05 18:05:32,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:05:32,511 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-04-05 18:05:32,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 18:05:32,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-04-05 18:05:32,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:05:32,515 INFO L225 Difference]: With dead ends: 233 [2018-04-05 18:05:32,516 INFO L226 Difference]: Without dead ends: 232 [2018-04-05 18:05:32,517 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-04-05 18:05:32,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-05 18:05:32,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-04-05 18:05:32,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-05 18:05:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-04-05 18:05:32,531 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-04-05 18:05:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:05:32,531 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-04-05 18:05:32,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 18:05:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-04-05 18:05:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-05 18:05:32,532 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:05:32,532 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:05:32,532 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-04-05 18:05:32,533 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-04-05 18:05:32,539 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:05:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:05:32,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:05:32,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:05:32,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:32,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:32,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 18:05:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:32,646 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:05:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:32,714 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:05:32,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-05 18:05:32,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 18:05:32,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 18:05:32,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-05 18:05:32,716 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-04-05 18:05:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:05:32,879 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-04-05 18:05:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 18:05:32,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-05 18:05:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:05:32,881 INFO L225 Difference]: With dead ends: 148 [2018-04-05 18:05:32,881 INFO L226 Difference]: Without dead ends: 126 [2018-04-05 18:05:32,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 18:05:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-05 18:05:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-05 18:05:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-05 18:05:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-04-05 18:05:32,889 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-04-05 18:05:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:05:32,890 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-04-05 18:05:32,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 18:05:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-04-05 18:05:32,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-05 18:05:32,890 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:05:32,890 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:05:32,890 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-04-05 18:05:32,890 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-04-05 18:05:32,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:05:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:05:32,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:05:32,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:05:32,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:32,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:32,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 18:05:33,004 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-04-05 18:05:33,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:33,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 18:05:33,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-05 18:05:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:33,016 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:05:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:33,400 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:05:33,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-05 18:05:33,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-05 18:05:33,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-05 18:05:33,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-05 18:05:33,401 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-04-05 18:05:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:05:33,455 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-04-05 18:05:33,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 18:05:33,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-05 18:05:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:05:33,457 INFO L225 Difference]: With dead ends: 126 [2018-04-05 18:05:33,457 INFO L226 Difference]: Without dead ends: 125 [2018-04-05 18:05:33,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-05 18:05:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-05 18:05:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-05 18:05:33,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-05 18:05:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-04-05 18:05:33,468 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-04-05 18:05:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:05:33,469 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-04-05 18:05:33,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-05 18:05:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-04-05 18:05:33,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-05 18:05:33,473 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:05:33,473 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-04-05 18:05:33,473 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-04-05 18:05:33,473 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-04-05 18:05:33,480 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:05:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:05:33,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:05:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:33,534 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:05:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:33,610 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:05:33,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-05 18:05:33,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 18:05:33,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 18:05:33,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-05 18:05:33,612 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-04-05 18:05:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:05:33,687 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-04-05 18:05:33,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 18:05:33,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-05 18:05:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:05:33,689 INFO L225 Difference]: With dead ends: 230 [2018-04-05 18:05:33,689 INFO L226 Difference]: Without dead ends: 129 [2018-04-05 18:05:33,690 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-04-05 18:05:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-05 18:05:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-04-05 18:05:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-05 18:05:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-04-05 18:05:33,707 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-04-05 18:05:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:05:33,707 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-04-05 18:05:33,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 18:05:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-04-05 18:05:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-05 18:05:33,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:05:33,709 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-04-05 18:05:33,709 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-04-05 18:05:33,709 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-04-05 18:05:33,721 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:05:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:05:33,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:05:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:33,835 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:05:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:33,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 18:05:33,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-05 18:05:33,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-05 18:05:33,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-05 18:05:33,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-05 18:05:33,941 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-04-05 18:05:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:05:34,152 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-05 18:05:34,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-05 18:05:34,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-04-05 18:05:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:05:34,153 INFO L225 Difference]: With dead ends: 242 [2018-04-05 18:05:34,154 INFO L226 Difference]: Without dead ends: 141 [2018-04-05 18:05:34,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-04-05 18:05:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-05 18:05:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-04-05 18:05:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-05 18:05:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-04-05 18:05:34,163 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-04-05 18:05:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:05:34,164 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-04-05 18:05:34,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-05 18:05:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-04-05 18:05:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-05 18:05:34,165 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:05:34,165 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-04-05 18:05:34,165 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-04-05 18:05:34,165 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-04-05 18:05:34,171 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:05:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:05:34,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:05:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:34,254 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:05:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:05:34,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 18:05:34,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-05 18:05:34,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-05 18:05:34,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-05 18:05:34,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-04-05 18:05:34,448 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-04-05 18:05:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:05:34,511 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-04-05 18:05:34,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-05 18:05:34,515 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-05 18:05:34,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:05:34,517 INFO L225 Difference]: With dead ends: 254 [2018-04-05 18:05:34,517 INFO L226 Difference]: Without dead ends: 153 [2018-04-05 18:05:34,518 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-04-05 18:05:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-05 18:05:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-05 18:05:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-05 18:05:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-04-05 18:05:34,530 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-04-05 18:05:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:05:34,531 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-04-05 18:05:34,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-05 18:05:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-04-05 18:05:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-05 18:05:34,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:05:34,533 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-04-05 18:05:34,533 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-04-05 18:05:34,533 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-04-05 18:05:34,547 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:05:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:05:34,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:05:34,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-05 18:05:34,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-05 18:05:34,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-05 18:05:34,645 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-04-05 18:05:34,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,649 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-04-05 18:05:34,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-05 18:05:34,672 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-04-05 18:05:34,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,677 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-04-05 18:05:34,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-05 18:05:34,705 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-04-05 18:05:34,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,712 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-04-05 18:05:34,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-05 18:05:34,753 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-04-05 18:05:34,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,770 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-04-05 18:05:34,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:34,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-05 18:05:34,823 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-04-05 18:05:34,832 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:34,849 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-04-05 18:05:34,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:35,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:35,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:35,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-05 18:05:35,236 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-04-05 18:05:35,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,258 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-04-05 18:05:35,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:35,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:35,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:35,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-05 18:05:35,485 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-04-05 18:05:35,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:05:35,516 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-04-05 18:05:35,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:05:35,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:35,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:05:35,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-05 18:05:38,216 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-05 18:05:40,520 WARN L148 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-05 18:05:41,900 WARN L148 SmtUtils]: Spent 266ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-05 18:07:01,817 WARN L151 SmtUtils]: Spent 79802ms on a formula simplification. DAG size of input: 3677 DAG size of output 64 [2018-04-05 18:07:02,009 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-04-05 18:07:02,019 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-04-05 18:07:02,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,038 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-04-05 18:07:02,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,053 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:02,054 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-04-05 18:07:02,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,078 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:02,080 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-04-05 18:07:02,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,104 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,124 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:02,125 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-04-05 18:07:02,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,191 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:02,192 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-04-05 18:07:02,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,288 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:02,289 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-04-05 18:07:02,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,474 INFO L303 Elim1Store]: Index analysis took 177 ms [2018-04-05 18:07:02,476 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-04-05 18:07:02,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,574 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-04-05 18:07:02,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:02,699 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-04-05 18:07:02,701 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-04-05 18:07:02,702 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:02,883 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:02,953 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:03,058 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:03,100 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:03,134 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:03,161 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:03,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:03,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:03,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:03,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:03,467 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-04-05 18:07:03,467 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:10815, output treesize:197 [2018-04-05 18:07:03,743 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-04-05 18:07:03,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,770 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,773 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,791 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,799 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,805 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,806 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,816 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,818 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,819 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,819 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:07:03,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:07:03,905 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-04-05 18:07:03,908 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-04-05 18:07:03,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:07:04,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:04,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:07:04,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:7 [2018-04-05 18:07:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 143 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:07:04,417 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:07:07,462 WARN L148 SmtUtils]: Spent 2538ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-05 18:07:07,667 WARN L148 SmtUtils]: Spent 203ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-05 18:07:08,249 WARN L148 SmtUtils]: Spent 581ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-05 18:07:08,534 WARN L148 SmtUtils]: Spent 284ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-05 18:08:16,484 WARN L148 SmtUtils]: Spent 135ms on a formula simplification that was a NOOP. DAG size: 121 [2018-04-05 18:08:38,217 WARN L148 SmtUtils]: Spent 2136ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-05 18:09:00,075 WARN L148 SmtUtils]: Spent 2183ms on a formula simplification that was a NOOP. DAG size: 130 [2018-04-05 18:09:31,247 WARN L148 SmtUtils]: Spent 1048ms on a formula simplification that was a NOOP. DAG size: 136 [2018-04-05 18:10:02,258 WARN L148 SmtUtils]: Spent 6921ms on a formula simplification that was a NOOP. DAG size: 137 Received shutdown request... [2018-04-05 18:10:16,088 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-05 18:10:16,088 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-05 18:10:16,093 WARN L197 ceAbstractionStarter]: Timeout [2018-04-05 18:10:16,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:10:16 BoogieIcfgContainer [2018-04-05 18:10:16,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 18:10:16,094 INFO L168 Benchmark]: Toolchain (without parser) took 286071.05 ms. Allocated memory was 305.7 MB in the beginning and 561.5 MB in the end (delta: 255.9 MB). Free memory was 248.3 MB in the beginning and 457.4 MB in the end (delta: -209.1 MB). Peak memory consumption was 46.8 MB. Max. memory is 5.3 GB. [2018-04-05 18:10:16,095 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 305.7 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 18:10:16,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.58 ms. Allocated memory is still 305.7 MB. Free memory was 248.3 MB in the beginning and 237.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-04-05 18:10:16,095 INFO L168 Benchmark]: Boogie Preprocessor took 49.46 ms. Allocated memory is still 305.7 MB. Free memory was 237.3 MB in the beginning and 235.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-05 18:10:16,096 INFO L168 Benchmark]: RCFGBuilder took 647.29 ms. Allocated memory was 305.7 MB in the beginning and 468.7 MB in the end (delta: 163.1 MB). Free memory was 235.3 MB in the beginning and 420.5 MB in the end (delta: -185.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-05 18:10:16,096 INFO L168 Benchmark]: TraceAbstraction took 285048.66 ms. Allocated memory was 468.7 MB in the beginning and 561.5 MB in the end (delta: 92.8 MB). Free memory was 419.2 MB in the beginning and 457.4 MB in the end (delta: -38.2 MB). Peak memory consumption was 54.6 MB. Max. memory is 5.3 GB. [2018-04-05 18:10:16,098 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.27 ms. Allocated memory is still 305.7 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 320.58 ms. Allocated memory is still 305.7 MB. Free memory was 248.3 MB in the beginning and 237.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 49.46 ms. Allocated memory is still 305.7 MB. Free memory was 237.3 MB in the beginning and 235.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 647.29 ms. Allocated memory was 305.7 MB in the beginning and 468.7 MB in the end (delta: 163.1 MB). Free memory was 235.3 MB in the beginning and 420.5 MB in the end (delta: -185.2 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 285048.66 ms. Allocated memory was 468.7 MB in the beginning and 561.5 MB in the end (delta: 92.8 MB). Free memory was 419.2 MB in the beginning and 457.4 MB in the end (delta: -38.2 MB). Peak memory consumption was 54.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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 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 49 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 284.9s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 788 SDtfs, 750 SDslu, 1125 SDs, 0 SdLazy, 376 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s 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-04-05_18-10-16-108.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-04-05_18-10-16-108.csv Completed graceful shutdown