java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cf7e2d-m [2018-03-29 21:35:03,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-29 21:35:03,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-29 21:35:03,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-29 21:35:03,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-29 21:35:03,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-29 21:35:03,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-29 21:35:03,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-29 21:35:03,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-29 21:35:03,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-29 21:35:03,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-29 21:35:03,266 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-29 21:35:03,267 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-29 21:35:03,268 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-29 21:35:03,269 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-29 21:35:03,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-29 21:35:03,273 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-29 21:35:03,274 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-29 21:35:03,276 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-29 21:35:03,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-29 21:35:03,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-29 21:35:03,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-29 21:35:03,280 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-29 21:35:03,280 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-29 21:35:03,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-29 21:35:03,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-29 21:35:03,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-29 21:35:03,283 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-29 21:35:03,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-29 21:35:03,284 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-29 21:35:03,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-29 21:35:03,285 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-03-29 21:35:03,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-29 21:35:03,310 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-29 21:35:03,310 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-29 21:35:03,310 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-29 21:35:03,311 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-29 21:35:03,311 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-29 21:35:03,311 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-29 21:35:03,311 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-29 21:35:03,311 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-29 21:35:03,311 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-29 21:35:03,312 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-29 21:35:03,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-29 21:35:03,312 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-29 21:35:03,312 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-29 21:35:03,312 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-29 21:35:03,313 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-29 21:35:03,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-29 21:35:03,313 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-29 21:35:03,313 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-29 21:35:03,313 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-29 21:35:03,313 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-29 21:35:03,314 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-29 21:35:03,314 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-29 21:35:03,314 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-29 21:35:03,314 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-29 21:35:03,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 21:35:03,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-29 21:35:03,315 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-29 21:35:03,315 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-29 21:35:03,315 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-29 21:35:03,315 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-29 21:35:03,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:03,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-29 21:35:03,316 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-29 21:35:03,316 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-29 21:35:03,316 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-29 21:35:03,317 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-29 21:35:03,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-29 21:35:03,359 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-29 21:35:03,363 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-29 21:35:03,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-29 21:35:03,364 INFO L276 PluginConnector]: CDTParser initialized [2018-03-29 21:35:03,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-29 21:35:03,677 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf08ce2fba [2018-03-29 21:35:03,817 INFO L287 CDTParser]: IsIndexed: true [2018-03-29 21:35:03,817 INFO L288 CDTParser]: Found 1 translation units. [2018-03-29 21:35:03,818 INFO L168 CDTParser]: Scanning test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-29 21:35:03,823 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-29 21:35:03,823 INFO L215 ultiparseSymbolTable]: [2018-03-29 21:35:03,823 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-29 21:35:03,824 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-29 21:35:03,824 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-29 21:35:03,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-29 21:35:03,824 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-29 21:35:03,842 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGf08ce2fba [2018-03-29 21:35:03,847 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-29 21:35:03,852 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-29 21:35:03,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-29 21:35:03,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-29 21:35:03,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-29 21:35:03,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:35:03" (1/1) ... [2018-03-29 21:35:03,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3698b4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:03, skipping insertion in model container [2018-03-29 21:35:03,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.03 09:35:03" (1/1) ... [2018-03-29 21:35:03,879 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:35:03,897 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-29 21:35:04,057 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:35:04,092 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-29 21:35:04,099 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-03-29 21:35:04,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04 WrapperNode [2018-03-29 21:35:04,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-29 21:35:04,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-29 21:35:04,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-29 21:35:04,120 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-29 21:35:04,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04" (1/1) ... [2018-03-29 21:35:04,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04" (1/1) ... [2018-03-29 21:35:04,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04" (1/1) ... [2018-03-29 21:35:04,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04" (1/1) ... [2018-03-29 21:35:04,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04" (1/1) ... [2018-03-29 21:35:04,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04" (1/1) ... [2018-03-29 21:35:04,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04" (1/1) ... [2018-03-29 21:35:04,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-29 21:35:04,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-29 21:35:04,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-29 21:35:04,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-29 21:35:04,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-29 21:35:04,221 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-29 21:35:04,221 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-29 21:35:04,221 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-29 21:35:04,222 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-03-29 21:35:04,222 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-03-29 21:35:04,222 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-29 21:35:04,222 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-29 21:35:04,222 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-29 21:35:04,222 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-29 21:35:04,223 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-03-29 21:35:04,223 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-29 21:35:04,223 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-29 21:35:04,223 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-29 21:35:04,223 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-29 21:35:04,223 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-29 21:35:04,224 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-29 21:35:04,696 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-03-29 21:35:04,709 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-29 21:35:04,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:35:04 BoogieIcfgContainer [2018-03-29 21:35:04,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-29 21:35:04,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-29 21:35:04,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-29 21:35:04,714 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-29 21:35:04,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.03 09:35:03" (1/3) ... [2018-03-29 21:35:04,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483b4853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:35:04, skipping insertion in model container [2018-03-29 21:35:04,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.03 09:35:04" (2/3) ... [2018-03-29 21:35:04,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483b4853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.03 09:35:04, skipping insertion in model container [2018-03-29 21:35:04,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.03 09:35:04" (3/3) ... [2018-03-29 21:35:04,716 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_true-valid-memsafety_true-termination.i [2018-03-29 21:35:04,723 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-29 21:35:04,730 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-03-29 21:35:04,776 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-29 21:35:04,777 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-29 21:35:04,777 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-29 21:35:04,777 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-29 21:35:04,778 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-29 21:35:04,778 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-29 21:35:04,778 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-29 21:35:04,778 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-29 21:35:04,778 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-29 21:35:04,779 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-29 21:35:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-03-29 21:35:04,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-29 21:35:04,799 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:04,800 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:04,800 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-29 21:35:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970878, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:04,815 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:04,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:04,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:35:04,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:04,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:04,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:35:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:04,940 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:04,975 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:04,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-29 21:35:04,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-29 21:35:04,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-29 21:35:04,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-29 21:35:04,989 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-03-29 21:35:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:05,355 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-03-29 21:35:05,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-29 21:35:05,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-03-29 21:35:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:05,372 INFO L225 Difference]: With dead ends: 268 [2018-03-29 21:35:05,372 INFO L226 Difference]: Without dead ends: 243 [2018-03-29 21:35:05,376 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-29 21:35:05,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-03-29 21:35:05,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-03-29 21:35:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-03-29 21:35:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-03-29 21:35:05,429 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-03-29 21:35:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:05,430 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-03-29 21:35:05,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-29 21:35:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-03-29 21:35:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-29 21:35:05,432 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:05,432 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:05,432 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-29 21:35:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970879, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:05,447 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:05,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:05,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:35:05,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:05,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:05,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-29 21:35:05,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 21:35:05,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:05,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:35:05,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-29 21:35:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:05,532 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:05,598 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:05,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-29 21:35:05,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-29 21:35:05,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-29 21:35:05,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 21:35:05,601 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-03-29 21:35:05,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:05,685 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-03-29 21:35:05,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 21:35:05,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-03-29 21:35:05,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:05,687 INFO L225 Difference]: With dead ends: 233 [2018-03-29 21:35:05,687 INFO L226 Difference]: Without dead ends: 232 [2018-03-29 21:35:05,688 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-29 21:35:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-03-29 21:35:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-03-29 21:35:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-03-29 21:35:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-03-29 21:35:05,697 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-03-29 21:35:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:05,698 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-03-29 21:35:05,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-29 21:35:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-03-29 21:35:05,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-29 21:35:05,699 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:05,699 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:05,699 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-29 21:35:05,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970880, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:05,708 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:05,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:05,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:35:05,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:05,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:05,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:35:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:05,766 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:05,859 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:05,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-29 21:35:05,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:35:05,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:35:05,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:35:05,861 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-03-29 21:35:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:05,986 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-03-29 21:35:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-29 21:35:05,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-03-29 21:35:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:05,988 INFO L225 Difference]: With dead ends: 148 [2018-03-29 21:35:05,989 INFO L226 Difference]: Without dead ends: 126 [2018-03-29 21:35:05,989 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-29 21:35:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-03-29 21:35:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-03-29 21:35:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-03-29 21:35:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-03-29 21:35:05,999 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-03-29 21:35:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:05,999 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-03-29 21:35:06,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:35:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-03-29 21:35:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-03-29 21:35:06,000 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:06,001 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:06,001 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-29 21:35:06,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970881, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:06,008 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:06,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:06,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-29 21:35:06,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:06,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:06,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-29 21:35:06,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-29 21:35:06,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:06,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-29 21:35:06,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-03-29 21:35:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:06,062 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:06,439 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:06,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-03-29 21:35:06,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-29 21:35:06,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-29 21:35:06,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-03-29 21:35:06,440 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-03-29 21:35:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:06,554 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-03-29 21:35:06,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-29 21:35:06,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-03-29 21:35:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:06,555 INFO L225 Difference]: With dead ends: 126 [2018-03-29 21:35:06,555 INFO L226 Difference]: Without dead ends: 125 [2018-03-29 21:35:06,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-03-29 21:35:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-03-29 21:35:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-03-29 21:35:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-03-29 21:35:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-03-29 21:35:06,566 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-03-29 21:35:06,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:06,566 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-03-29 21:35:06,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-29 21:35:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-03-29 21:35:06,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-03-29 21:35:06,567 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:06,567 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:06,567 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-29 21:35:06,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2009038742, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:06,584 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:06,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:06,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:06,665 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:06,799 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-29 21:35:06,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-29 21:35:06,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-29 21:35:06,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-29 21:35:06,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-29 21:35:06,800 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-03-29 21:35:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:06,832 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-03-29 21:35:06,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-29 21:35:06,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-03-29 21:35:06,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:06,834 INFO L225 Difference]: With dead ends: 230 [2018-03-29 21:35:06,835 INFO L226 Difference]: Without dead ends: 129 [2018-03-29 21:35:06,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-03-29 21:35:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-03-29 21:35:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-03-29 21:35:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-03-29 21:35:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-03-29 21:35:06,845 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-03-29 21:35:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:06,845 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-03-29 21:35:06,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-29 21:35:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-03-29 21:35:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-03-29 21:35:06,847 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:06,847 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:06,847 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-29 21:35:06,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1651014666, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:06,854 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:06,877 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:06,943 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:07,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:35:07,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-29 21:35:07,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-29 21:35:07,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-29 21:35:07,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-03-29 21:35:07,036 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-03-29 21:35:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:07,090 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-03-29 21:35:07,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-29 21:35:07,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-03-29 21:35:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:07,092 INFO L225 Difference]: With dead ends: 242 [2018-03-29 21:35:07,092 INFO L226 Difference]: Without dead ends: 141 [2018-03-29 21:35:07,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-03-29 21:35:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-03-29 21:35:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-03-29 21:35:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-03-29 21:35:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-03-29 21:35:07,102 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-03-29 21:35:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:07,102 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-03-29 21:35:07,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-29 21:35:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-03-29 21:35:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-03-29 21:35:07,103 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:07,104 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:07,104 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-29 21:35:07,104 INFO L82 PathProgramCache]: Analyzing trace with hash 264713398, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:07,112 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:07,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:07,176 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:35:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:35:07,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-29 21:35:07,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-03-29 21:35:07,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-29 21:35:07,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-29 21:35:07,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-03-29 21:35:07,587 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-03-29 21:35:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-29 21:35:07,661 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-03-29 21:35:07,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-29 21:35:07,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-03-29 21:35:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-29 21:35:07,663 INFO L225 Difference]: With dead ends: 254 [2018-03-29 21:35:07,663 INFO L226 Difference]: Without dead ends: 153 [2018-03-29 21:35:07,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=197, Unknown=0, NotChecked=0, Total=342 [2018-03-29 21:35:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-03-29 21:35:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-03-29 21:35:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-03-29 21:35:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-03-29 21:35:07,674 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-03-29 21:35:07,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-29 21:35:07,675 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-03-29 21:35:07,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-29 21:35:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-03-29 21:35:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-03-29 21:35:07,677 INFO L347 BasicCegarLoop]: Found error trace [2018-03-29 21:35:07,677 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-29 21:35:07,677 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-03-29 21:35:07,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1439447690, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-29 21:35:07,690 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-29 21:35:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-29 21:35:07,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-29 21:35:07,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-29 21:35:07,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-29 21:35:07,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-03-29 21:35:07,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-29 21:35:07,753 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,754 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-03-29 21:35:07,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-03-29 21:35:07,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-29 21:35:07,776 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,777 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,777 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,778 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 60 [2018-03-29 21:35:07,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-03-29 21:35:07,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-03-29 21:35:07,809 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,810 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,811 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,811 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,812 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,812 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,813 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 93 [2018-03-29 21:35:07,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-03-29 21:35:07,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-03-29 21:35:07,853 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,853 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,854 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,855 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,855 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,856 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,857 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,857 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,858 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,859 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,860 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 132 [2018-03-29 21:35:07,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-03-29 21:35:07,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-03-29 21:35:07,916 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,917 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,918 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,918 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,919 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,920 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,920 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,921 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,922 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,922 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,923 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,924 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,924 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,925 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,926 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,926 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:07,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 179 [2018-03-29 21:35:07,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:07,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-03-29 21:35:08,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-03-29 21:35:08,052 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,053 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,054 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,055 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,056 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,058 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,059 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,068 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,070 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,071 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,072 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,073 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,074 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,075 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,076 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,077 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,078 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,080 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,081 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,082 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,084 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,085 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 234 [2018-03-29 21:35:08,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:08,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:08,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:08,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-03-29 21:35:08,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-03-29 21:35:08,265 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,270 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,273 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,274 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,274 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,275 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,276 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,276 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,277 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,277 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,278 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,278 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,279 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,279 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,280 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,280 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,281 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,281 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,282 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,283 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,283 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,284 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:35:08,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 164 [2018-03-29 21:35:08,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:35:08,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:08,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:35:08,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-03-29 21:35:10,822 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 68 [2018-03-29 21:35:13,047 WARN L148 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 82 [2018-03-29 21:35:14,353 WARN L148 SmtUtils]: Spent 262ms on a formula simplification that was a NOOP. DAG size: 88 [2018-03-29 21:36:33,862 WARN L151 SmtUtils]: Spent 79413ms on a formula simplification. DAG size of input: 3677 DAG size of output 64 [2018-03-29 21:36:34,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 126 [2018-03-29 21:36:34,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 149 [2018-03-29 21:36:34,052 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,056 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 114 [2018-03-29 21:36:34,071 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,073 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,074 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:34,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 139 [2018-03-29 21:36:34,095 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,100 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,104 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,107 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,107 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:34,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 172 [2018-03-29 21:36:34,121 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,125 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,128 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,132 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,134 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,137 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,141 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,141 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:34,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 215 [2018-03-29 21:36:34,157 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,161 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,166 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,168 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,171 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,173 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,175 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,178 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,180 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,183 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,185 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,186 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:34,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 266 [2018-03-29 21:36:34,199 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,202 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,205 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,208 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,211 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,215 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,217 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,219 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,221 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,223 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,225 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,230 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,234 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,236 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,239 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,241 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,241 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:34,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 325 [2018-03-29 21:36:34,258 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,262 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,264 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,267 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,270 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,273 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,277 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,279 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,280 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,282 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,285 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,288 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,291 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,296 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,299 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,302 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,305 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,308 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,310 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,313 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,316 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,324 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 381 [2018-03-29 21:36:34,361 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,363 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,364 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,365 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,367 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,368 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,369 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,370 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,372 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,374 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,375 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,376 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,378 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,379 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,381 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,382 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,384 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,385 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,386 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,388 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,389 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,391 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,392 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,394 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,395 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,397 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,398 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,400 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,401 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,403 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 445 [2018-03-29 21:36:34,477 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,479 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,481 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,483 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,484 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,486 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,488 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,490 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,492 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,493 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,494 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,495 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,496 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,497 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,499 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,500 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,501 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,502 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,503 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,504 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,505 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,506 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,507 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,508 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,509 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,510 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,511 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,512 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,514 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,515 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,516 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,517 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,518 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,519 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,520 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,521 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,523 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,524 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,525 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:34,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 544 [2018-03-29 21:36:34,568 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-03-29 21:36:34,713 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:34,776 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:34,843 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:34,880 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:34,911 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:34,935 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:34,955 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:34,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:35,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:35,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:35,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-03-29 21:36:35,212 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:10815, output treesize:197 [2018-03-29 21:36:35,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 137 [2018-03-29 21:36:35,450 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,451 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,451 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,452 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,453 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,454 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,455 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,456 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,457 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,457 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,458 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,459 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,460 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,460 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,461 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,461 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,462 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,463 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,464 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,464 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,465 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,465 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,466 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,467 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,467 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,468 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,469 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,470 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,471 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,472 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,472 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,473 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,474 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,475 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,475 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,476 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,477 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,477 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,478 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,478 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,479 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,480 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,481 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,481 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,482 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,483 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,484 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,485 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,485 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,486 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,487 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,488 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,488 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,489 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,490 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,490 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,491 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,492 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,492 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,493 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,493 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,494 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,495 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,496 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,496 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,497 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,498 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,499 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,499 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,500 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,501 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,501 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,502 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,503 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,503 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,504 INFO L700 Elim1Store]: detected not equals via solver [2018-03-29 21:36:35,504 INFO L682 Elim1Store]: detected equality via solver [2018-03-29 21:36:35,582 INFO L303 Elim1Store]: Index analysis took 143 ms [2018-03-29 21:36:35,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 20 select indices, 20 select index equivalence classes, 53 disjoint index pairs (out of 190 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 566 [2018-03-29 21:36:35,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-29 21:36:35,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:35,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-29 21:36:35,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:7 [2018-03-29 21:36:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 143 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-29 21:36:35,990 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-29 21:36:39,286 WARN L148 SmtUtils]: Spent 2817ms on a formula simplification that was a NOOP. DAG size: 128 [2018-03-29 21:36:39,630 WARN L148 SmtUtils]: Spent 342ms on a formula simplification that was a NOOP. DAG size: 84 [2018-03-29 21:36:40,049 WARN L148 SmtUtils]: Spent 418ms on a formula simplification that was a NOOP. DAG size: 96 [2018-03-29 21:36:40,204 WARN L148 SmtUtils]: Spent 153ms on a formula simplification that was a NOOP. DAG size: 94 [2018-03-29 21:37:09,365 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 107 [2018-03-29 21:37:48,513 WARN L148 SmtUtils]: Spent 506ms on a formula simplification that was a NOOP. DAG size: 121 Received shutdown request... [2018-03-29 21:37:50,676 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-03-29 21:37:50,677 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-29 21:37:50,681 WARN L197 ceAbstractionStarter]: Timeout [2018-03-29 21:37:50,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.03 09:37:50 BoogieIcfgContainer [2018-03-29 21:37:50,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-29 21:37:50,682 INFO L168 Benchmark]: Toolchain (without parser) took 166834.37 ms. Allocated memory was 299.9 MB in the beginning and 513.8 MB in the end (delta: 213.9 MB). Free memory was 243.9 MB in the beginning and 322.3 MB in the end (delta: -78.4 MB). Peak memory consumption was 135.5 MB. Max. memory is 5.3 GB. [2018-03-29 21:37:50,683 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 299.9 MB. Free memory is still 262.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-29 21:37:50,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.40 ms. Allocated memory is still 299.9 MB. Free memory was 242.9 MB in the beginning and 232.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-03-29 21:37:50,684 INFO L168 Benchmark]: Boogie Preprocessor took 47.02 ms. Allocated memory is still 299.9 MB. Free memory was 232.8 MB in the beginning and 230.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-29 21:37:50,684 INFO L168 Benchmark]: RCFGBuilder took 542.50 ms. Allocated memory was 299.9 MB in the beginning and 456.1 MB in the end (delta: 156.2 MB). Free memory was 230.8 MB in the beginning and 406.5 MB in the end (delta: -175.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-03-29 21:37:50,684 INFO L168 Benchmark]: TraceAbstraction took 165971.31 ms. Allocated memory was 456.1 MB in the beginning and 513.8 MB in the end (delta: 57.7 MB). Free memory was 406.5 MB in the beginning and 322.3 MB in the end (delta: 84.2 MB). Peak memory consumption was 141.9 MB. Max. memory is 5.3 GB. [2018-03-29 21:37:50,687 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.20 ms. Allocated memory is still 299.9 MB. Free memory is still 262.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 266.40 ms. Allocated memory is still 299.9 MB. Free memory was 242.9 MB in the beginning and 232.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.02 ms. Allocated memory is still 299.9 MB. Free memory was 232.8 MB in the beginning and 230.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 542.50 ms. Allocated memory was 299.9 MB in the beginning and 456.1 MB in the end (delta: 156.2 MB). Free memory was 230.8 MB in the beginning and 406.5 MB in the end (delta: -175.7 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 165971.31 ms. Allocated memory was 456.1 MB in the beginning and 513.8 MB in the end (delta: 57.7 MB). Free memory was 406.5 MB in the beginning and 322.3 MB in the end (delta: 84.2 MB). Peak memory consumption was 141.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 60). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 48). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 52). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 63). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 51). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 55). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 64). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 54). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 61). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 57). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 70). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 49). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 67). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 66). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 69). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 10, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 45 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 165.9s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 788 SDtfs, 750 SDslu, 1125 SDs, 0 SdLazy, 376 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 345 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 382 ConstructedInterpolants, 12 QuantifiedInterpolants, 34110 SizeOfPredicates, 12 NumberOfNonLiveVariables, 623 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-29_21-37-50-696.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-29_21-37-50-696.csv Completed graceful shutdown