java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2.1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 22:25:50,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 22:25:50,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 22:25:50,370 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 22:25:50,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 22:25:50,371 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 22:25:50,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 22:25:50,374 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 22:25:50,376 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 22:25:50,377 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 22:25:50,378 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 22:25:50,379 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 22:25:50,380 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 22:25:50,381 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 22:25:50,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 22:25:50,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 22:25:50,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 22:25:50,388 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 22:25:50,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 22:25:50,391 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 22:25:50,393 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 22:25:50,394 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 22:25:50,394 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 22:25:50,395 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 22:25:50,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 22:25:50,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 22:25:50,398 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 22:25:50,399 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 22:25:50,399 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 22:25:50,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 22:25:50,400 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 22:25:50,401 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-09 22:25:50,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 22:25:50,425 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 22:25:50,426 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 22:25:50,426 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 22:25:50,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 22:25:50,427 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 22:25:50,427 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 22:25:50,427 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 22:25:50,427 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 22:25:50,427 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 22:25:50,428 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 22:25:50,428 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 22:25:50,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 22:25:50,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 22:25:50,428 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 22:25:50,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 22:25:50,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 22:25:50,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 22:25:50,429 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 22:25:50,429 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 22:25:50,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 22:25:50,429 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 22:25:50,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 22:25:50,430 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 22:25:50,430 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 22:25:50,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 22:25:50,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 22:25:50,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 22:25:50,431 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 22:25:50,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 22:25:50,431 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 22:25:50,431 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 22:25:50,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:50,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 22:25:50,432 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 22:25:50,433 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 22:25:50,433 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 22:25:50,433 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 22:25:50,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 22:25:50,485 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 22:25:50,491 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 22:25:50,493 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 22:25:50,493 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 22:25:50,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2.1_false-valid-free.i [2018-04-09 22:25:50,810 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe8f8b1e1e [2018-04-09 22:25:50,935 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 22:25:50,935 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 22:25:50,936 INFO L168 CDTParser]: Scanning test-bitfields-2.1_false-valid-free.i [2018-04-09 22:25:50,937 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 22:25:50,937 INFO L215 ultiparseSymbolTable]: [2018-04-09 22:25:50,937 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 22:25:50,937 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2.1_false-valid-free.i [2018-04-09 22:25:50,938 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 22:25:50,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__d in test-bitfields-2.1_false-valid-free.i [2018-04-09 22:25:50,938 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields_____false_valid_free_i__size_t in test-bitfields-2.1_false-valid-free.i [2018-04-09 22:25:50,953 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe8f8b1e1e [2018-04-09 22:25:50,957 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 22:25:50,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 22:25:50,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 22:25:50,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 22:25:50,967 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 22:25:50,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:25:50" (1/1) ... [2018-04-09 22:25:50,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec4ad3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:50, skipping insertion in model container [2018-04-09 22:25:50,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 10:25:50" (1/1) ... [2018-04-09 22:25:50,983 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:25:50,995 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 22:25:51,132 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:25:51,156 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 22:25:51,162 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-09 22:25:51,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51 WrapperNode [2018-04-09 22:25:51,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 22:25:51,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 22:25:51,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 22:25:51,175 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 22:25:51,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51" (1/1) ... [2018-04-09 22:25:51,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51" (1/1) ... [2018-04-09 22:25:51,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51" (1/1) ... [2018-04-09 22:25:51,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51" (1/1) ... [2018-04-09 22:25:51,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51" (1/1) ... [2018-04-09 22:25:51,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51" (1/1) ... [2018-04-09 22:25:51,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51" (1/1) ... [2018-04-09 22:25:51,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 22:25:51,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 22:25:51,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 22:25:51,219 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 22:25:51,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51" (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-09 22:25:51,292 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 22:25:51,292 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 22:25:51,292 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 22:25:51,292 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-09 22:25:51,292 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-09 22:25:51,292 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 22:25:51,293 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 22:25:51,293 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 22:25:51,293 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 22:25:51,293 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-09 22:25:51,293 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 22:25:51,294 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 22:25:51,294 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 22:25:51,294 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 22:25:51,294 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 22:25:51,294 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 22:25:51,682 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-09 22:25:51,723 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 22:25:51,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:25:51 BoogieIcfgContainer [2018-04-09 22:25:51,724 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 22:25:51,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 22:25:51,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 22:25:51,728 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 22:25:51,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 10:25:50" (1/3) ... [2018-04-09 22:25:51,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312caaa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:25:51, skipping insertion in model container [2018-04-09 22:25:51,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 10:25:51" (2/3) ... [2018-04-09 22:25:51,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@312caaa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 10:25:51, skipping insertion in model container [2018-04-09 22:25:51,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 10:25:51" (3/3) ... [2018-04-09 22:25:51,731 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i [2018-04-09 22:25:51,739 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 22:25:51,746 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-04-09 22:25:51,784 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 22:25:51,785 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 22:25:51,785 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 22:25:51,785 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 22:25:51,785 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 22:25:51,785 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 22:25:51,786 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 22:25:51,786 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 22:25:51,786 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 22:25:51,787 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 22:25:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-04-09 22:25:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 22:25:51,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:51,810 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:25:51,810 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-09 22:25:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash -329008504, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:51,825 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:51,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:51,907 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-09 22:25:51,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:51,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:51,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:25:51,934 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-09 22:25:51,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:51,951 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-09 22:25:51,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-09 22:25:51,968 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-09 22:25:51,968 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:52,041 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-09 22:25:52,079 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:52,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 22:25:52,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 22:25:52,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 22:25:52,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 22:25:52,101 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-04-09 22:25:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:52,237 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-04-09 22:25:52,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 22:25:52,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-09 22:25:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:52,254 INFO L225 Difference]: With dead ends: 143 [2018-04-09 22:25:52,254 INFO L226 Difference]: Without dead ends: 134 [2018-04-09 22:25:52,258 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 22:25:52,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-09 22:25:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-04-09 22:25:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-09 22:25:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-04-09 22:25:52,297 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 21 [2018-04-09 22:25:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:52,297 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-04-09 22:25:52,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 22:25:52,297 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-04-09 22:25:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-09 22:25:52,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:52,298 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:25:52,298 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-09 22:25:52,298 INFO L82 PathProgramCache]: Analyzing trace with hash -329008503, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:52,309 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:52,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:52,342 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-09 22:25:52,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,354 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-09 22:25:52,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-09 22:25:52,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-09 22:25:52,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:52,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 22:25:52,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:52,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:25:52,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-09 22:25:52,495 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-09 22:25:52,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:52,656 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-09 22:25:52,691 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:52,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 22:25:52,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:25:52,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:25:52,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:25:52,693 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 6 states. [2018-04-09 22:25:52,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:52,951 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-09 22:25:52,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:25:52,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-09 22:25:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:52,953 INFO L225 Difference]: With dead ends: 134 [2018-04-09 22:25:52,953 INFO L226 Difference]: Without dead ends: 128 [2018-04-09 22:25:52,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:25:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-09 22:25:52,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2018-04-09 22:25:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-09 22:25:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-04-09 22:25:52,966 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 21 [2018-04-09 22:25:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:52,967 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-04-09 22:25:52,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:25:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-04-09 22:25:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-09 22:25:52,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:52,969 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:25:52,969 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-09 22:25:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1500569353, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:52,976 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:53,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:53,024 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-09 22:25:53,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 22:25:53,031 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-09 22:25:53,031 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:53,038 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-09 22:25:53,063 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:53,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 22:25:53,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 22:25:53,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 22:25:53,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 22:25:53,064 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 4 states. [2018-04-09 22:25:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:53,148 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-04-09 22:25:53,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 22:25:53,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-09 22:25:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:53,151 INFO L225 Difference]: With dead ends: 133 [2018-04-09 22:25:53,151 INFO L226 Difference]: Without dead ends: 123 [2018-04-09 22:25:53,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-09 22:25:53,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-09 22:25:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-04-09 22:25:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-09 22:25:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-04-09 22:25:53,161 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 26 [2018-04-09 22:25:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:53,162 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-04-09 22:25:53,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 22:25:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-04-09 22:25:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-09 22:25:53,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:53,163 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:25:53,163 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-09 22:25:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1500569351, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:53,171 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:53,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:53,190 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-09 22:25:53,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:25:53,209 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-09 22:25:53,209 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:53,233 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-09 22:25:53,255 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:53,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 22:25:53,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:25:53,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:25:53,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:25:53,256 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 6 states. [2018-04-09 22:25:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:53,327 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-04-09 22:25:53,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 22:25:53,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-09 22:25:53,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:53,329 INFO L225 Difference]: With dead ends: 89 [2018-04-09 22:25:53,329 INFO L226 Difference]: Without dead ends: 79 [2018-04-09 22:25:53,329 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:25:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-09 22:25:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-04-09 22:25:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-09 22:25:53,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-04-09 22:25:53,337 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 26 [2018-04-09 22:25:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:53,338 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-04-09 22:25:53,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:25:53,338 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-04-09 22:25:53,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-09 22:25:53,339 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:53,339 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:25:53,340 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-09 22:25:53,340 INFO L82 PathProgramCache]: Analyzing trace with hash 826268719, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:53,349 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:53,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:53,383 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-09 22:25:53,383 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:53,425 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-09 22:25:53,455 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 22:25:53,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-09 22:25:53,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 22:25:53,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 22:25:53,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-09 22:25:53,456 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-04-09 22:25:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:53,498 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-04-09 22:25:53,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-09 22:25:53,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-04-09 22:25:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:53,500 INFO L225 Difference]: With dead ends: 130 [2018-04-09 22:25:53,500 INFO L226 Difference]: Without dead ends: 83 [2018-04-09 22:25:53,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-09 22:25:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-09 22:25:53,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-09 22:25:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-09 22:25:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-04-09 22:25:53,508 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 42 [2018-04-09 22:25:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:53,509 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-04-09 22:25:53,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 22:25:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-04-09 22:25:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-09 22:25:53,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:53,510 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:25:53,511 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-09 22:25:53,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1613333361, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:53,519 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:53,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:53,573 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-09 22:25:53,573 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:53,629 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-09 22:25:53,650 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:25:53,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-09 22:25:53,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-09 22:25:53,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-09 22:25:53,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-04-09 22:25:53,651 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 10 states. [2018-04-09 22:25:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:53,705 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-04-09 22:25:53,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 22:25:53,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-04-09 22:25:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:53,706 INFO L225 Difference]: With dead ends: 136 [2018-04-09 22:25:53,706 INFO L226 Difference]: Without dead ends: 89 [2018-04-09 22:25:53,706 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-04-09 22:25:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-09 22:25:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-04-09 22:25:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-09 22:25:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-04-09 22:25:53,713 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 48 [2018-04-09 22:25:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:53,713 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-04-09 22:25:53,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-09 22:25:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-04-09 22:25:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-09 22:25:53,715 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:53,716 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:25:53,716 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-09 22:25:53,716 INFO L82 PathProgramCache]: Analyzing trace with hash 21714159, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:53,724 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:53,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:53,777 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-09 22:25:53,779 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-09 22:25:53,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-09 22:25:53,798 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-09 22:25:53,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,804 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-09 22:25:53,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-09 22:25:53,832 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-09 22:25:53,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-04-09 22:25:53,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-09 22:25:53,897 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-09 22:25:53,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-04-09 22:25:53,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:53,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-04-09 22:25:53,979 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-09 22:25:53,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,985 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,995 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:53,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-04-09 22:25:54,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-04-09 22:25:54,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-04-09 22:25:54,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-04-09 22:25:54,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-04-09 22:25:54,742 WARN L151 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 98 DAG size of output 37 [2018-04-09 22:25:54,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 74 [2018-04-09 22:25:54,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2018-04-09 22:25:54,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2018-04-09 22:25:54,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 98 [2018-04-09 22:25:54,797 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,798 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 131 [2018-04-09 22:25:54,804 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,818 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 22:25:54,885 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:204, output treesize:92 [2018-04-09 22:25:54,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2018-04-09 22:25:54,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2018-04-09 22:25:54,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 36 [2018-04-09 22:25:54,977 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:54,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:54,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,001 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:25:55,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:55,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-09 22:25:55,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:55,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:55,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:55,046 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:3 [2018-04-09 22:25:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:25:55,082 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:25:56,105 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:25:56,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:56,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:56,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:269, output treesize:1 [2018-04-09 22:25:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:25:56,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 22:25:56,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2018-04-09 22:25:56,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-09 22:25:56,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-09 22:25:56,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2018-04-09 22:25:56,163 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 36 states. [2018-04-09 22:25:57,547 WARN L151 SmtUtils]: Spent 312ms on a formula simplification. DAG size of input: 125 DAG size of output 113 [2018-04-09 22:25:57,884 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 97 DAG size of output 92 [2018-04-09 22:25:58,170 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 98 DAG size of output 86 [2018-04-09 22:25:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 22:25:59,467 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions. [2018-04-09 22:25:59,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-09 22:25:59,467 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-04-09 22:25:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 22:25:59,471 INFO L225 Difference]: With dead ends: 225 [2018-04-09 22:25:59,471 INFO L226 Difference]: Without dead ends: 187 [2018-04-09 22:25:59,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=550, Invalid=3232, Unknown=0, NotChecked=0, Total=3782 [2018-04-09 22:25:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-09 22:25:59,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2018-04-09 22:25:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-09 22:25:59,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-04-09 22:25:59,485 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 54 [2018-04-09 22:25:59,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 22:25:59,486 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-04-09 22:25:59,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-09 22:25:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-04-09 22:25:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-09 22:25:59,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 22:25:59,487 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 22:25:59,488 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr30AssertViolationMEMORY_FREE, mainErr9RequiresViolation, mainErr32EnsuresViolationMEMORY_LEAK, mainErr7RequiresViolation, mainErr31AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation]=== [2018-04-09 22:25:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash 959712699, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 22:25:59,501 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 22:25:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 22:25:59,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 22:25:59,551 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-09 22:25:59,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 22:25:59,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 22:25:59,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-09 22:25:59,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-09 22:25:59,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 22:25:59,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-09 22:25:59,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-09 22:25:59,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-04-09 22:25:59,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-09 22:25:59,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-09 22:25:59,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-04-09 22:25:59,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-09 22:25:59,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-04-09 22:25:59,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-04-09 22:25:59,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-09 22:25:59,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-04-09 22:25:59,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:25:59,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-04-09 22:25:59,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:25:59,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-04-09 22:26:02,286 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 112 DAG size of output 53 [2018-04-09 22:26:02,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-04-09 22:26:02,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-04-09 22:26:02,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-04-09 22:26:02,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2018-04-09 22:26:02,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,323 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 99 [2018-04-09 22:26:02,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:26:02,364 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:26:02,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:26:02,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:26:02,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:26:02,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-04-09 22:26:02,443 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:232, output treesize:112 [2018-04-09 22:26:02,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 72 [2018-04-09 22:26:02,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:26:02,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 71 [2018-04-09 22:26:02,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 22:26:02,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,587 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:26:02,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 22:26:02,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-09 22:26:02,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 22:26:02,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:26:02,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:26:02,608 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:121, output treesize:3 [2018-04-09 22:26:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 22:26:02,648 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 22:27:20,034 WARN L148 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-09 22:27:55,308 WARN L148 SmtUtils]: Spent 2091ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-09 22:28:32,625 WARN L148 SmtUtils]: Spent 2080ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-09 22:29:13,958 WARN L148 SmtUtils]: Spent 2049ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-09 22:29:46,011 WARN L148 SmtUtils]: Spent 123ms on a formula simplification that was a NOOP. DAG size: 80 [2018-04-09 22:29:46,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 679 treesize of output 498 [2018-04-09 22:29:46,180 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 113 DAG size of output 57 [2018-04-09 22:29:46,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 479 treesize of output 402 [2018-04-09 22:29:46,190 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,191 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 402 treesize of output 339 [2018-04-09 22:29:46,198 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,199 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,199 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,200 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 290 [2018-04-09 22:29:46,331 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 86 DAG size of output 82 [2018-04-09 22:29:46,335 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,336 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,336 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,339 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,341 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,341 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,343 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,343 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,346 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 471 [2018-04-09 22:29:46,348 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 22:29:46,350 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 22:29:46,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 22:29:46,396 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:29:46,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:29:46,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 22:29:46,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 155 [2018-04-09 22:29:46,506 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,507 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,507 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,512 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,512 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,512 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,513 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,516 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,516 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,519 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,521 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,526 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,526 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,531 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,533 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,538 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,545 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 155 treesize of output 274 [2018-04-09 22:29:46,618 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 16 xjuncts. [2018-04-09 22:29:46,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,624 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,624 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,632 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,635 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,635 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,636 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,639 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,648 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,659 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,667 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,678 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,686 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 11 case distinctions, treesize of input 232 treesize of output 363 [2018-04-09 22:29:46,792 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 22:29:46,814 INFO L267 ElimStorePlain]: Start of recursive call 10: 16 dim-0 vars, End of recursive call: 16 dim-0 vars, and 64 xjuncts. [2018-04-09 22:29:46,820 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,822 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,823 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,823 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,823 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,824 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,824 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,825 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,825 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,825 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,833 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,839 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,850 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:46,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 312 [2018-04-09 22:29:46,880 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-09 22:29:47,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 149 [2018-04-09 22:29:47,586 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 22:29:47,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 149 [2018-04-09 22:29:47,590 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 22:29:47,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 145 [2018-04-09 22:29:47,603 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 22:29:47,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 145 [2018-04-09 22:29:47,615 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 22:29:47,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 145 [2018-04-09 22:29:47,619 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 22:29:47,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 145 [2018-04-09 22:29:47,623 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 22:29:47,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 115 [2018-04-09 22:29:47,726 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,727 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,727 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,728 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,729 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,729 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,729 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,733 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,734 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,748 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,749 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,754 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,757 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,761 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 251 [2018-04-09 22:29:47,907 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 80 DAG size of output 76 [2018-04-09 22:29:47,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,917 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,918 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,919 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,921 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,925 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,926 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,926 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,927 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,927 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,930 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,935 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,938 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,938 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,938 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,939 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,939 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,940 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,941 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,941 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,942 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,944 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,945 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,946 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,947 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,956 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,961 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:47,967 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:48,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 40 disjoint index pairs (out of 36 index pairs), introduced 2 new quantified variables, introduced 14 case distinctions, treesize of input 101 treesize of output 367 [2018-04-09 22:29:49,637 WARN L151 SmtUtils]: Spent 1586ms on a formula simplification. DAG size of input: 342 DAG size of output 279 [2018-04-09 22:29:49,647 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,648 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,648 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,649 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,649 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,650 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,651 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,651 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,654 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,656 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,657 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,658 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,658 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,665 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,665 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,667 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,668 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,668 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,668 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,669 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,669 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,671 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,680 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,686 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,693 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,703 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:49,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 193 treesize of output 428 [2018-04-09 22:29:49,768 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-09 22:29:50,340 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 234 xjuncts. [2018-04-09 22:29:50,347 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,347 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,348 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,349 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,352 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,352 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,358 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,360 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,375 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,383 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,383 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,400 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,400 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,414 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,416 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,424 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,425 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,427 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,428 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,456 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,456 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,457 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,458 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,459 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,494 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,527 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,572 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,590 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,596 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,609 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 22:29:50,612 INFO L303 Elim1Store]: Index analysis took 269 ms [2018-04-09 22:29:50,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 54 disjoint index pairs (out of 55 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 204 treesize of output 525 [2018-04-09 22:29:50,708 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 14 [2018-04-09 22:29:51,002 WARN L152 XnfTransformerHelper]: Simplifying conjuction of 16384 disjunctions. This might take some time... Received shutdown request... [2018-04-09 22:30:32,067 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-09 22:30:32,067 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 22:30:32,072 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 22:30:32,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 10:30:32 BoogieIcfgContainer [2018-04-09 22:30:32,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 22:30:32,073 INFO L168 Benchmark]: Toolchain (without parser) took 281115.88 ms. Allocated memory was 304.6 MB in the beginning and 716.7 MB in the end (delta: 412.1 MB). Free memory was 247.6 MB in the beginning and 528.4 MB in the end (delta: -280.8 MB). Peak memory consumption was 453.7 MB. Max. memory is 5.3 GB. [2018-04-09 22:30:32,074 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 304.6 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 22:30:32,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.25 ms. Allocated memory is still 304.6 MB. Free memory was 247.6 MB in the beginning and 236.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-04-09 22:30:32,075 INFO L168 Benchmark]: Boogie Preprocessor took 42.99 ms. Allocated memory is still 304.6 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-09 22:30:32,075 INFO L168 Benchmark]: RCFGBuilder took 505.98 ms. Allocated memory was 304.6 MB in the beginning and 465.6 MB in the end (delta: 161.0 MB). Free memory was 234.6 MB in the beginning and 424.3 MB in the end (delta: -189.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-09 22:30:32,076 INFO L168 Benchmark]: TraceAbstraction took 280347.55 ms. Allocated memory was 465.6 MB in the beginning and 716.7 MB in the end (delta: 251.1 MB). Free memory was 423.0 MB in the beginning and 528.4 MB in the end (delta: -105.5 MB). Peak memory consumption was 468.1 MB. Max. memory is 5.3 GB. [2018-04-09 22:30:32,078 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.31 ms. Allocated memory is still 304.6 MB. Free memory is still 266.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.25 ms. Allocated memory is still 304.6 MB. Free memory was 247.6 MB in the beginning and 236.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.99 ms. Allocated memory is still 304.6 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 505.98 ms. Allocated memory was 304.6 MB in the beginning and 465.6 MB in the end (delta: 161.0 MB). Free memory was 234.6 MB in the beginning and 424.3 MB in the end (delta: -189.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 280347.55 ms. Allocated memory was 465.6 MB in the beginning and 716.7 MB in the end (delta: 251.1 MB). Free memory was 423.0 MB in the beginning and 528.4 MB in the end (delta: -105.5 MB). Peak memory consumption was 468.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 40). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 37]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 40). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 24]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 24). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 46). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 58 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was XNF transformer was simplifying 16384 disjunctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 33 error locations. TIMEOUT Result, 280.2s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 425 SDtfs, 1325 SDslu, 1381 SDs, 0 SdLazy, 1225 SolverSat, 243 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 404 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 191 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 462 ConstructedInterpolants, 44 QuantifiedInterpolants, 483728 SizeOfPredicates, 23 NumberOfNonLiveVariables, 761 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 0/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_22-30-32-087.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2.1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_22-30-32-087.csv Completed graceful shutdown