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-2.1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-11 23:30:49,810 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 23:30:49,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 23:30:49,825 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 23:30:49,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 23:30:49,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 23:30:49,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 23:30:49,828 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 23:30:49,830 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 23:30:49,830 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 23:30:49,831 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 23:30:49,831 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 23:30:49,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 23:30:49,833 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 23:30:49,834 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 23:30:49,836 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 23:30:49,838 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 23:30:49,839 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 23:30:49,841 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 23:30:49,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 23:30:49,844 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 23:30:49,844 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 23:30:49,845 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 23:30:49,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 23:30:49,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 23:30:49,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 23:30:49,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 23:30:49,848 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 23:30:49,849 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 23:30:49,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 23:30:49,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 23:30:49,850 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-11 23:30:49,875 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 23:30:49,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 23:30:49,875 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 23:30:49,875 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 23:30:49,876 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 23:30:49,876 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 23:30:49,876 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 23:30:49,877 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 23:30:49,877 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 23:30:49,877 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 23:30:49,877 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 23:30:49,878 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 23:30:49,878 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 23:30:49,878 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 23:30:49,878 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 23:30:49,878 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 23:30:49,879 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 23:30:49,879 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 23:30:49,879 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 23:30:49,879 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 23:30:49,879 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 23:30:49,880 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 23:30:49,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 23:30:49,880 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 23:30:49,880 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 23:30:49,880 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 23:30:49,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:30:49,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 23:30:49,881 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 23:30:49,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 23:30:49,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 23:30:49,882 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 23:30:49,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:49,882 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 23:30:49,883 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 23:30:49,883 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 23:30:49,883 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 23:30:49,884 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 23:30:49,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 23:30:49,930 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 23:30:49,934 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 23:30:49,935 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 23:30:49,936 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 23:30:49,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2.1_false-valid-free.i [2018-04-11 23:30:50,245 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcee41c29b [2018-04-11 23:30:50,366 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 23:30:50,366 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 23:30:50,366 INFO L168 CDTParser]: Scanning test-bitfields-2.1_false-valid-free.i [2018-04-11 23:30:50,367 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 23:30:50,368 INFO L215 ultiparseSymbolTable]: [2018-04-11 23:30:50,368 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 23:30:50,368 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2.1_false-valid-free.i [2018-04-11 23:30:50,368 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 23:30:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__d in test-bitfields-2.1_false-valid-free.i [2018-04-11 23:30:50,368 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__size_t in test-bitfields-2.1_false-valid-free.i [2018-04-11 23:30:50,383 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcee41c29b [2018-04-11 23:30:50,387 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 23:30:50,389 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 23:30:50,390 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 23:30:50,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 23:30:50,395 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 23:30:50,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:30:50" (1/1) ... [2018-04-11 23:30:50,398 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e045437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50, skipping insertion in model container [2018-04-11 23:30:50,398 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:30:50" (1/1) ... [2018-04-11 23:30:50,412 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:30:50,424 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:30:50,547 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:30:50,576 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:30:50,584 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 23:30:50,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50 WrapperNode [2018-04-11 23:30:50,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 23:30:50,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 23:30:50,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 23:30:50,600 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 23:30:50,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50" (1/1) ... [2018-04-11 23:30:50,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50" (1/1) ... [2018-04-11 23:30:50,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50" (1/1) ... [2018-04-11 23:30:50,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50" (1/1) ... [2018-04-11 23:30:50,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50" (1/1) ... [2018-04-11 23:30:50,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50" (1/1) ... [2018-04-11 23:30:50,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50" (1/1) ... [2018-04-11 23:30:50,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 23:30:50,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 23:30:50,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 23:30:50,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 23:30:50,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:30:50,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 23:30:50,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 23:30:50,701 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 23:30:50,701 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 23:30:50,701 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 23:30:50,701 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 23:30:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 23:30:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 23:30:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 23:30:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 23:30:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 23:30:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 23:30:50,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 23:30:50,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 23:30:50,703 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 23:30:50,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 23:30:51,051 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 23:30:51,105 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 23:30:51,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:30:51 BoogieIcfgContainer [2018-04-11 23:30:51,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 23:30:51,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 23:30:51,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 23:30:51,110 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 23:30:51,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:30:50" (1/3) ... [2018-04-11 23:30:51,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56983967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:30:51, skipping insertion in model container [2018-04-11 23:30:51,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:30:50" (2/3) ... [2018-04-11 23:30:51,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56983967 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:30:51, skipping insertion in model container [2018-04-11 23:30:51,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:30:51" (3/3) ... [2018-04-11 23:30:51,113 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i [2018-04-11 23:30:51,122 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 23:30:51,130 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-04-11 23:30:51,174 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 23:30:51,174 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 23:30:51,174 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 23:30:51,174 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 23:30:51,174 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 23:30:51,174 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 23:30:51,175 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 23:30:51,175 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 23:30:51,175 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 23:30:51,175 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 23:30:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-04-11 23:30:51,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 23:30:51,193 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:51,194 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:30:51,194 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 23:30:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash -329008504, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:51,209 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:51,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:51,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:51,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:51,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:51,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:30:51,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 23:30:51,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:51,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:30:51,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 23:30:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:51,358 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:51,440 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:51,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-11 23:30:51,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 23:30:51,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 23:30:51,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 23:30:51,455 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-04-11 23:30:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:51,585 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-04-11 23:30:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 23:30:51,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-11 23:30:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:51,598 INFO L225 Difference]: With dead ends: 143 [2018-04-11 23:30:51,598 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 23:30:51,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 23:30:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 23:30:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-04-11 23:30:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 23:30:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-04-11 23:30:51,641 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 21 [2018-04-11 23:30:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:51,641 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-04-11 23:30:51,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 23:30:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-04-11 23:30:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 23:30:51,642 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:51,642 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:30:51,642 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 23:30:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash -329008503, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:51,651 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:51,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:51,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:51,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:51,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:51,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:51,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:51,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 23:30:51,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:51,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:51,737 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 12 treesize of output 21 [2018-04-11 23:30:51,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:51,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:51,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:51,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 23:30:51,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:51,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:30:51,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-11 23:30:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:51,789 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:52,013 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:52,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 23:30:52,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:30:52,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:30:52,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:30:52,016 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 6 states. [2018-04-11 23:30:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:52,236 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-11 23:30:52,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:30:52,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 23:30:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:52,245 INFO L225 Difference]: With dead ends: 134 [2018-04-11 23:30:52,245 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 23:30:52,246 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:30:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 23:30:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2018-04-11 23:30:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-11 23:30:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-04-11 23:30:52,258 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 21 [2018-04-11 23:30:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:52,259 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-04-11 23:30:52,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:30:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-04-11 23:30:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 23:30:52,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:52,260 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] [2018-04-11 23:30:52,261 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 23:30:52,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1500569353, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:52,268 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:52,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:52,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:52,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:52,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:52,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:30: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:30:52,319 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:52,349 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:52,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 23:30:52,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 23:30:52,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 23:30:52,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 23:30:52,351 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 4 states. [2018-04-11 23:30:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:52,440 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-04-11 23:30:52,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:30:52,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-11 23:30:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:52,442 INFO L225 Difference]: With dead ends: 133 [2018-04-11 23:30:52,443 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 23:30:52,443 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 23:30:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 23:30:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-04-11 23:30:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 23:30:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-04-11 23:30:52,453 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 26 [2018-04-11 23:30:52,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:52,453 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-04-11 23:30:52,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 23:30:52,454 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-04-11 23:30:52,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 23:30:52,455 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:52,455 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] [2018-04-11 23:30:52,455 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 23:30:52,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1500569351, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:52,462 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:52,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:52,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:52,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:52,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:52,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:30:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:52,535 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:52,590 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:52,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 23:30:52,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:30:52,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:30:52,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:30:52,591 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 6 states. [2018-04-11 23:30:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:52,666 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-04-11 23:30:52,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 23:30:52,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 23:30:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:52,667 INFO L225 Difference]: With dead ends: 89 [2018-04-11 23:30:52,667 INFO L226 Difference]: Without dead ends: 79 [2018-04-11 23:30:52,668 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:30:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-11 23:30:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-04-11 23:30:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 23:30:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-04-11 23:30:52,675 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 26 [2018-04-11 23:30:52,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:52,676 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-04-11 23:30:52,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:30:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-04-11 23:30:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 23:30:52,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:52,678 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:30:52,678 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 23:30:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash 826268719, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:52,684 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:52,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:52,720 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:52,779 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:30:52,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 23:30:52,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:30:52,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:30:52,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:30:52,781 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-04-11 23:30:52,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:52,820 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-04-11 23:30:52,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 23:30:52,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-04-11 23:30:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:52,822 INFO L225 Difference]: With dead ends: 130 [2018-04-11 23:30:52,822 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 23:30:52,823 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 23:30:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 23:30:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-11 23:30:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 23:30:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-04-11 23:30:52,831 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 42 [2018-04-11 23:30:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:52,832 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-04-11 23:30:52,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:30:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-04-11 23:30:52,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 23:30:52,833 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:52,834 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:30:52,834 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 23:30:52,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1613333361, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:52,843 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:52,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:52,924 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:52,990 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:30:52,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-11 23:30:52,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 23:30:52,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 23:30:52,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-04-11 23:30:52,991 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 10 states. [2018-04-11 23:30:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:53,053 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-04-11 23:30:53,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 23:30:53,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-04-11 23:30:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:53,055 INFO L225 Difference]: With dead ends: 136 [2018-04-11 23:30:53,055 INFO L226 Difference]: Without dead ends: 89 [2018-04-11 23:30:53,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-04-11 23:30:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-11 23:30:53,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-04-11 23:30:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 23:30:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-04-11 23:30:53,064 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 48 [2018-04-11 23:30:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:53,065 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-04-11 23:30:53,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 23:30:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-04-11 23:30:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 23:30:53,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:53,067 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:30:53,067 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 23:30:53,067 INFO L82 PathProgramCache]: Analyzing trace with hash 21714159, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:53,076 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:53,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:53,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 23:30:53,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 23:30:53,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-11 23:30:53,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 23:30:53,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-11 23:30:53,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 23:30:53,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 23:30:53,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-04-11 23:30:53,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 23:30:53,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-11 23:30:53,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,261 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-04-11 23:30:53,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-04-11 23:30:53,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-11 23:30:53,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-04-11 23:30:53,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-04-11 23:30:53,430 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 44 treesize of output 34 [2018-04-11 23:30:53,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:53,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-04-11 23:30:53,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:53,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-04-11 23:30:54,129 WARN L151 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 98 DAG size of output 37 [2018-04-11 23:30:54,155 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 78 treesize of output 74 [2018-04-11 23:30:54,160 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 79 treesize of output 81 [2018-04-11 23:30:54,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,165 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,166 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 42 treesize of output 60 [2018-04-11 23:30:54,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 98 [2018-04-11 23:30:54,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 131 [2018-04-11 23:30:54,191 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:30:54,272 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:204, output treesize:92 [2018-04-11 23:30:54,311 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 93 treesize of output 73 [2018-04-11 23:30:54,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2018-04-11 23:30:54,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-04-11 23:30:54,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,401 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:30:54,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:54,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-11 23:30:54,412 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:54,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:3 [2018-04-11 23:30:54,476 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:54,477 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:30:55,492 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 23:30:55,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:55,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:55,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:269, output treesize:1 [2018-04-11 23:30:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:30:55,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:30:55,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2018-04-11 23:30:55,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 23:30:55,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 23:30:55,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 23:30:55,549 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 36 states. [2018-04-11 23:30:56,992 WARN L151 SmtUtils]: Spent 333ms on a formula simplification. DAG size of input: 125 DAG size of output 113 [2018-04-11 23:30:57,335 WARN L151 SmtUtils]: Spent 221ms on a formula simplification. DAG size of input: 97 DAG size of output 92 [2018-04-11 23:30:57,636 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 98 DAG size of output 86 [2018-04-11 23:30:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:30:58,944 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions. [2018-04-11 23:30:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 23:30:58,944 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-04-11 23:30:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:30:58,948 INFO L225 Difference]: With dead ends: 225 [2018-04-11 23:30:58,949 INFO L226 Difference]: Without dead ends: 187 [2018-04-11 23:30:58,951 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=550, Invalid=3232, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 23:30:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-11 23:30:58,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2018-04-11 23:30:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 23:30:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-04-11 23:30:58,964 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 54 [2018-04-11 23:30:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:30:58,965 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-04-11 23:30:58,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 23:30:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-04-11 23:30:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 23:30:58,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:30:58,967 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:30:58,967 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-11 23:30:58,967 INFO L82 PathProgramCache]: Analyzing trace with hash 959712699, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:30:58,975 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:30:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:30:59,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:30:59,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:30:59,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:30:59,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 23:30:59,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 23:30:59,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 23:30:59,063 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 10 treesize of output 9 [2018-04-11 23:30:59,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 23:30:59,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 23:30:59,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,088 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 18 treesize of output 37 [2018-04-11 23:30:59,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-11 23:30:59,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-11 23:30:59,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,123 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-04-11 23:30:59,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 23:30:59,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-04-11 23:30:59,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-04-11 23:30:59,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-11 23:30:59,243 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 37 treesize of output 29 [2018-04-11 23:30:59,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:30:59,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-04-11 23:30:59,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:30:59,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-04-11 23:31:01,726 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 112 DAG size of output 53 [2018-04-11 23:31:01,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-04-11 23:31:01,740 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 45 treesize of output 48 [2018-04-11 23:31:01,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-04-11 23:31:01,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2018-04-11 23:31:01,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,768 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 99 [2018-04-11 23:31:01,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:31:01,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:31:01,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:31:01,827 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:31:01,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:31:01,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-11 23:31:01,891 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:232, output treesize:112 [2018-04-11 23:31:01,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 72 [2018-04-11 23:31:01,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,967 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:31:01,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 71 [2018-04-11 23:31:01,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:31:01,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,997 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:31:01,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:01,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:31:02,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 23:31:02,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:31:02,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:31:02,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:31:02,016 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:121, output treesize:3 [2018-04-11 23:31:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:31:02,064 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:34:48,419 WARN L148 SmtUtils]: Spent 154ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-11 23:35:27,794 WARN L148 SmtUtils]: Spent 158ms on a formula simplification that was a NOOP. DAG size: 80 [2018-04-11 23:35:27,800 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 679 treesize of output 498 [2018-04-11 23:35:27,911 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 113 DAG size of output 57 [2018-04-11 23:35:27,916 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 479 treesize of output 402 [2018-04-11 23:35:27,923 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:27,923 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:27,924 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 402 treesize of output 339 [2018-04-11 23:35:27,928 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:27,928 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:27,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:27,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:27,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 290 [2018-04-11 23:35:28,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,020 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,020 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,020 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,025 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,025 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,027 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,027 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,030 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 471 [2018-04-11 23:35:28,032 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:35:28,034 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 23:35:28,034 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 23:35:28,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:35:28,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:35:28,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:35:28,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 155 [2018-04-11 23:35:28,192 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,192 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,193 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,193 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,193 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,198 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,198 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,201 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,202 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,202 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,205 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,208 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,215 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,215 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,220 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,222 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,227 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,316 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 9 case distinctions, treesize of input 155 treesize of output 274 [2018-04-11 23:35:28,321 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 16 xjuncts. [2018-04-11 23:35:28,328 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,328 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,329 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,329 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,329 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,332 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,332 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,340 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,352 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,353 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,362 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,365 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,374 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,389 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 11 case distinctions, treesize of input 232 treesize of output 363 [2018-04-11 23:35:28,506 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 23:35:28,528 INFO L267 ElimStorePlain]: Start of recursive call 10: 16 dim-0 vars, End of recursive call: 16 dim-0 vars, and 64 xjuncts. [2018-04-11 23:35:28,534 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,543 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,544 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,546 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,547 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,547 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,548 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,548 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,549 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,549 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,550 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,550 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,554 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,555 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,562 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,567 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,582 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:28,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 312 [2018-04-11 23:35:28,611 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-11 23:35:29,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 149 [2018-04-11 23:35:29,404 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 23:35:29,408 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 149 [2018-04-11 23:35:29,409 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 23:35:29,416 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 145 [2018-04-11 23:35:29,417 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 23:35:29,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 145 [2018-04-11 23:35:29,435 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 23:35:29,438 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 145 [2018-04-11 23:35:29,439 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 23:35:29,447 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 145 [2018-04-11 23:35:29,448 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 23:35:29,553 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 115 [2018-04-11 23:35:29,593 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,593 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,594 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,596 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,597 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,597 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,597 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,600 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,601 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,609 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,610 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,612 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,612 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,613 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,613 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,615 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,615 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,616 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,616 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,618 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,618 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,626 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,636 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 251 [2018-04-11 23:35:29,798 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 80 DAG size of output 76 [2018-04-11 23:35:29,803 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,808 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,808 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,811 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,814 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,815 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,815 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,816 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,816 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,825 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,825 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,826 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,827 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,828 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,828 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,828 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,831 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,831 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,832 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,835 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,836 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,837 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,838 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,846 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,852 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,860 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:29,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 40 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 14 case distinctions, treesize of input 101 treesize of output 367 [2018-04-11 23:35:31,726 WARN L151 SmtUtils]: Spent 1778ms on a formula simplification. DAG size of input: 342 DAG size of output 279 [2018-04-11 23:35:31,736 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,736 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,738 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,738 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,741 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,745 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,745 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,747 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,747 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,748 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,748 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,749 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,750 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,752 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,753 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,753 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,754 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,755 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,756 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,758 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,758 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,758 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,759 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,759 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,760 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,762 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,774 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,782 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,790 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:31,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 193 treesize of output 428 [2018-04-11 23:35:31,878 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-11 23:35:32,494 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 234 xjuncts. [2018-04-11 23:35:32,502 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,503 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,504 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,505 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,505 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,507 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,510 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,511 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,517 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,518 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,518 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,519 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,519 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,524 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,542 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,554 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,565 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,573 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,579 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,587 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,587 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,588 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,589 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,590 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,675 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,694 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,725 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:35:32,754 INFO L303 Elim1Store]: Index analysis took 257 ms [2018-04-11 23:35:32,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 54 disjoint index pairs (out of 55 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 204 treesize of output 525 [2018-04-11 23:35:32,849 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 14 [2018-04-11 23:35:33,152 WARN L152 XnfTransformerHelper]: Simplifying conjuction of 16384 disjunctions. This might take some time... Received shutdown request... [2018-04-11 23:35:33,658 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 23:35:33,658 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 23:35:33,662 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 23:35:33,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:35:33 BoogieIcfgContainer [2018-04-11 23:35:33,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 23:35:33,663 INFO L168 Benchmark]: Toolchain (without parser) took 283275.57 ms. Allocated memory was 305.7 MB in the beginning and 542.6 MB in the end (delta: 237.0 MB). Free memory was 249.1 MB in the beginning and 434.9 MB in the end (delta: -185.8 MB). Peak memory consumption was 245.1 MB. Max. memory is 5.3 GB. [2018-04-11 23:35:33,664 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.7 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 23:35:33,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.78 ms. Allocated memory is still 305.7 MB. Free memory was 249.1 MB in the beginning and 238.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:35:33,665 INFO L168 Benchmark]: Boogie Preprocessor took 36.06 ms. Allocated memory is still 305.7 MB. Free memory was 238.1 MB in the beginning and 236.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:35:33,665 INFO L168 Benchmark]: RCFGBuilder took 469.59 ms. Allocated memory was 305.7 MB in the beginning and 469.2 MB in the end (delta: 163.6 MB). Free memory was 236.1 MB in the beginning and 427.7 MB in the end (delta: -191.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. [2018-04-11 23:35:33,665 INFO L168 Benchmark]: TraceAbstraction took 282556.36 ms. Allocated memory was 469.2 MB in the beginning and 542.6 MB in the end (delta: 73.4 MB). Free memory was 427.7 MB in the beginning and 434.9 MB in the end (delta: -7.2 MB). Peak memory consumption was 260.2 MB. Max. memory is 5.3 GB. [2018-04-11 23:35:33,667 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.22 ms. Allocated memory is still 305.7 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.78 ms. Allocated memory is still 305.7 MB. Free memory was 249.1 MB in the beginning and 238.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 36.06 ms. Allocated memory is still 305.7 MB. Free memory was 238.1 MB in the beginning and 236.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 469.59 ms. Allocated memory was 305.7 MB in the beginning and 469.2 MB in the end (delta: 163.6 MB). Free memory was 236.1 MB in the beginning and 427.7 MB in the end (delta: -191.6 MB). Peak memory consumption was 24.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 282556.36 ms. Allocated memory was 469.2 MB in the beginning and 542.6 MB in the end (delta: 73.4 MB). Free memory was 427.7 MB in the beginning and 434.9 MB in the end (delta: -7.2 MB). Peak memory consumption was 260.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 40). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 40). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 24). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 33 error locations. TIMEOUT Result, 282.4s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 425 SDtfs, 1325 SDslu, 1381 SDs, 0 SdLazy, 1225 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 404 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, 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, 191 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 462 ConstructedInterpolants, 44 QuantifiedInterpolants, 483728 SizeOfPredicates, 23 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/54 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-2.1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_23-35-33-678.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_23-35-33-678.csv Completed graceful shutdown