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_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-4cf2d92 [2018-03-28 13:19:01,788 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-28 13:19:01,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-28 13:19:01,805 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-28 13:19:01,806 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-28 13:19:01,807 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-28 13:19:01,808 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-28 13:19:01,810 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-28 13:19:01,812 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-28 13:19:01,813 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-28 13:19:01,814 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-28 13:19:01,815 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-28 13:19:01,816 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-28 13:19:01,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-28 13:19:01,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-28 13:19:01,820 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-28 13:19:01,823 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-28 13:19:01,824 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-28 13:19:01,826 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-28 13:19:01,827 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-28 13:19:01,829 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-28 13:19:01,830 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-28 13:19:01,830 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-28 13:19:01,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-28 13:19:01,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-28 13:19:01,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-28 13:19:01,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-28 13:19:01,835 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-28 13:19:01,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-28 13:19:01,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-28 13:19:01,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-28 13:19:01,837 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-03-28 13:19:01,862 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-28 13:19:01,863 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-28 13:19:01,863 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-03-28 13:19:01,863 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-03-28 13:19:01,864 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-28 13:19:01,864 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-28 13:19:01,864 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-28 13:19:01,864 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-28 13:19:01,865 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-28 13:19:01,865 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-03-28 13:19:01,865 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-03-28 13:19:01,866 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-28 13:19:01,866 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-28 13:19:01,866 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-28 13:19:01,866 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-28 13:19:01,866 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-28 13:19:01,866 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-28 13:19:01,867 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-28 13:19:01,867 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-28 13:19:01,867 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-28 13:19:01,867 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-28 13:19:01,867 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-28 13:19:01,868 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-28 13:19:01,868 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-28 13:19:01,868 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-28 13:19:01,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-28 13:19:01,868 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-28 13:19:01,869 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-28 13:19:01,869 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-28 13:19:01,869 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-28 13:19:01,869 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-28 13:19:01,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:19:01,869 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-28 13:19:01,870 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-28 13:19:01,871 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-28 13:19:01,871 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-03-28 13:19:01,871 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-03-28 13:19:01,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-28 13:19:01,918 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-28 13:19:01,922 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-28 13:19:01,924 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-28 13:19:01,924 INFO L276 PluginConnector]: CDTParser initialized [2018-03-28 13:19:01,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety-bitfields/test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-28 13:19:02,260 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc8f110f12 [2018-03-28 13:19:02,380 INFO L291 CDTParser]: IsIndexed: true [2018-03-28 13:19:02,380 INFO L292 CDTParser]: Found 1 translation units. [2018-03-28 13:19:02,381 INFO L171 CDTParser]: Scanning test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-28 13:19:02,382 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-28 13:19:02,382 INFO L215 ultiparseSymbolTable]: [2018-03-28 13:19:02,382 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-28 13:19:02,382 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-28 13:19:02,382 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-28 13:19:02,383 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__size_t in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-28 13:19:02,383 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest_bitfields___true_valid_memsafety_true_termination_i__d in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-28 13:19:02,399 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGc8f110f12 [2018-03-28 13:19:02,404 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-28 13:19:02,407 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-28 13:19:02,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-28 13:19:02,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-28 13:19:02,416 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-28 13:19:02,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 01:19:02" (1/1) ... [2018-03-28 13:19:02,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110f3aae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02, skipping insertion in model container [2018-03-28 13:19:02,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 01:19:02" (1/1) ... [2018-03-28 13:19:02,435 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 13:19:02,448 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-28 13:19:02,591 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 13:19:02,614 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-28 13:19:02,619 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-03-28 13:19:02,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02 WrapperNode [2018-03-28 13:19:02,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-28 13:19:02,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-28 13:19:02,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-28 13:19:02,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-28 13:19:02,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02" (1/1) ... [2018-03-28 13:19:02,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02" (1/1) ... [2018-03-28 13:19:02,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02" (1/1) ... [2018-03-28 13:19:02,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02" (1/1) ... [2018-03-28 13:19:02,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02" (1/1) ... [2018-03-28 13:19:02,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02" (1/1) ... [2018-03-28 13:19:02,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02" (1/1) ... [2018-03-28 13:19:02,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-28 13:19:02,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-28 13:19:02,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-28 13:19:02,669 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-28 13:19:02,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-28 13:19:02,723 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-28 13:19:02,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-28 13:19:02,724 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-28 13:19:02,724 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-03-28 13:19:02,724 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-03-28 13:19:02,724 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-03-28 13:19:02,724 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-03-28 13:19:02,724 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-28 13:19:02,725 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-28 13:19:02,725 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-03-28 13:19:02,725 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-28 13:19:02,725 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-28 13:19:02,725 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-28 13:19:02,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-28 13:19:02,726 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-28 13:19:02,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-28 13:19:03,128 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-03-28 13:19:03,166 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-28 13:19:03,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 01:19:03 BoogieIcfgContainer [2018-03-28 13:19:03,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-28 13:19:03,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-28 13:19:03,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-28 13:19:03,170 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-28 13:19:03,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 01:19:02" (1/3) ... [2018-03-28 13:19:03,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263a1b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 01:19:03, skipping insertion in model container [2018-03-28 13:19:03,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 01:19:02" (2/3) ... [2018-03-28 13:19:03,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263a1b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 01:19:03, skipping insertion in model container [2018-03-28 13:19:03,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 01:19:03" (3/3) ... [2018-03-28 13:19:03,173 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_true-valid-memsafety_true-termination.i [2018-03-28 13:19:03,179 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-28 13:19:03,188 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-03-28 13:19:03,234 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-28 13:19:03,235 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-28 13:19:03,235 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-28 13:19:03,235 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-28 13:19:03,235 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-28 13:19:03,235 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-28 13:19:03,236 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-28 13:19:03,236 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-28 13:19:03,236 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-28 13:19:03,236 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-28 13:19:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-03-28 13:19:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-28 13:19:03,255 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:19:03,256 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:19:03,256 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-28 13:19:03,259 INFO L82 PathProgramCache]: Analyzing trace with hash -506314848, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:19:03,270 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:19:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:19:03,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:19:03,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:19:03,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:03,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:03,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 13:19:03,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-03-28 13:19:03,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:03,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-28 13:19:03,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-03-28 13:19:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:03,437 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:19:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:03,518 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:19:03,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-03-28 13:19:03,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-28 13:19:03,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-28 13:19:03,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 13:19:03,540 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-03-28 13:19:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:19:03,695 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-03-28 13:19:03,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-28 13:19:03,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-03-28 13:19:03,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:19:03,712 INFO L225 Difference]: With dead ends: 160 [2018-03-28 13:19:03,712 INFO L226 Difference]: Without dead ends: 151 [2018-03-28 13:19:03,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-28 13:19:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-03-28 13:19:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2018-03-28 13:19:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-28 13:19:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-03-28 13:19:03,757 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2018-03-28 13:19:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:19:03,757 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-03-28 13:19:03,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-28 13:19:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-03-28 13:19:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-03-28 13:19:03,758 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:19:03,759 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-28 13:19:03,759 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-28 13:19:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash -506314847, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:19:03,767 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:19:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:19:03,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:19:03,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:19:03,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:03,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:19:03,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:03,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:03,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-03-28 13:19:03,885 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:03,886 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:03,888 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-03-28 13:19:03,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:03,900 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:03,901 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:03,902 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-03-28 13:19:03,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:03,909 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-03-28 13:19:03,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-03-28 13:19:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:03,925 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:19:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:04,107 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:19:04,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 13:19:04,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 13:19:04,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 13:19:04,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-28 13:19:04,110 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 6 states. [2018-03-28 13:19:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:19:04,322 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-03-28 13:19:04,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 13:19:04,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-03-28 13:19:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:19:04,325 INFO L225 Difference]: With dead ends: 151 [2018-03-28 13:19:04,325 INFO L226 Difference]: Without dead ends: 145 [2018-03-28 13:19:04,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-03-28 13:19:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-03-28 13:19:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-03-28 13:19:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-03-28 13:19:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-03-28 13:19:04,334 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 16 [2018-03-28 13:19:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:19:04,335 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-03-28 13:19:04,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 13:19:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-03-28 13:19:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-28 13:19:04,336 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:19:04,336 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-03-28 13:19:04,336 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-28 13:19:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash 51854364, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:19:04,342 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:19:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:19:04,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:19:04,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:19:04,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:04,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:04,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-28 13:19:04,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-03-28 13:19:04,379 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:19:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:04,455 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:19:04,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-03-28 13:19:04,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 13:19:04,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 13:19:04,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-03-28 13:19:04,456 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2018-03-28 13:19:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:19:04,580 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-03-28 13:19:04,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-28 13:19:04,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-28 13:19:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:19:04,581 INFO L225 Difference]: With dead ends: 96 [2018-03-28 13:19:04,581 INFO L226 Difference]: Without dead ends: 72 [2018-03-28 13:19:04,581 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-03-28 13:19:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-03-28 13:19:04,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-03-28 13:19:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-03-28 13:19:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-03-28 13:19:04,586 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 21 [2018-03-28 13:19:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:19:04,587 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-03-28 13:19:04,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 13:19:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-03-28 13:19:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-28 13:19:04,587 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:19:04,587 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-03-28 13:19:04,588 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-28 13:19:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash 51854362, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:19:04,594 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:19:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:19:04,609 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:19:04,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-28 13:19:04,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:04,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:04,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-03-28 13:19:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:04,625 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:19:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:04,652 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:19:04,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-03-28 13:19:04,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-28 13:19:04,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-28 13:19:04,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-03-28 13:19:04,653 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 4 states. [2018-03-28 13:19:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:19:04,745 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-03-28 13:19:04,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-28 13:19:04,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-03-28 13:19:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:19:04,747 INFO L225 Difference]: With dead ends: 103 [2018-03-28 13:19:04,747 INFO L226 Difference]: Without dead ends: 93 [2018-03-28 13:19:04,747 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-03-28 13:19:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-03-28 13:19:04,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2018-03-28 13:19:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-03-28 13:19:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-03-28 13:19:04,754 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 21 [2018-03-28 13:19:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:19:04,754 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-03-28 13:19:04,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-28 13:19:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-03-28 13:19:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-03-28 13:19:04,755 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:19:04,756 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] [2018-03-28 13:19:04,756 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-28 13:19:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2075956322, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:19:04,764 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:19:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:19:04,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:19:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:04,806 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:19:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:04,871 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-03-28 13:19:04,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-03-28 13:19:04,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-28 13:19:04,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-28 13:19:04,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-03-28 13:19:04,872 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-03-28 13:19:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:19:04,903 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-03-28 13:19:04,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-28 13:19:04,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-03-28 13:19:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:19:04,904 INFO L225 Difference]: With dead ends: 117 [2018-03-28 13:19:04,905 INFO L226 Difference]: Without dead ends: 74 [2018-03-28 13:19:04,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-03-28 13:19:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-03-28 13:19:04,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-03-28 13:19:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-03-28 13:19:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-03-28 13:19:04,913 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 37 [2018-03-28 13:19:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:19:04,914 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-03-28 13:19:04,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-28 13:19:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-03-28 13:19:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-03-28 13:19:04,915 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:19:04,915 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] [2018-03-28 13:19:04,915 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-28 13:19:04,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1900445346, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:19:04,928 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:19:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:19:04,951 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:19:04,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:04,983 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:19:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:05,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 13:19:05,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-03-28 13:19:05,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-03-28 13:19:05,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-03-28 13:19:05,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-03-28 13:19:05,077 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 10 states. [2018-03-28 13:19:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-28 13:19:05,138 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-03-28 13:19:05,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-03-28 13:19:05,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-03-28 13:19:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-28 13:19:05,139 INFO L225 Difference]: With dead ends: 123 [2018-03-28 13:19:05,140 INFO L226 Difference]: Without dead ends: 80 [2018-03-28 13:19:05,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 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-03-28 13:19:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-03-28 13:19:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-03-28 13:19:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-03-28 13:19:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-03-28 13:19:05,145 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 43 [2018-03-28 13:19:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-28 13:19:05,146 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-03-28 13:19:05,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-03-28 13:19:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-03-28 13:19:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-03-28 13:19:05,146 INFO L347 BasicCegarLoop]: Found error trace [2018-03-28 13:19:05,147 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] [2018-03-28 13:19:05,147 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr29AssertViolationMEMORY_FREE, mainErr25AssertViolationMEMORY_FREE, mainErr21AssertViolationMEMORY_FREE, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr17AssertViolationMEMORY_FREE, mainErr31RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr24AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr36EnsuresViolationMEMORY_LEAK, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr20AssertViolationMEMORY_FREE, mainErr28AssertViolationMEMORY_FREE, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr4RequiresViolation, mainErr16AssertViolationMEMORY_FREE, mainErr14RequiresViolation, mainErr32AssertViolationMEMORY_FREE]=== [2018-03-28 13:19:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash 130529506, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-28 13:19:05,155 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-03-28 13:19:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-28 13:19:05,187 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-28 13:19:05,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-03-28 13:19:05,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-03-28 13:19:05,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-03-28 13:19:05,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-03-28 13:19:05,227 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,228 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-03-28 13:19:05,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-03-28 13:19:05,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-03-28 13:19:05,256 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,257 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,260 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,260 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,261 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,262 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,262 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-03-28 13:19:05,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-03-28 13:19:05,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-03-28 13:19:05,301 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,302 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,303 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,303 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,304 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,305 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,306 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,306 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,307 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,308 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,308 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,309 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,310 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-03-28 13:19:05,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-03-28 13:19:05,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-03-28 13:19:05,362 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,363 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,363 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,364 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,365 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,365 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,366 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,367 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,367 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,368 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,369 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,369 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,370 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,382 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,388 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,390 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,391 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,392 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,392 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,395 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,397 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-03-28 13:19:05,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-03-28 13:19:05,484 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-03-28 13:19:05,487 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,488 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,489 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,489 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,490 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,490 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,491 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,491 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,492 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,493 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,493 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,494 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,494 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,495 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,495 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,496 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,497 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,497 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,498 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,499 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:05,500 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-03-28 13:19:05,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:05,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-03-28 13:19:06,286 WARN L151 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 103 DAG size of output 42 [2018-03-28 13:19:06,315 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-03-28 13:19:06,321 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-03-28 13:19:06,327 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,328 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,329 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-03-28 13:19:06,335 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,337 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 76 [2018-03-28 13:19:06,363 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,364 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,364 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,365 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,366 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 105 [2018-03-28 13:19:06,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:06,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:06,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:06,424 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:06,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:06,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-03-28 13:19:06,521 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:212, output treesize:100 [2018-03-28 13:19:06,575 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-03-28 13:19:06,584 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,585 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,586 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:19:06,587 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,589 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,592 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,594 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,596 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,597 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:19:06,598 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,604 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,608 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,609 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,615 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,615 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:19:06,616 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,617 INFO L682 Elim1Store]: detected equality via solver [2018-03-28 13:19:06,646 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,647 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,648 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,648 INFO L700 Elim1Store]: detected not equals via solver [2018-03-28 13:19:06,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 26 disjoint index pairs (out of 55 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 180 [2018-03-28 13:19:06,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 12 xjuncts. [2018-03-28 13:19:06,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:06,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:06,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:107, output treesize:7 [2018-03-28 13:19:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:06,856 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-03-28 13:19:12,085 WARN L148 SmtUtils]: Spent 1267ms on a formula simplification that was a NOOP. DAG size: 77 [2018-03-28 13:19:29,925 WARN L148 SmtUtils]: Spent 2055ms on a formula simplification that was a NOOP. DAG size: 89 [2018-03-28 13:19:40,435 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-03-28 13:19:40,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-28 13:19:40,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-03-28 13:19:40,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:277, output treesize:1 [2018-03-28 13:19:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-28 13:19:40,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-28 13:19:40,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2018-03-28 13:19:40,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-03-28 13:19:40,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-03-28 13:19:40,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1041, Unknown=21, NotChecked=0, Total=1260 [2018-03-28 13:19:40,484 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 36 states. [2018-03-28 13:20:09,473 WARN L151 SmtUtils]: Spent 25572ms on a formula simplification. DAG size of input: 169 DAG size of output 148 [2018-03-28 13:20:26,697 WARN L151 SmtUtils]: Spent 1772ms on a formula simplification. DAG size of input: 121 DAG size of output 111 [2018-03-28 13:20:52,553 WARN L148 SmtUtils]: Spent 13128ms on a formula simplification that was a NOOP. DAG size: 110 [2018-03-28 13:21:29,498 WARN L151 SmtUtils]: Spent 25947ms on a formula simplification. DAG size of input: 124 DAG size of output 116 [2018-03-28 13:21:38,663 WARN L148 SmtUtils]: Spent 403ms on a formula simplification that was a NOOP. DAG size: 84 [2018-03-28 13:21:43,273 WARN L148 SmtUtils]: Spent 585ms on a formula simplification that was a NOOP. DAG size: 78 [2018-03-28 13:21:48,259 WARN L148 SmtUtils]: Spent 269ms on a formula simplification that was a NOOP. DAG size: 123 Received shutdown request... [2018-03-28 13:21:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-03-28 13:21:49,657 WARN L519 AbstractCegarLoop]: Verification canceled [2018-03-28 13:21:49,661 WARN L197 ceAbstractionStarter]: Timeout [2018-03-28 13:21:49,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 01:21:49 BoogieIcfgContainer [2018-03-28 13:21:49,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-28 13:21:49,662 INFO L168 Benchmark]: Toolchain (without parser) took 167258.01 ms. Allocated memory was 300.4 MB in the beginning and 522.2 MB in the end (delta: 221.8 MB). Free memory was 243.2 MB in the beginning and 454.0 MB in the end (delta: -210.7 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-03-28 13:21:49,664 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 300.4 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-28 13:21:49,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.32 ms. Allocated memory is still 300.4 MB. Free memory was 243.2 MB in the beginning and 232.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-03-28 13:21:49,665 INFO L168 Benchmark]: Boogie Preprocessor took 36.59 ms. Allocated memory is still 300.4 MB. Free memory was 232.1 MB in the beginning and 231.1 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. [2018-03-28 13:21:49,665 INFO L168 Benchmark]: RCFGBuilder took 497.87 ms. Allocated memory was 300.4 MB in the beginning and 456.7 MB in the end (delta: 156.2 MB). Free memory was 231.1 MB in the beginning and 415.0 MB in the end (delta: -183.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-03-28 13:21:49,666 INFO L168 Benchmark]: TraceAbstraction took 166494.25 ms. Allocated memory was 456.7 MB in the beginning and 522.2 MB in the end (delta: 65.5 MB). Free memory was 413.6 MB in the beginning and 454.0 MB in the end (delta: -40.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-03-28 13:21:49,668 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.23 ms. Allocated memory is still 300.4 MB. Free memory is still 262.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.32 ms. Allocated memory is still 300.4 MB. Free memory was 243.2 MB in the beginning and 232.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.59 ms. Allocated memory is still 300.4 MB. Free memory was 232.1 MB in the beginning and 231.1 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 5.3 GB. * RCFGBuilder took 497.87 ms. Allocated memory was 300.4 MB in the beginning and 456.7 MB in the end (delta: 156.2 MB). Free memory was 231.1 MB in the beginning and 415.0 MB in the end (delta: -183.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 166494.25 ms. Allocated memory was 456.7 MB in the beginning and 522.2 MB in the end (delta: 65.5 MB). Free memory was 413.6 MB in the beginning and 454.0 MB in the end (delta: -40.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 22). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and interpolant automaton (currently 32 states, 36 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 56 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 37 error locations. TIMEOUT Result, 166.4s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 129.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 377 SDtfs, 802 SDslu, 633 SDs, 0 SdLazy, 865 SolverSat, 167 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 27.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 335 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 135.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 121 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 35.9s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 392 ConstructedInterpolants, 45 QuantifiedInterpolants, 447368 SizeOfPredicates, 23 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 72 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_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-28_13-21-49-679.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-bitfields-2_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-28_13-21-49-679.csv Completed graceful shutdown