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_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-11 23:30:41,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 23:30:41,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 23:30:41,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 23:30:41,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 23:30:41,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 23:30:41,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 23:30:41,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 23:30:41,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 23:30:41,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 23:30:41,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 23:30:41,510 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 23:30:41,511 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 23:30:41,512 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 23:30:41,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 23:30:41,515 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 23:30:41,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 23:30:41,519 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 23:30:41,520 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 23:30:41,522 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 23:30:41,524 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 23:30:41,524 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 23:30:41,524 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 23:30:41,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 23:30:41,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 23:30:41,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 23:30:41,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 23:30:41,528 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 23:30:41,529 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 23:30:41,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 23:30:41,530 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 23:30:41,530 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-11 23:30:41,552 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 23:30:41,552 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 23:30:41,552 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 23:30:41,553 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 23:30:41,553 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 23:30:41,553 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 23:30:41,553 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 23:30:41,554 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 23:30:41,554 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 23:30:41,554 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 23:30:41,554 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 23:30:41,554 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 23:30:41,555 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 23:30:41,555 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 23:30:41,555 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 23:30:41,555 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 23:30:41,555 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 23:30:41,555 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 23:30:41,555 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 23:30:41,556 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 23:30:41,556 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 23:30:41,556 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 23:30:41,556 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 23:30:41,556 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 23:30:41,556 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 23:30:41,557 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 23:30:41,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:30:41,557 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 23:30:41,557 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 23:30:41,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 23:30:41,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 23:30:41,558 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 23:30:41,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:41,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 23:30:41,559 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 23:30:41,559 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 23:30:41,559 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 23:30:41,559 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 23:30:41,591 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 23:30:41,601 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 23:30:41,604 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 23:30:41,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 23:30:41,605 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 23:30:41,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_false-valid-deref.i [2018-04-11 23:30:41,836 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG84f6cabb4 [2018-04-11 23:30:41,994 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 23:30:41,994 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 23:30:41,994 INFO L168 CDTParser]: Scanning test-bitfields-3_false-valid-deref.i [2018-04-11 23:30:41,995 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 23:30:41,996 INFO L215 ultiparseSymbolTable]: [2018-04-11 23:30:41,996 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 23:30:41,996 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_false-valid-deref.i [2018-04-11 23:30:41,996 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 23:30:41,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-3_false-valid-deref.i [2018-04-11 23:30:41,996 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-3_false-valid-deref.i [2018-04-11 23:30:42,011 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG84f6cabb4 [2018-04-11 23:30:42,016 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 23:30:42,019 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 23:30:42,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 23:30:42,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 23:30:42,025 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 23:30:42,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:30:42" (1/1) ... [2018-04-11 23:30:42,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545d1252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42, skipping insertion in model container [2018-04-11 23:30:42,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:30:42" (1/1) ... [2018-04-11 23:30:42,042 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:30:42,055 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:30:42,184 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:30:42,215 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:30:42,221 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 23:30:42,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42 WrapperNode [2018-04-11 23:30:42,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 23:30:42,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 23:30:42,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 23:30:42,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 23:30:42,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42" (1/1) ... [2018-04-11 23:30:42,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42" (1/1) ... [2018-04-11 23:30:42,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42" (1/1) ... [2018-04-11 23:30:42,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42" (1/1) ... [2018-04-11 23:30:42,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42" (1/1) ... [2018-04-11 23:30:42,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42" (1/1) ... [2018-04-11 23:30:42,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42" (1/1) ... [2018-04-11 23:30:42,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 23:30:42,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 23:30:42,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 23:30:42,279 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 23:30:42,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:30:42,329 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 23:30:42,329 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 23:30:42,329 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 23:30:42,329 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 23:30:42,329 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 23:30:42,330 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 23:30:42,330 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 23:30:42,330 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 23:30:42,330 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 23:30:42,330 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 23:30:42,330 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 23:30:42,331 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 23:30:42,331 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 23:30:42,331 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 23:30:42,331 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 23:30:42,331 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 23:30:42,801 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 23:30:42,817 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 23:30:42,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:30:42 BoogieIcfgContainer [2018-04-11 23:30:42,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 23:30:42,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 23:30:42,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 23:30:42,822 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 23:30:42,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:30:42" (1/3) ... [2018-04-11 23:30:42,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770a3002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:30:42, skipping insertion in model container [2018-04-11 23:30:42,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:42" (2/3) ... [2018-04-11 23:30:42,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770a3002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:30:42, skipping insertion in model container [2018-04-11 23:30:42,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:30:42" (3/3) ... [2018-04-11 23:30:42,826 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i [2018-04-11 23:30:42,833 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 23:30:42,841 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-11 23:30:42,877 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 23:30:42,877 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 23:30:42,877 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 23:30:42,878 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 23:30:42,878 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 23:30:42,878 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 23:30:42,878 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 23:30:42,878 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 23:30:42,878 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 23:30:42,879 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 23:30:42,892 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-04-11 23:30:42,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 23:30:42,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:42,899 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-11 23:30:42,899 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-11 23:30:42,904 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-11 23:30:42,919 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:42,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:43,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:43,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:43,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:43,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:30:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:43,022 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:43,057 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:43,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 23:30:43,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 23:30:43,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 23:30:43,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 23:30:43,072 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-04-11 23:30:43,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:43,373 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-04-11 23:30:43,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:30:43,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-11 23:30:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:43,388 INFO L225 Difference]: With dead ends: 268 [2018-04-11 23:30:43,389 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 23:30:43,392 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-11 23:30:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 23:30:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-04-11 23:30:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 23:30:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-04-11 23:30:43,437 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-04-11 23:30:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:43,438 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-04-11 23:30:43,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 23:30:43,439 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-04-11 23:30:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 23:30:43,440 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:43,440 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-11 23:30:43,440 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-11 23:30:43,440 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-11 23:30:43,448 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:43,467 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:43,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:43,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:43,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:43,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:30:43,508 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-11 23:30:43,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:43,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:30:43,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 23:30:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:43,543 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:43,589 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:43,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-11 23:30:43,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 23:30:43,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 23:30:43,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 23:30:43,591 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-04-11 23:30:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:43,688 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-04-11 23:30:43,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 23:30:43,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-04-11 23:30:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:43,691 INFO L225 Difference]: With dead ends: 233 [2018-04-11 23:30:43,691 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 23:30:43,692 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-11 23:30:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 23:30:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-04-11 23:30:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 23:30:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-04-11 23:30:43,705 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-04-11 23:30:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:43,705 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-04-11 23:30:43,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 23:30:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-04-11 23:30:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 23:30:43,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:43,706 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-11 23:30:43,706 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-11 23:30:43,707 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-11 23:30:43,718 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:43,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:43,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:43,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:43,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:43,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:30:43,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:43,764 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:43,841 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:43,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 23:30:43,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:30:43,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:30:43,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:30:43,843 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-04-11 23:30:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:43,966 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-04-11 23:30:43,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 23:30:43,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 23:30:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:43,968 INFO L225 Difference]: With dead ends: 148 [2018-04-11 23:30:43,968 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 23:30:43,968 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:30:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 23:30:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-11 23:30:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 23:30:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-04-11 23:30:43,977 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-04-11 23:30:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:43,978 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-04-11 23:30:43,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:30:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-04-11 23:30:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 23:30:43,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:43,979 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-11 23:30:43,979 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-11 23:30:43,979 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-11 23:30:43,991 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:44,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:44,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:44,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:44,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:44,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:30:44,030 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-11 23:30:44,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:44,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:30:44,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 23:30:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:44,059 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:44,398 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:44,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-11 23:30:44,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 23:30:44,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 23:30:44,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-11 23:30:44,399 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-04-11 23:30:44,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:44,443 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-04-11 23:30:44,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 23:30:44,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 23:30:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:44,445 INFO L225 Difference]: With dead ends: 126 [2018-04-11 23:30:44,446 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 23:30:44,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-11 23:30:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 23:30:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-11 23:30:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 23:30:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-04-11 23:30:44,455 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-04-11 23:30:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:44,456 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-04-11 23:30:44,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 23:30:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-04-11 23:30:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 23:30:44,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:44,457 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-11 23:30:44,458 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-11 23:30:44,458 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-11 23:30:44,467 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:44,491 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:44,504 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:44,547 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:44,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 23:30:44,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:30:44,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:30:44,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:30:44,549 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-04-11 23:30:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:44,578 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-04-11 23:30:44,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 23:30:44,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-11 23:30:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:44,579 INFO L225 Difference]: With dead ends: 230 [2018-04-11 23:30:44,579 INFO L226 Difference]: Without dead ends: 129 [2018-04-11 23:30:44,580 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-11 23:30:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-11 23:30:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-04-11 23:30:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 23:30:44,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-04-11 23:30:44,588 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-04-11 23:30:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:44,588 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-04-11 23:30:44,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:30:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-04-11 23:30:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 23:30:44,590 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:44,590 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-11 23:30:44,590 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-11 23:30:44,590 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-11 23:30:44,605 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:44,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:44,653 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-11 23:30:44,653 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:44,719 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-11 23:30:44,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:30:44,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-11 23:30:44,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 23:30:44,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 23:30:44,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-11 23:30:44,740 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-04-11 23:30:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:44,800 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-11 23:30:44,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 23:30:44,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-04-11 23:30:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:44,801 INFO L225 Difference]: With dead ends: 242 [2018-04-11 23:30:44,801 INFO L226 Difference]: Without dead ends: 141 [2018-04-11 23:30:44,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-04-11 23:30:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-11 23:30:44,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-04-11 23:30:44,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-11 23:30:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-04-11 23:30:44,811 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-04-11 23:30:44,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:44,811 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-04-11 23:30:44,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 23:30:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-04-11 23:30:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 23:30:44,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:44,813 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-11 23:30:44,814 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-11 23:30:44,814 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-11 23:30:44,826 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:44,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:44,938 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-11 23:30:44,938 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:45,073 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-11 23:30:45,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:30:45,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-11 23:30:45,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 23:30:45,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 23:30:45,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-04-11 23:30:45,096 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-04-11 23:30:45,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:45,149 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-04-11 23:30:45,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 23:30:45,150 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-11 23:30:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:45,151 INFO L225 Difference]: With dead ends: 254 [2018-04-11 23:30:45,151 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 23:30:45,152 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-11 23:30:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 23:30:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-11 23:30:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 23:30:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-04-11 23:30:45,159 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-04-11 23:30:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:45,160 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-04-11 23:30:45,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 23:30:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-04-11 23:30:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 23:30:45,162 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:45,162 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-11 23:30:45,162 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-11 23:30:45,162 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-11 23:30:45,173 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:45,214 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:45,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 23:30:45,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 23:30:45,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 23:30:45,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 23:30:45,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-11 23:30:45,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 23:30:45,267 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-11 23:30:45,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,273 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-11 23:30:45,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-11 23:30:45,298 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-11 23:30:45,301 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,306 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-11 23:30:45,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 23:30:45,352 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-11 23:30:45,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,365 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-11 23:30:45,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-11 23:30:45,407 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-11 23:30:45,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,422 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-11 23:30:45,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-11 23:30:45,506 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-11 23:30:45,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,542 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-11 23:30:45,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-11 23:30:45,701 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-11 23:30:45,706 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:45,720 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-11 23:30:45,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:45,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-11 23:30:47,365 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 23:30:48,257 WARN L148 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-11 23:30:49,550 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-11 23:30:50,543 WARN L148 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-11 23:30:52,225 WARN L148 SmtUtils]: Spent 250ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-11 23:33:47,950 WARN L151 SmtUtils]: Spent 175619ms on a formula simplification. DAG size of input: 3677 DAG size of output 64 [2018-04-11 23:33:48,160 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-11 23:33:48,172 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-11 23:33:48,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,186 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-11 23:33:48,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,201 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:48,202 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-11 23:33:48,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,238 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:48,239 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-11 23:33:48,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,274 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:48,275 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-11 23:33:48,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:48,340 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-11 23:33:48,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,391 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:48,393 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-11 23:33:48,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,513 INFO L303 Elim1Store]: Index analysis took 112 ms [2018-04-11 23:33:48,514 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-11 23:33:48,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,526 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,533 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,564 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,603 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-11 23:33:48,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:48,713 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-11 23:33:48,714 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 23:33:48,853 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:48,920 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:48,984 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,021 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,050 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,095 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,293 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-11 23:33:49,294 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:10815, output treesize:197 [2018-04-11 23:33:49,567 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-11 23:33:49,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,614 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,621 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,635 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,641 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,643 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,644 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:33:49,645 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:33:49,726 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-04-11 23:33:49,728 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-11 23:33:49,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:33:49,914 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-11 23:33:49,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:7 [2018-04-11 23:33:50,145 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-11 23:33:50,145 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:33:53,063 WARN L148 SmtUtils]: Spent 2410ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-11 23:33:53,292 WARN L148 SmtUtils]: Spent 227ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-11 23:33:53,843 WARN L148 SmtUtils]: Spent 550ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-11 23:33:54,095 WARN L148 SmtUtils]: Spent 251ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-11 23:35:22,953 WARN L148 SmtUtils]: Spent 2462ms on a formula simplification that was a NOOP. DAG size: 122 [2018-04-11 23:35:22,958 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 Received shutdown request... [2018-04-11 23:35:27,369 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 23:35:27,370 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 23:35:27,375 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 23:35:27,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:35:27 BoogieIcfgContainer [2018-04-11 23:35:27,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 23:35:27,376 INFO L168 Benchmark]: Toolchain (without parser) took 285358.84 ms. Allocated memory was 303.0 MB in the beginning and 521.1 MB in the end (delta: 218.1 MB). Free memory was 246.1 MB in the beginning and 456.0 MB in the end (delta: -209.9 MB). Peak memory consumption was 8.2 MB. Max. memory is 5.3 GB. [2018-04-11 23:35:27,377 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 303.0 MB. Free memory is still 264.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 23:35:27,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.99 ms. Allocated memory is still 303.0 MB. Free memory was 244.1 MB in the beginning and 234.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:35:27,377 INFO L168 Benchmark]: Boogie Preprocessor took 41.53 ms. Allocated memory is still 303.0 MB. Free memory was 234.1 MB in the beginning and 232.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:35:27,378 INFO L168 Benchmark]: RCFGBuilder took 538.70 ms. Allocated memory was 303.0 MB in the beginning and 462.4 MB in the end (delta: 159.4 MB). Free memory was 232.1 MB in the beginning and 414.3 MB in the end (delta: -182.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 23:35:27,378 INFO L168 Benchmark]: TraceAbstraction took 284556.94 ms. Allocated memory was 462.4 MB in the beginning and 521.1 MB in the end (delta: 58.7 MB). Free memory was 414.3 MB in the beginning and 456.0 MB in the end (delta: -41.7 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:35:27,381 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 303.0 MB. Free memory is still 264.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.99 ms. Allocated memory is still 303.0 MB. Free memory was 244.1 MB in the beginning and 234.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.53 ms. Allocated memory is still 303.0 MB. Free memory was 234.1 MB in the beginning and 232.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 538.70 ms. Allocated memory was 303.0 MB in the beginning and 462.4 MB in the end (delta: 159.4 MB). Free memory was 232.1 MB in the beginning and 414.3 MB in the end (delta: -182.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 284556.94 ms. Allocated memory was 462.4 MB in the beginning and 521.1 MB in the end (delta: 58.7 MB). Free memory was 414.3 MB in the beginning and 456.0 MB in the end (delta: -41.7 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 284.5s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 788 SDtfs, 750 SDslu, 1125 SDs, 0 SdLazy, 376 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s 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_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_23-35-27-391.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_23-35-27-391.csv Completed graceful shutdown