java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-835382a-m [2018-04-05 18:10:23,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 18:10:23,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 18:10:23,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 18:10:23,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 18:10:23,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 18:10:23,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 18:10:23,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 18:10:23,308 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 18:10:23,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 18:10:23,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 18:10:23,310 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 18:10:23,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 18:10:23,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 18:10:23,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 18:10:23,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 18:10:23,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 18:10:23,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 18:10:23,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 18:10:23,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 18:10:23,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 18:10:23,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 18:10:23,324 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 18:10:23,325 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 18:10:23,326 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 18:10:23,327 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 18:10:23,327 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 18:10:23,328 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 18:10:23,329 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 18:10:23,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 18:10:23,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 18:10:23,330 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-05 18:10:23,355 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 18:10:23,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 18:10:23,355 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 18:10:23,355 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 18:10:23,356 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 18:10:23,356 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 18:10:23,357 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 18:10:23,357 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 18:10:23,357 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 18:10:23,357 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 18:10:23,357 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 18:10:23,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 18:10:23,358 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 18:10:23,358 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 18:10:23,358 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 18:10:23,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 18:10:23,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 18:10:23,359 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 18:10:23,359 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 18:10:23,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 18:10:23,359 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 18:10:23,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 18:10:23,360 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 18:10:23,360 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 18:10:23,360 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 18:10:23,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 18:10:23,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 18:10:23,361 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 18:10:23,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 18:10:23,361 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 18:10:23,362 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 18:10:23,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:10:23,362 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 18:10:23,363 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 18:10:23,363 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 18:10:23,363 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 18:10:23,363 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 18:10:23,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 18:10:23,410 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 18:10:23,414 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 18:10:23,416 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 18:10:23,416 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 18:10:23,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-3_false-valid-deref.i [2018-04-05 18:10:23,732 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc9e23244b [2018-04-05 18:10:23,875 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 18:10:23,875 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 18:10:23,875 INFO L168 CDTParser]: Scanning test-bitfields-3_false-valid-deref.i [2018-04-05 18:10:23,877 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 18:10:23,877 INFO L215 ultiparseSymbolTable]: [2018-04-05 18:10:23,877 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 18:10:23,877 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-3_false-valid-deref.i [2018-04-05 18:10:23,877 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 18:10:23,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__size_t in test-bitfields-3_false-valid-deref.i [2018-04-05 18:10:23,877 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___false_valid_deref_i__d in test-bitfields-3_false-valid-deref.i [2018-04-05 18:10:23,894 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc9e23244b [2018-04-05 18:10:23,899 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 18:10:23,901 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 18:10:23,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 18:10:23,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 18:10:23,909 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 18:10:23,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:10:23" (1/1) ... [2018-04-05 18:10:23,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678baf54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:23, skipping insertion in model container [2018-04-05 18:10:23,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:10:23" (1/1) ... [2018-04-05 18:10:23,927 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 18:10:23,941 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 18:10:24,077 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 18:10:24,105 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 18:10:24,111 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-05 18:10:24,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24 WrapperNode [2018-04-05 18:10:24,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 18:10:24,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 18:10:24,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 18:10:24,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 18:10:24,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24" (1/1) ... [2018-04-05 18:10:24,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24" (1/1) ... [2018-04-05 18:10:24,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24" (1/1) ... [2018-04-05 18:10:24,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24" (1/1) ... [2018-04-05 18:10:24,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24" (1/1) ... [2018-04-05 18:10:24,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24" (1/1) ... [2018-04-05 18:10:24,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24" (1/1) ... [2018-04-05 18:10:24,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 18:10:24,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 18:10:24,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 18:10:24,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 18:10:24,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 18:10:24,220 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 18:10:24,220 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 18:10:24,221 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 18:10:24,221 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-05 18:10:24,221 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-05 18:10:24,221 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 18:10:24,221 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 18:10:24,221 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 18:10:24,221 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 18:10:24,221 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-05 18:10:24,221 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 18:10:24,221 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 18:10:24,222 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 18:10:24,222 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 18:10:24,222 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 18:10:24,222 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 18:10:24,700 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-05 18:10:24,714 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 18:10:24,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:10:24 BoogieIcfgContainer [2018-04-05 18:10:24,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 18:10:24,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 18:10:24,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 18:10:24,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 18:10:24,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:10:23" (1/3) ... [2018-04-05 18:10:24,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc27dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:10:24, skipping insertion in model container [2018-04-05 18:10:24,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:10:24" (2/3) ... [2018-04-05 18:10:24,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc27dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:10:24, skipping insertion in model container [2018-04-05 18:10:24,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:10:24" (3/3) ... [2018-04-05 18:10:24,721 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i [2018-04-05 18:10:24,728 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 18:10:24,734 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 47 error locations. [2018-04-05 18:10:24,778 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 18:10:24,778 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 18:10:24,778 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 18:10:24,779 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 18:10:24,779 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 18:10:24,779 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 18:10:24,779 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 18:10:24,779 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 18:10:24,779 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 18:10:24,780 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 18:10:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-04-05 18:10:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-05 18:10:24,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:10:24,799 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:10:24,799 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-05 18:10:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970878, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:10:24,814 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:10:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:10:24,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:10:24,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:10:24,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:24,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:24,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 18:10:24,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-04-05 18:10:24,940 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:10:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:24,991 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:10:24,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 18:10:24,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 18:10:25,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 18:10:25,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 18:10:25,005 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2018-04-05 18:10:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:10:25,354 INFO L93 Difference]: Finished difference Result 268 states and 305 transitions. [2018-04-05 18:10:25,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 18:10:25,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-05 18:10:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:10:25,370 INFO L225 Difference]: With dead ends: 268 [2018-04-05 18:10:25,370 INFO L226 Difference]: Without dead ends: 243 [2018-04-05 18:10:25,374 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-05 18:10:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-04-05 18:10:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2018-04-05 18:10:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-05 18:10:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-04-05 18:10:25,419 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 18 [2018-04-05 18:10:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:10:25,421 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-04-05 18:10:25,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 18:10:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-04-05 18:10:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-05 18:10:25,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:10:25,422 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:10:25,422 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-05 18:10:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970879, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:10:25,431 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:10:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:10:25,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:10:25,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:10:25,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:25,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:25,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 18:10:25,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 18:10:25,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:25,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 18:10:25,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-05 18:10:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:25,569 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:10:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:25,640 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:10:25,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 18:10:25,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 18:10:25,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 18:10:25,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 18:10:25,644 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 3 states. [2018-04-05 18:10:25,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:10:25,735 INFO L93 Difference]: Finished difference Result 233 states and 261 transitions. [2018-04-05 18:10:25,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 18:10:25,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-04-05 18:10:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:10:25,738 INFO L225 Difference]: With dead ends: 233 [2018-04-05 18:10:25,738 INFO L226 Difference]: Without dead ends: 232 [2018-04-05 18:10:25,739 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 18:10:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-05 18:10:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 148. [2018-04-05 18:10:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-05 18:10:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-04-05 18:10:25,752 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 18 [2018-04-05 18:10:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:10:25,753 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-04-05 18:10:25,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 18:10:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-04-05 18:10:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-05 18:10:25,753 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:10:25,754 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:10:25,754 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-05 18:10:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970880, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:10:25,766 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:10:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:10:25,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:10:25,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:10:25,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:25,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:25,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 18:10:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:25,816 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:10:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:25,858 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:10:25,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-05 18:10:25,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 18:10:25,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 18:10:25,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-05 18:10:25,860 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 6 states. [2018-04-05 18:10:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:10:25,970 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2018-04-05 18:10:25,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 18:10:25,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-05 18:10:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:10:25,973 INFO L225 Difference]: With dead ends: 148 [2018-04-05 18:10:25,973 INFO L226 Difference]: Without dead ends: 126 [2018-04-05 18:10:25,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-05 18:10:25,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-05 18:10:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-04-05 18:10:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-05 18:10:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2018-04-05 18:10:25,983 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 18 [2018-04-05 18:10:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:10:25,983 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-04-05 18:10:25,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 18:10:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2018-04-05 18:10:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-05 18:10:25,984 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:10:25,984 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:10:25,984 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-05 18:10:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2078970881, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:10:25,991 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:10:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:10:26,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:10:26,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:10:26,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:26,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:26,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 18:10:26,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 18:10:26,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:26,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 18:10:26,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-04-05 18:10:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:26,046 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:10:26,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:26,376 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:10:26,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 4 [2018-04-05 18:10:26,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-05 18:10:26,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-05 18:10:26,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-05 18:10:26,377 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand 5 states. [2018-04-05 18:10:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:10:26,475 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-04-05 18:10:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 18:10:26,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-05 18:10:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:10:26,477 INFO L225 Difference]: With dead ends: 126 [2018-04-05 18:10:26,477 INFO L226 Difference]: Without dead ends: 125 [2018-04-05 18:10:26,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=10, Unknown=1, NotChecked=0, Total=20 [2018-04-05 18:10:26,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-05 18:10:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-05 18:10:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-05 18:10:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-04-05 18:10:26,486 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 18 [2018-04-05 18:10:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:10:26,486 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-04-05 18:10:26,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-05 18:10:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-04-05 18:10:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-05 18:10:26,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:10:26,488 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:10:26,488 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-05 18:10:26,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2009038742, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:10:26,501 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:10:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:10:26,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:10:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:26,542 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:10:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:26,604 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:10:26,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-05 18:10:26,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 18:10:26,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 18:10:26,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-05 18:10:26,605 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 6 states. [2018-04-05 18:10:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:10:26,634 INFO L93 Difference]: Finished difference Result 230 states and 251 transitions. [2018-04-05 18:10:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 18:10:26,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-04-05 18:10:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:10:26,636 INFO L225 Difference]: With dead ends: 230 [2018-04-05 18:10:26,636 INFO L226 Difference]: Without dead ends: 129 [2018-04-05 18:10:26,637 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-05 18:10:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-05 18:10:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-04-05 18:10:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-05 18:10:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-04-05 18:10:26,644 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 34 [2018-04-05 18:10:26,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:10:26,645 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-04-05 18:10:26,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 18:10:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-04-05 18:10:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-05 18:10:26,646 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:10:26,646 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:10:26,646 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-05 18:10:26,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1651014666, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:10:26,658 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:10:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:10:26,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:10:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:26,740 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:10:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:26,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 18:10:26,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-05 18:10:26,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-05 18:10:26,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-05 18:10:26,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-04-05 18:10:26,844 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-04-05 18:10:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:10:26,897 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-05 18:10:26,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-05 18:10:26,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-04-05 18:10:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:10:26,899 INFO L225 Difference]: With dead ends: 242 [2018-04-05 18:10:26,899 INFO L226 Difference]: Without dead ends: 141 [2018-04-05 18:10:26,900 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-04-05 18:10:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-05 18:10:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-04-05 18:10:26,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-05 18:10:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-04-05 18:10:26,907 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 40 [2018-04-05 18:10:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:10:26,908 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-04-05 18:10:26,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-05 18:10:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-04-05 18:10:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-05 18:10:26,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:10:26,909 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:10:26,909 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-05 18:10:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash 264713398, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:10:26,915 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:10:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:10:26,938 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:10:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:26,977 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:10:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:10:27,138 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 18:10:27,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-04-05 18:10:27,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-05 18:10:27,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-05 18:10:27,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=173, Unknown=0, NotChecked=0, Total=306 [2018-04-05 18:10:27,140 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 18 states. [2018-04-05 18:10:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:10:27,191 INFO L93 Difference]: Finished difference Result 254 states and 277 transitions. [2018-04-05 18:10:27,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-05 18:10:27,192 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-04-05 18:10:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:10:27,193 INFO L225 Difference]: With dead ends: 254 [2018-04-05 18:10:27,193 INFO L226 Difference]: Without dead ends: 153 [2018-04-05 18:10:27,194 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=197, Unknown=0, NotChecked=0, Total=342 [2018-04-05 18:10:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-05 18:10:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-04-05 18:10:27,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-05 18:10:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-04-05 18:10:27,201 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 52 [2018-04-05 18:10:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:10:27,201 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-04-05 18:10:27,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-05 18:10:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-04-05 18:10:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-05 18:10:27,203 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:10:27,203 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-05 18:10:27,203 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr6AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr14AssertViolationMEMORY_FREE, mainErr33RequiresViolation, mainErr10AssertViolationMEMORY_FREE, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr7AssertViolationMEMORY_FREE, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr19AssertViolationMEMORY_FREE, mainErr18AssertViolationMEMORY_FREE, mainErr32RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr17RequiresViolation, mainErr23AssertViolationMEMORY_FREE, mainErr38AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr46EnsuresViolationMEMORY_LEAK, mainErr42AssertViolationMEMORY_FREE, mainErr11AssertViolationMEMORY_FREE, mainErr45AssertViolationMEMORY_FREE, mainErr22AssertViolationMEMORY_FREE, mainErr34AssertViolationMEMORY_FREE, mainErr20RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr24RequiresViolation, mainErr26AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr43AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr15AssertViolationMEMORY_FREE, mainErr39AssertViolationMEMORY_FREE, mainErr27AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr40RequiresViolation]=== [2018-04-05 18:10:27,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1439447690, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:10:27,219 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:10:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:10:27,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:10:27,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-05 18:10:27,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-05 18:10:27,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-05 18:10:27,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-05 18:10:27,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-05 18:10:27,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-05 18:10:27,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-05 18:10:27,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 60 [2018-04-05 18:10:27,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-05 18:10:27,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-05 18:10:27,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 93 [2018-04-05 18:10:27,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-05 18:10:27,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-05 18:10:27,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,395 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,398 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 132 [2018-04-05 18:10:27,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-05 18:10:27,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-04-05 18:10:27,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 179 [2018-04-05 18:10:27,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-05 18:10:27,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-04-05 18:10:27,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 234 [2018-04-05 18:10:27,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-04-05 18:10:27,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-04-05 18:10:27,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,846 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,849 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:10:27,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 164 [2018-04-05 18:10:27,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:10:27,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:7 [2018-04-05 18:10:29,396 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-05 18:10:30,327 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 68 [2018-04-05 18:10:31,590 WARN L148 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-05 18:10:32,544 WARN L148 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-05 18:10:34,099 WARN L148 SmtUtils]: Spent 238ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-05 18:13:27,769 WARN L151 SmtUtils]: Spent 173563ms on a formula simplification. DAG size of input: 3677 DAG size of output 64 [2018-04-05 18:13:27,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 126 [2018-04-05 18:13:27,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 149 [2018-04-05 18:13:27,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:27,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:27,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 114 [2018-04-05 18:13:27,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:27,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:27,988 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:27,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 139 [2018-04-05 18:13:28,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,018 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:28,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 172 [2018-04-05 18:13:28,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,055 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:28,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 215 [2018-04-05 18:13:28,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,114 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:28,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 266 [2018-04-05 18:13:28,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,161 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:28,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 325 [2018-04-05 18:13:28,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,223 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 29 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 381 [2018-04-05 18:13:28,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,312 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 37 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 445 [2018-04-05 18:13:28,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,441 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:28,508 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-04-05 18:13:28,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 46 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 544 [2018-04-05 18:13:28,511 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-05 18:13:28,642 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:28,708 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:28,776 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:28,813 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:28,842 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:28,866 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:28,885 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:28,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:28,934 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:29,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:29,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-05 18:13:29,080 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:10815, output treesize:197 [2018-04-05 18:13:29,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 137 [2018-04-05 18:13:29,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,328 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,332 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,364 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,365 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,368 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,375 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,377 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,378 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:13:29,379 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:13:29,457 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-04-05 18:13:29,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 20 select indices, 20 select index equivalence classes, 53 disjoint index pairs (out of 190 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 566 [2018-04-05 18:13:29,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:13:29,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:29,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:13:29,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:7 [2018-04-05 18:13:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 143 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:13:29,869 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:13:32,907 WARN L148 SmtUtils]: Spent 2452ms on a formula simplification that was a NOOP. DAG size: 128 [2018-04-05 18:13:33,067 WARN L148 SmtUtils]: Spent 157ms on a formula simplification that was a NOOP. DAG size: 84 [2018-04-05 18:13:33,557 WARN L148 SmtUtils]: Spent 489ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-05 18:13:33,695 WARN L148 SmtUtils]: Spent 137ms on a formula simplification that was a NOOP. DAG size: 94 [2018-04-05 18:13:57,267 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 107 [2018-04-05 18:14:41,802 WARN L148 SmtUtils]: Spent 2166ms on a formula simplification that was a NOOP. DAG size: 122 [2018-04-05 18:14:41,807 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-04-05 18:14:42,433 WARN L148 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 148 [2018-04-05 18:14:42,438 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-04-05 18:14:42,448 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:43,224 WARN L148 SmtUtils]: Spent 265ms on a formula simplification that was a NOOP. DAG size: 160 [2018-04-05 18:14:43,229 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:44,250 WARN L148 SmtUtils]: Spent 217ms on a formula simplification that was a NOOP. DAG size: 166 [2018-04-05 18:14:44,255 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:44,265 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:45,295 WARN L148 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 166 [2018-04-05 18:14:45,300 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:46,748 WARN L148 SmtUtils]: Spent 398ms on a formula simplification that was a NOOP. DAG size: 172 [2018-04-05 18:14:46,754 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:46,765 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:48,233 WARN L148 SmtUtils]: Spent 367ms on a formula simplification that was a NOOP. DAG size: 172 [2018-04-05 18:14:48,239 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:50,127 WARN L148 SmtUtils]: Spent 171ms on a formula simplification that was a NOOP. DAG size: 178 [2018-04-05 18:14:50,132 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:50,140 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:51,837 WARN L148 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 178 [2018-04-05 18:14:51,842 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:55,063 WARN L148 SmtUtils]: Spent 297ms on a formula simplification that was a NOOP. DAG size: 184 [2018-04-05 18:14:55,068 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:55,076 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:14:58,120 WARN L148 SmtUtils]: Spent 409ms on a formula simplification that was a NOOP. DAG size: 184 [2018-04-05 18:14:58,125 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:15:01,985 WARN L148 SmtUtils]: Spent 525ms on a formula simplification that was a NOOP. DAG size: 190 [2018-04-05 18:15:01,989 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:15:01,996 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-04-05 18:15:05,471 WARN L148 SmtUtils]: Spent 359ms on a formula simplification that was a NOOP. DAG size: 190 [2018-04-05 18:15:05,476 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 Received shutdown request... [2018-04-05 18:15:08,823 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-05 18:15:08,824 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-05 18:15:08,828 WARN L197 ceAbstractionStarter]: Timeout [2018-04-05 18:15:08,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:15:08 BoogieIcfgContainer [2018-04-05 18:15:08,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 18:15:08,829 INFO L168 Benchmark]: Toolchain (without parser) took 284929.73 ms. Allocated memory was 305.7 MB in the beginning and 512.8 MB in the end (delta: 207.1 MB). Free memory was 249.2 MB in the beginning and 440.6 MB in the end (delta: -191.4 MB). Peak memory consumption was 155.6 MB. Max. memory is 5.3 GB. [2018-04-05 18:15:08,830 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 18:15:08,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.73 ms. Allocated memory is still 305.7 MB. Free memory was 247.2 MB in the beginning and 237.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-04-05 18:15:08,831 INFO L168 Benchmark]: Boogie Preprocessor took 36.47 ms. Allocated memory is still 305.7 MB. Free memory was 237.2 MB in the beginning and 235.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-05 18:15:08,831 INFO L168 Benchmark]: RCFGBuilder took 552.79 ms. Allocated memory was 305.7 MB in the beginning and 468.2 MB in the end (delta: 162.5 MB). Free memory was 235.2 MB in the beginning and 419.9 MB in the end (delta: -184.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-05 18:15:08,831 INFO L168 Benchmark]: TraceAbstraction took 284113.45 ms. Allocated memory was 468.2 MB in the beginning and 512.8 MB in the end (delta: 44.6 MB). Free memory was 419.9 MB in the beginning and 440.6 MB in the end (delta: -20.7 MB). Peak memory consumption was 163.7 MB. Max. memory is 5.3 GB. [2018-04-05 18:15:08,833 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.18 ms. Allocated memory is still 305.7 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.73 ms. Allocated memory is still 305.7 MB. Free memory was 247.2 MB in the beginning and 237.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.47 ms. Allocated memory is still 305.7 MB. Free memory was 237.2 MB in the beginning and 235.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 552.79 ms. Allocated memory was 305.7 MB in the beginning and 468.2 MB in the end (delta: 162.5 MB). Free memory was 235.2 MB in the beginning and 419.9 MB in the end (delta: -184.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 284113.45 ms. Allocated memory was 468.2 MB in the beginning and 512.8 MB in the end (delta: 44.6 MB). Free memory was 419.9 MB in the beginning and 440.6 MB in the end (delta: -20.7 MB). Peak memory consumption was 163.7 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 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 57 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 47 error locations. TIMEOUT Result, 284.0s OverallTime, 8 OverallIterations, 10 TraceHistogramMax, 0.8s 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, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 382 ConstructedInterpolants, 12 QuantifiedInterpolants, 34110 SizeOfPredicates, 12 NumberOfNonLiveVariables, 623 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-05_18-15-08-844.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-3_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-05_18-15-08-844.csv Completed graceful shutdown