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-835382a-m [2018-04-05 18:11:37,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-05 18:11:37,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-05 18:11:37,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-05 18:11:37,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-05 18:11:37,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-05 18:11:37,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-05 18:11:37,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-05 18:11:37,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-05 18:11:37,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-05 18:11:37,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-05 18:11:37,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-05 18:11:37,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-05 18:11:37,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-05 18:11:37,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-05 18:11:37,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-05 18:11:37,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-05 18:11:37,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-05 18:11:37,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-05 18:11:37,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-05 18:11:37,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-05 18:11:37,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-05 18:11:37,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-05 18:11:37,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-05 18:11:37,770 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-05 18:11:37,771 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-05 18:11:37,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-05 18:11:37,772 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-05 18:11:37,773 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-05 18:11:37,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-05 18:11:37,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-05 18:11:37,774 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-05 18:11:37,799 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-05 18:11:37,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-05 18:11:37,800 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-05 18:11:37,800 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-05 18:11:37,801 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-05 18:11:37,801 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-05 18:11:37,801 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-05 18:11:37,802 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-05 18:11:37,802 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-05 18:11:37,802 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-05 18:11:37,802 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-05 18:11:37,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-05 18:11:37,803 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-05 18:11:37,803 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-05 18:11:37,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-05 18:11:37,803 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-05 18:11:37,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-05 18:11:37,804 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-05 18:11:37,804 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-05 18:11:37,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-05 18:11:37,804 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-05 18:11:37,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-05 18:11:37,805 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-05 18:11:37,805 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-05 18:11:37,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-05 18:11:37,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 18:11:37,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-05 18:11:37,806 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-05 18:11:37,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-05 18:11:37,806 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-05 18:11:37,806 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-05 18:11:37,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-05 18:11:37,807 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-05 18:11:37,808 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-05 18:11:37,808 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-05 18:11:37,808 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-05 18:11:37,808 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-05 18:11:37,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-05 18:11:37,857 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-05 18:11:37,861 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-05 18:11:37,862 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-05 18:11:37,863 INFO L276 PluginConnector]: CDTParser initialized [2018-04-05 18:11:37,864 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-05 18:11:38,211 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe0b1d39b7 [2018-04-05 18:11:38,338 INFO L287 CDTParser]: IsIndexed: true [2018-04-05 18:11:38,338 INFO L288 CDTParser]: Found 1 translation units. [2018-04-05 18:11:38,339 INFO L168 CDTParser]: Scanning test-bitfields-2.1_false-valid-free.i [2018-04-05 18:11:38,340 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-05 18:11:38,340 INFO L215 ultiparseSymbolTable]: [2018-04-05 18:11:38,340 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-05 18:11:38,341 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2.1_false-valid-free.i [2018-04-05 18:11:38,341 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-05 18:11:38,341 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-05 18:11:38,341 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-05 18:11:38,357 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGe0b1d39b7 [2018-04-05 18:11:38,362 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-05 18:11:38,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-05 18:11:38,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-05 18:11:38,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-05 18:11:38,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-05 18:11:38,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:11:38" (1/1) ... [2018-04-05 18:11:38,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5baefee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38, skipping insertion in model container [2018-04-05 18:11:38,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 06:11:38" (1/1) ... [2018-04-05 18:11:38,391 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 18:11:38,406 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-05 18:11:38,561 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 18:11:38,589 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-05 18:11:38,598 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-05 18:11:38,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38 WrapperNode [2018-04-05 18:11:38,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-05 18:11:38,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-05 18:11:38,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-05 18:11:38,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-05 18:11:38,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38" (1/1) ... [2018-04-05 18:11:38,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38" (1/1) ... [2018-04-05 18:11:38,632 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38" (1/1) ... [2018-04-05 18:11:38,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38" (1/1) ... [2018-04-05 18:11:38,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38" (1/1) ... [2018-04-05 18:11:38,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38" (1/1) ... [2018-04-05 18:11:38,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38" (1/1) ... [2018-04-05 18:11:38,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-05 18:11:38,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-05 18:11:38,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-05 18:11:38,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-05 18:11:38,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-05 18:11:38,710 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-05 18:11:38,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-05 18:11:38,711 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-05 18:11:38,711 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-05 18:11:38,711 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-05 18:11:38,711 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-05 18:11:38,711 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-05 18:11:38,711 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-05 18:11:38,711 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-05 18:11:38,711 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-05 18:11:38,712 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-05 18:11:38,712 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-05 18:11:38,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-05 18:11:38,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-05 18:11:38,712 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-05 18:11:38,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-05 18:11:39,065 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-05 18:11:39,114 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-05 18:11:39,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:11:39 BoogieIcfgContainer [2018-04-05 18:11:39,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-05 18:11:39,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-05 18:11:39,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-05 18:11:39,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-05 18:11:39,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 06:11:38" (1/3) ... [2018-04-05 18:11:39,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f86efa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:11:39, skipping insertion in model container [2018-04-05 18:11:39,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 06:11:38" (2/3) ... [2018-04-05 18:11:39,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f86efa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 06:11:39, skipping insertion in model container [2018-04-05 18:11:39,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 06:11:39" (3/3) ... [2018-04-05 18:11:39,122 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2.1_false-valid-free.i [2018-04-05 18:11:39,131 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-05 18:11:39,138 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-04-05 18:11:39,180 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-05 18:11:39,181 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-05 18:11:39,181 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-05 18:11:39,181 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-05 18:11:39,182 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-05 18:11:39,182 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-05 18:11:39,182 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-05 18:11:39,182 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-05 18:11:39,182 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-05 18:11:39,183 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-05 18:11:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-04-05 18:11:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-05 18:11:39,204 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:11:39,205 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-05 18:11:39,205 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-05 18:11:39,209 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-05 18:11:39,220 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:11:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:11:39,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:11:39,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:11:39,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:39,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:39,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 18:11:39,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-05 18:11:39,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:39,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-05 18:11:39,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-05 18:11:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:39,379 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:11:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:39,447 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:11:39,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-05 18:11:39,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-05 18:11:39,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-05 18:11:39,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-05 18:11:39,468 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-04-05 18:11:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:11:39,599 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2018-04-05 18:11:39,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-05 18:11:39,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-04-05 18:11:39,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:11:39,616 INFO L225 Difference]: With dead ends: 143 [2018-04-05 18:11:39,617 INFO L226 Difference]: Without dead ends: 134 [2018-04-05 18:11:39,619 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-05 18:11:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-05 18:11:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-04-05 18:11:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-05 18:11:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-04-05 18:11:39,657 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 21 [2018-04-05 18:11:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:11:39,658 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-04-05 18:11:39,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-05 18:11:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-04-05 18:11:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-05 18:11:39,659 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:11:39,659 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-05 18:11:39,659 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-05 18:11:39,660 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-05 18:11:39,666 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:11:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:11:39,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:11:39,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:11:39,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:39,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:11:39,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:39,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:39,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-05 18:11:39,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:39,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:39,813 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-05 18:11:39,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:39,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:39,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:39,827 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-05 18:11:39,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:39,834 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-05 18:11:39,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-05 18:11:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:39,852 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:11:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:40,034 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:11:40,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-05 18:11:40,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 18:11:40,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 18:11:40,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-05 18:11:40,036 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 6 states. [2018-04-05 18:11:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:11:40,197 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-05 18:11:40,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 18:11:40,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-05 18:11:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:11:40,199 INFO L225 Difference]: With dead ends: 134 [2018-04-05 18:11:40,199 INFO L226 Difference]: Without dead ends: 128 [2018-04-05 18:11:40,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-05 18:11:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-05 18:11:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2018-04-05 18:11:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-05 18:11:40,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2018-04-05 18:11:40,208 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 21 [2018-04-05 18:11:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:11:40,208 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-04-05 18:11:40,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 18:11:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2018-04-05 18:11:40,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-05 18:11:40,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:11:40,209 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-05 18:11:40,210 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-05 18:11:40,210 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-05 18:11:40,222 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:11:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:11:40,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:11:40,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:11:40,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:40,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:40,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-05 18:11:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:40,281 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:11:40,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:40,321 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:11:40,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-05 18:11:40,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-05 18:11:40,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-05 18:11:40,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-05 18:11:40,323 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand 4 states. [2018-04-05 18:11:40,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:11:40,462 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2018-04-05 18:11:40,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-05 18:11:40,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-05 18:11:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:11:40,464 INFO L225 Difference]: With dead ends: 133 [2018-04-05 18:11:40,465 INFO L226 Difference]: Without dead ends: 123 [2018-04-05 18:11:40,465 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-05 18:11:40,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-05 18:11:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2018-04-05 18:11:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-05 18:11:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2018-04-05 18:11:40,474 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 26 [2018-04-05 18:11:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:11:40,475 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2018-04-05 18:11:40,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-05 18:11:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2018-04-05 18:11:40,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-05 18:11:40,476 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:11:40,476 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-05 18:11:40,476 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-05 18:11:40,477 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-05 18:11:40,483 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:11:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:11:40,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:11:40,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:11:40,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:40,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:40,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 18:11:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:40,533 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:11:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:40,576 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:11:40,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-05 18:11:40,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 18:11:40,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 18:11:40,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-05 18:11:40,577 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand 6 states. [2018-04-05 18:11:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:11:40,655 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-04-05 18:11:40,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-05 18:11:40,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-05 18:11:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:11:40,656 INFO L225 Difference]: With dead ends: 89 [2018-04-05 18:11:40,657 INFO L226 Difference]: Without dead ends: 79 [2018-04-05 18:11:40,657 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-05 18:11:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-05 18:11:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-04-05 18:11:40,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-05 18:11:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-04-05 18:11:40,664 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 26 [2018-04-05 18:11:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:11:40,665 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-04-05 18:11:40,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 18:11:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-04-05 18:11:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-05 18:11:40,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:11:40,666 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-05 18:11:40,667 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-05 18:11:40,667 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-05 18:11:40,674 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:11:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:11:40,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:11:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:40,709 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:11:40,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:40,765 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-05 18:11:40,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-05 18:11:40,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-05 18:11:40,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-05 18:11:40,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-05 18:11:40,767 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-04-05 18:11:40,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:11:40,806 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-04-05 18:11:40,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-05 18:11:40,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-04-05 18:11:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:11:40,808 INFO L225 Difference]: With dead ends: 130 [2018-04-05 18:11:40,808 INFO L226 Difference]: Without dead ends: 83 [2018-04-05 18:11:40,808 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-05 18:11:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-05 18:11:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-05 18:11:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-05 18:11:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-04-05 18:11:40,817 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 42 [2018-04-05 18:11:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:11:40,817 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-04-05 18:11:40,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-05 18:11:40,817 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-04-05 18:11:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-05 18:11:40,819 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:11:40,819 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-05 18:11:40,819 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-05 18:11:40,819 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-05 18:11:40,832 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:11:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:11:40,856 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:11:40,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:40,874 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:11:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-05 18:11:40,950 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 18:11:40,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-05 18:11:40,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-05 18:11:40,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-05 18:11:40,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-04-05 18:11:40,952 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 10 states. [2018-04-05 18:11:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:11:41,002 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-04-05 18:11:41,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-05 18:11:41,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2018-04-05 18:11:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:11:41,004 INFO L225 Difference]: With dead ends: 136 [2018-04-05 18:11:41,004 INFO L226 Difference]: Without dead ends: 89 [2018-04-05 18:11:41,005 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-05 18:11:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-05 18:11:41,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-04-05 18:11:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-05 18:11:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-04-05 18:11:41,014 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 48 [2018-04-05 18:11:41,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:11:41,014 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-04-05 18:11:41,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-05 18:11:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-04-05 18:11:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-05 18:11:41,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:11:41,016 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-05 18:11:41,017 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-05 18:11:41,017 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-05 18:11:41,033 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:11:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:11:41,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:11:41,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-05 18:11:41,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-05 18:11:41,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-05 18:11:41,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-05 18:11:41,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-05 18:11:41,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-05 18:11:41,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-05 18:11:41,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,189 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-05 18:11:41,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-05 18:11:41,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-05 18:11:41,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,251 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-05 18:11:41,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-04-05 18:11:41,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-05 18:11:41,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,351 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-05 18:11:41,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-04-05 18:11:41,412 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-05 18:11:41,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,420 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,422 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:41,427 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-05 18:11:41,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:41,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-04-05 18:11:42,134 WARN L151 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 98 DAG size of output 37 [2018-04-05 18:11:42,160 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-05 18:11:42,165 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-05 18:11:42,169 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,170 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-05 18:11:42,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,181 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-05 18:11:42,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,191 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,195 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-05 18:11:42,196 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:42,210 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:42,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:42,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:42,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:42,277 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-05 18:11:42,277 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:204, output treesize:92 [2018-04-05 18:11:42,313 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-05 18:11:42,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,331 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-05 18:11:42,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:42,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,365 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-05 18:11:42,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:42,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,432 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:11:42,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,435 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:42,440 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-05 18:11:42,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:42,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:42,458 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-05 18:11:42,458 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:99, output treesize:3 [2018-04-05 18:11:42,488 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-05 18:11:42,488 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:11:43,461 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-05 18:11:43,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:43,462 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-05 18:11:43,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:269, output treesize:1 [2018-04-05 18:11:43,486 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-05 18:11:43,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-05 18:11:43,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2018-04-05 18:11:43,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-05 18:11:43,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-05 18:11:43,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1064, Unknown=0, NotChecked=0, Total=1260 [2018-04-05 18:11:43,509 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 36 states. [2018-04-05 18:11:44,940 WARN L151 SmtUtils]: Spent 326ms on a formula simplification. DAG size of input: 125 DAG size of output 113 [2018-04-05 18:11:45,277 WARN L151 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 97 DAG size of output 92 [2018-04-05 18:11:45,586 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 98 DAG size of output 86 [2018-04-05 18:11:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-05 18:11:46,879 INFO L93 Difference]: Finished difference Result 225 states and 241 transitions. [2018-04-05 18:11:46,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-05 18:11:46,880 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-04-05 18:11:46,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-05 18:11:46,883 INFO L225 Difference]: With dead ends: 225 [2018-04-05 18:11:46,883 INFO L226 Difference]: Without dead ends: 187 [2018-04-05 18:11:46,885 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-05 18:11:46,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-05 18:11:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 106. [2018-04-05 18:11:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-05 18:11:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2018-04-05 18:11:46,898 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 54 [2018-04-05 18:11:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-05 18:11:46,899 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2018-04-05 18:11:46,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-05 18:11:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2018-04-05 18:11:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-05 18:11:46,901 INFO L347 BasicCegarLoop]: Found error trace [2018-04-05 18:11:46,901 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-05 18:11:46,901 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-05 18:11:46,902 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-05 18:11:46,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-05 18:11:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-05 18:11:46,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-05 18:11:46,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-05 18:11:46,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:46,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:46,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-05 18:11:46,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:46,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:46,968 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-05 18:11:46,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:46,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:46,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-05 18:11:46,996 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-05 18:11:46,998 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-05 18:11:46,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:46,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-05 18:11:47,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, 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-05 18:11:47,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,021 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-05 18:11:47,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-05 18:11:47,051 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-05 18:11:47,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,057 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-05 18:11:47,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-05 18:11:47,101 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-05 18:11:47,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,117 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,123 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-05 18:11:47,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-05 18:11:47,199 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-05 18:11:47,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:47,210 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-05 18:11:47,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:47,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-04-05 18:11:49,673 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 112 DAG size of output 53 [2018-04-05 18:11:49,683 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-05 18:11:49,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-04-05 18:11:49,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,692 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-05 18:11:49,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,703 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-05 18:11:49,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,727 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-05 18:11:49,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:49,747 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:49,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:49,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:49,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:49,821 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-05 18:11:49,821 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:232, output treesize:112 [2018-04-05 18:11:49,890 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-05 18:11:49,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,899 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:11:49,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,909 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-05 18:11:49,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:49,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-05 18:11:49,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-05 18:11:49,936 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-05 18:11:49,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-05 18:11:49,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-05 18:11:49,953 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-05 18:11:49,976 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:121, output treesize:3 [2018-04-05 18:11:50,029 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-05 18:11:50,029 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-05 18:13:34,401 WARN L148 SmtUtils]: Spent 2048ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-05 18:14:15,789 WARN L148 SmtUtils]: Spent 2063ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-05 18:14:56,562 WARN L148 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 88 [2018-04-05 18:15:51,184 WARN L148 SmtUtils]: Spent 2144ms on a formula simplification that was a NOOP. DAG size: 94 Received shutdown request... [2018-04-05 18:16:24,844 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-05 18:16:24,845 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-05 18:16:24,849 WARN L197 ceAbstractionStarter]: Timeout [2018-04-05 18:16:24,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 06:16:24 BoogieIcfgContainer [2018-04-05 18:16:24,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-05 18:16:24,850 INFO L168 Benchmark]: Toolchain (without parser) took 286487.45 ms. Allocated memory was 305.7 MB in the beginning and 580.9 MB in the end (delta: 275.3 MB). Free memory was 248.8 MB in the beginning and 351.0 MB in the end (delta: -102.2 MB). Peak memory consumption was 173.0 MB. Max. memory is 5.3 GB. [2018-04-05 18:16:24,851 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 305.7 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-05 18:16:24,851 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.47 ms. Allocated memory is still 305.7 MB. Free memory was 248.8 MB in the beginning and 237.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-04-05 18:16:24,851 INFO L168 Benchmark]: Boogie Preprocessor took 39.55 ms. Allocated memory is still 305.7 MB. Free memory was 237.8 MB in the beginning and 235.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 5.3 GB. [2018-04-05 18:16:24,851 INFO L168 Benchmark]: RCFGBuilder took 462.25 ms. Allocated memory was 305.7 MB in the beginning and 465.0 MB in the end (delta: 159.4 MB). Free memory was 235.4 MB in the beginning and 421.3 MB in the end (delta: -185.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. [2018-04-05 18:16:24,852 INFO L168 Benchmark]: TraceAbstraction took 285733.59 ms. Allocated memory was 465.0 MB in the beginning and 580.9 MB in the end (delta: 115.9 MB). Free memory was 421.3 MB in the beginning and 351.0 MB in the end (delta: 70.2 MB). Peak memory consumption was 186.1 MB. Max. memory is 5.3 GB. [2018-04-05 18:16:24,854 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.19 ms. Allocated memory is still 305.7 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 247.47 ms. Allocated memory is still 305.7 MB. Free memory was 248.8 MB in the beginning and 237.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.55 ms. Allocated memory is still 305.7 MB. Free memory was 237.8 MB in the beginning and 235.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 462.25 ms. Allocated memory was 305.7 MB in the beginning and 465.0 MB in the end (delta: 159.4 MB). Free memory was 235.4 MB in the beginning and 421.3 MB in the end (delta: -185.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 285733.59 ms. Allocated memory was 465.0 MB in the beginning and 580.9 MB in the end (delta: 115.9 MB). Free memory was 421.3 MB in the beginning and 351.0 MB in the end (delta: 70.2 MB). Peak memory consumption was 186.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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 33 error locations. TIMEOUT Result, 285.6s 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.0s 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-05_18-16-24-864.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-05_18-16-24-864.csv Completed graceful shutdown