java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-11 23:25:48,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 23:25:48,809 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 23:25:48,823 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 23:25:48,823 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 23:25:48,824 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 23:25:48,826 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 23:25:48,827 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 23:25:48,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 23:25:48,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 23:25:48,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 23:25:48,832 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 23:25:48,833 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 23:25:48,834 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 23:25:48,835 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 23:25:48,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 23:25:48,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 23:25:48,841 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 23:25:48,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 23:25:48,843 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 23:25:48,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 23:25:48,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 23:25:48,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 23:25:48,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 23:25:48,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 23:25:48,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 23:25:48,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 23:25:48,851 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 23:25:48,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 23:25:48,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 23:25:48,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 23:25:48,852 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:25:48,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 23:25:48,877 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 23:25:48,878 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 23:25:48,878 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 23:25:48,879 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 23:25:48,879 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 23:25:48,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 23:25:48,879 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 23:25:48,879 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 23:25:48,880 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 23:25:48,880 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 23:25:48,880 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 23:25:48,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 23:25:48,881 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 23:25:48,881 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 23:25:48,881 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 23:25:48,881 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 23:25:48,882 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 23:25:48,882 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 23:25:48,882 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 23:25:48,882 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 23:25:48,882 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 23:25:48,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 23:25:48,883 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 23:25:48,883 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 23:25:48,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 23:25:48,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:25:48,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 23:25:48,884 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 23:25:48,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 23:25:48,884 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 23:25:48,884 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 23:25:48,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:25:48,885 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 23:25:48,885 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 23:25:48,886 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 23:25:48,886 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 23:25:48,886 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 23:25:48,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 23:25:48,934 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 23:25:48,938 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 23:25:48,939 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 23:25:48,940 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 23:25:48,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 23:25:49,263 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc9e4d4110 [2018-04-11 23:25:49,388 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 23:25:49,389 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 23:25:49,389 INFO L168 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 23:25:49,390 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 23:25:49,390 INFO L215 ultiparseSymbolTable]: [2018-04-11 23:25:49,391 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 23:25:49,391 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 23:25:49,391 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 23:25:49,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 23:25:49,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 23:25:49,407 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc9e4d4110 [2018-04-11 23:25:49,412 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 23:25:49,414 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 23:25:49,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 23:25:49,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 23:25:49,420 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 23:25:49,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:25:49" (1/1) ... [2018-04-11 23:25:49,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f06360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49, skipping insertion in model container [2018-04-11 23:25:49,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:25:49" (1/1) ... [2018-04-11 23:25:49,437 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:25:49,451 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:25:49,580 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:25:49,613 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:25:49,620 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 23:25:49,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49 WrapperNode [2018-04-11 23:25:49,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 23:25:49,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 23:25:49,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 23:25:49,635 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 23:25:49,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49" (1/1) ... [2018-04-11 23:25:49,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49" (1/1) ... [2018-04-11 23:25:49,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49" (1/1) ... [2018-04-11 23:25:49,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49" (1/1) ... [2018-04-11 23:25:49,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49" (1/1) ... [2018-04-11 23:25:49,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49" (1/1) ... [2018-04-11 23:25:49,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49" (1/1) ... [2018-04-11 23:25:49,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 23:25:49,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 23:25:49,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 23:25:49,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 23:25:49,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49" (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:25:49,732 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 23:25:49,733 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 23:25:49,733 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 23:25:49,733 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 23:25:49,733 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 23:25:49,733 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 23:25:49,733 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 23:25:49,733 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 23:25:49,734 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 23:25:49,734 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 23:25:49,734 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 23:25:49,734 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 23:25:49,734 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 23:25:49,734 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 23:25:49,735 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 23:25:49,735 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 23:25:50,204 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 23:25:50,216 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 23:25:50,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:25:50 BoogieIcfgContainer [2018-04-11 23:25:50,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 23:25:50,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 23:25:50,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 23:25:50,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 23:25:50,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:25:49" (1/3) ... [2018-04-11 23:25:50,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e152621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:25:50, skipping insertion in model container [2018-04-11 23:25:50,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:25:49" (2/3) ... [2018-04-11 23:25:50,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e152621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:25:50, skipping insertion in model container [2018-04-11 23:25:50,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:25:50" (3/3) ... [2018-04-11 23:25:50,222 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-04-11 23:25:50,229 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 23:25:50,235 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-11 23:25:50,283 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 23:25:50,284 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 23:25:50,284 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 23:25:50,284 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 23:25:50,284 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 23:25:50,284 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 23:25:50,284 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 23:25:50,284 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 23:25:50,285 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 23:25:50,286 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 23:25:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-04-11 23:25:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 23:25:50,311 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:25:50,312 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:25:50,313 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:25:50,316 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:25:50,328 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:25:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:25:50,374 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:25:50,419 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:25:50,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:50,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:50,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:25:50,447 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:25:50,447 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:25:50,456 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:25:50,481 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:25:50,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 23:25:50,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 23:25:50,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 23:25:50,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 23:25:50,496 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-04-11 23:25:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:25:50,836 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-04-11 23:25:50,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:25:50,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-11 23:25:50,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:25:50,852 INFO L225 Difference]: With dead ends: 268 [2018-04-11 23:25:50,852 INFO L226 Difference]: Without dead ends: 243 [2018-04-11 23:25:50,855 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:25:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-11 23:25:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-04-11 23:25:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 23:25:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-04-11 23:25:50,901 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-04-11 23:25:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:25:50,902 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-04-11 23:25:50,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 23:25:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-04-11 23:25:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 23:25:50,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:25:50,903 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:25:50,903 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:25:50,903 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:25:50,911 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:25:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:25:50,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:25:50,952 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:25:50,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:50,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:50,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:25:51,010 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:25:51,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:51,016 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:25:51,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 23:25:51,029 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:25:51,029 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:25:51,055 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:25:51,077 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:25:51,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-11 23:25:51,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 23:25:51,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 23:25:51,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 23:25:51,079 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-04-11 23:25:51,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:25:51,187 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-04-11 23:25:51,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 23:25:51,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-04-11 23:25:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:25:51,190 INFO L225 Difference]: With dead ends: 233 [2018-04-11 23:25:51,190 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 23:25:51,191 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:25:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 23:25:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-04-11 23:25:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 23:25:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-04-11 23:25:51,203 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-04-11 23:25:51,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:25:51,204 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-04-11 23:25:51,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 23:25:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-04-11 23:25:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 23:25:51,205 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:25:51,205 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:25:51,205 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:25:51,205 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:25:51,218 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:25:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:25:51,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:25:51,244 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:25:51,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:51,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:51,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:25:51,277 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:25:51,277 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:25:51,312 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:25:51,335 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:25:51,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 23:25:51,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:25:51,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:25:51,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:25:51,336 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-04-11 23:25:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:25:51,501 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-04-11 23:25:51,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 23:25:51,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 23:25:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:25:51,504 INFO L225 Difference]: With dead ends: 148 [2018-04-11 23:25:51,504 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 23:25:51,504 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:25:51,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 23:25:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-11 23:25:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 23:25:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-04-11 23:25:51,513 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-04-11 23:25:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:25:51,514 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-04-11 23:25:51,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:25:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-04-11 23:25:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 23:25:51,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:25:51,515 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:25:51,516 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:25:51,516 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:25:51,531 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:25:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:25:51,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:25:51,569 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:25:51,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:51,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:51,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:25:51,601 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:25:51,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:51,625 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:25:51,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-11 23:25:51,644 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:25:51,644 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:25:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:25:51,984 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:25:51,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-11 23:25:51,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 23:25:51,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 23:25:51,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-11 23:25:51,985 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-04-11 23:25:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:25:52,098 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-04-11 23:25:52,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 23:25:52,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 23:25:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:25:52,101 INFO L225 Difference]: With dead ends: 126 [2018-04-11 23:25:52,101 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 23:25:52,101 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:25:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 23:25:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-11 23:25:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 23:25:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-04-11 23:25:52,111 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-04-11 23:25:52,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:25:52,111 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-04-11 23:25:52,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 23:25:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-04-11 23:25:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 23:25:52,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:25:52,113 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:25:52,113 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:25:52,113 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:25:52,125 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:25:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:25:52,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:25:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:25:52,207 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:25:52,319 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:25:52,339 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:25:52,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 23:25:52,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:25:52,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:25:52,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:25:52,341 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-04-11 23:25:52,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:25:52,373 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-04-11 23:25:52,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 23:25:52,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-11 23:25:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:25:52,375 INFO L225 Difference]: With dead ends: 230 [2018-04-11 23:25:52,376 INFO L226 Difference]: Without dead ends: 129 [2018-04-11 23:25:52,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:25:52,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-11 23:25:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-04-11 23:25:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 23:25:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-04-11 23:25:52,385 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-04-11 23:25:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:25:52,385 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-04-11 23:25:52,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:25:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-04-11 23:25:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 23:25:52,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:25:52,387 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:25:52,387 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:25:52,388 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:25:52,397 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:25:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:25:52,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:25:52,449 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:25:52,449 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:25:52,547 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:25:52,574 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:25:52,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-11 23:25:52,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 23:25:52,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 23:25:52,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-11 23:25:52,576 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-04-11 23:25:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:25:52,622 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-11 23:25:52,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 23:25:52,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-04-11 23:25:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:25:52,626 INFO L225 Difference]: With dead ends: 242 [2018-04-11 23:25:52,627 INFO L226 Difference]: Without dead ends: 141 [2018-04-11 23:25:52,628 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:25:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-11 23:25:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-04-11 23:25:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-11 23:25:52,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-04-11 23:25:52,635 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-04-11 23:25:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:25:52,635 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-04-11 23:25:52,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 23:25:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-04-11 23:25:52,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 23:25:52,636 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:25:52,636 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:25:52,636 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:25:52,636 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:25:52,644 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:25:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:25:52,670 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:25:52,735 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:25:52,736 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:25:52,857 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:25:52,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:25:52,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-11 23:25:52,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 23:25:52,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 23:25:52,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-04-11 23:25:52,878 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-04-11 23:25:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:25:52,945 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-04-11 23:25:52,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 23:25:52,946 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-11 23:25:52,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:25:52,947 INFO L225 Difference]: With dead ends: 254 [2018-04-11 23:25:52,947 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 23:25:52,948 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:25:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 23:25:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-11 23:25:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 23:25:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-04-11 23:25:52,957 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-04-11 23:25:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:25:52,958 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-04-11 23:25:52,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 23:25:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-04-11 23:25:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 23:25:52,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:25:52,960 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:25:52,960 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:25:52,960 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:25:52,976 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:25:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:25:53,017 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:25:53,024 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:25:53,026 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:25:53,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-11 23:25:53,039 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:25:53,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,042 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:25:53,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 23:25:53,061 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:25:53,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,066 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:25:53,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-11 23:25:53,091 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:25:53,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,098 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:25:53,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 23:25:53,136 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:25:53,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,149 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:25:53,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-11 23:25:53,195 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:25:53,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,213 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:25:53,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-11 23:25:53,371 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:25:53,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,406 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,417 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:25:53,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-11 23:25:53,603 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:25:53,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:25:53,629 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:25:53,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:25:53,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-11 23:25:56,102 WARN L148 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-11 23:25:58,350 WARN L148 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-11 23:25:59,710 WARN L148 SmtUtils]: Spent 267ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-11 23:27:19,580 WARN L151 SmtUtils]: Spent 79769ms on a formula simplification. DAG size of input: 3677 DAG size of output 64 [2018-04-11 23:27:19,785 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:27:19,793 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:27:19,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,808 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:27:19,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,824 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:19,825 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:27:19,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,850 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:19,851 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:27:19,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,866 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,890 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:19,891 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:27:19,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,938 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:19,939 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:27:19,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:19,994 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:19,996 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:27:20,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,064 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,066 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,096 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:27:20,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,110 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,145 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,148 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,196 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:27:20,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:20,298 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:27:20,300 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,426 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,492 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,561 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,599 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,628 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,653 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,673 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:20,948 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:27:20,948 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:10815, output treesize:197 [2018-04-11 23:27:21,161 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:27:21,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,192 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,195 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,208 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,223 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,227 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,233 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,234 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,236 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,238 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:27:21,239 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:27:21,318 INFO L303 Elim1Store]: Index analysis took 144 ms [2018-04-11 23:27:21,321 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:27:21,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:27:21,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:27:21,514 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:27:21,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:7 [2018-04-11 23:27:21,717 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:27:21,718 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:27:24,430 WARN L148 SmtUtils]: Spent 2254ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-11 23:27:24,739 WARN L148 SmtUtils]: Spent 306ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-11 23:27:25,325 WARN L148 SmtUtils]: Spent 584ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-11 23:27:25,670 WARN L148 SmtUtils]: Spent 344ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-11 23:27:47,041 WARN L148 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 101 [2018-04-11 23:28:21,341 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 118 [2018-04-11 23:28:45,957 WARN L148 SmtUtils]: Spent 2331ms on a formula simplification that was a NOOP. DAG size: 121 [2018-04-11 23:29:15,758 WARN L148 SmtUtils]: Spent 2419ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-11 23:29:48,668 WARN L148 SmtUtils]: Spent 1747ms on a formula simplification that was a NOOP. DAG size: 130 [2018-04-11 23:30:16,400 WARN L148 SmtUtils]: Spent 267ms on a formula simplification that was a NOOP. DAG size: 136 Received shutdown request... [2018-04-11 23:30:34,361 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 23:30:34,361 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 23:30:34,371 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 23:30:34,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:30:34 BoogieIcfgContainer [2018-04-11 23:30:34,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 23:30:34,372 INFO L168 Benchmark]: Toolchain (without parser) took 284959.74 ms. Allocated memory was 302.5 MB in the beginning and 550.0 MB in the end (delta: 247.5 MB). Free memory was 245.0 MB in the beginning and 520.3 MB in the end (delta: -275.2 MB). Peak memory consumption was 197.5 MB. Max. memory is 5.3 GB. [2018-04-11 23:30:34,373 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 302.5 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 23:30:34,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.59 ms. Allocated memory is still 302.5 MB. Free memory was 245.0 MB in the beginning and 234.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:30:34,373 INFO L168 Benchmark]: Boogie Preprocessor took 42.99 ms. Allocated memory is still 302.5 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:30:34,374 INFO L168 Benchmark]: RCFGBuilder took 538.61 ms. Allocated memory was 302.5 MB in the beginning and 459.3 MB in the end (delta: 156.8 MB). Free memory was 232.1 MB in the beginning and 409.1 MB in the end (delta: -177.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-04-11 23:30:34,374 INFO L168 Benchmark]: TraceAbstraction took 284153.89 ms. Allocated memory was 459.3 MB in the beginning and 550.0 MB in the end (delta: 90.7 MB). Free memory was 409.1 MB in the beginning and 520.3 MB in the end (delta: -111.1 MB). Peak memory consumption was 204.8 MB. Max. memory is 5.3 GB. [2018-04-11 23:30:34,376 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 302.5 MB. Free memory is still 264.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.59 ms. Allocated memory is still 302.5 MB. Free memory was 245.0 MB in the beginning and 234.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.99 ms. Allocated memory is still 302.5 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.61 ms. Allocated memory was 302.5 MB in the beginning and 459.3 MB in the end (delta: 156.8 MB). Free memory was 232.1 MB in the beginning and 409.1 MB in the end (delta: -177.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 284153.89 ms. Allocated memory was 459.3 MB in the beginning and 550.0 MB in the end (delta: 90.7 MB). Free memory was 409.1 MB in the beginning and 520.3 MB in the end (delta: -111.1 MB). Peak memory consumption was 204.8 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 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 48 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 284.0s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 0.9s 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.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s 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, 1.1s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 382 ConstructedInterpolants, 12 QuantifiedInterpolants, 34110 SizeOfPredicates, 12 NumberOfNonLiveVariables, 623 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_23-30-34-386.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_23-30-34-386.csv Completed graceful shutdown