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-8168ed2-m [2018-04-11 23:21:00,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 23:21:00,697 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 23:21:00,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 23:21:00,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 23:21:00,713 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 23:21:00,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 23:21:00,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 23:21:00,718 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 23:21:00,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 23:21:00,720 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 23:21:00,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 23:21:00,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 23:21:00,723 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 23:21:00,723 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 23:21:00,726 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 23:21:00,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 23:21:00,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 23:21:00,731 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 23:21:00,732 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 23:21:00,734 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 23:21:00,734 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 23:21:00,735 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 23:21:00,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 23:21:00,736 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 23:21:00,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 23:21:00,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 23:21:00,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 23:21:00,739 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 23:21:00,739 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 23:21:00,740 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 23:21:00,740 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-11 23:21:00,764 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 23:21:00,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 23:21:00,765 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 23:21:00,765 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 23:21:00,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 23:21:00,766 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 23:21:00,766 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 23:21:00,766 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 23:21:00,766 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 23:21:00,766 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 23:21:00,767 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 23:21:00,767 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 23:21:00,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 23:21:00,767 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 23:21:00,768 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 23:21:00,768 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 23:21:00,768 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 23:21:00,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 23:21:00,768 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 23:21:00,769 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 23:21:00,769 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 23:21:00,769 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 23:21:00,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 23:21:00,769 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 23:21:00,770 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 23:21:00,770 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 23:21:00,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:21:00,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 23:21:00,770 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 23:21:00,771 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 23:21:00,771 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 23:21:00,771 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 23:21:00,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:21:00,771 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 23:21:00,772 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 23:21:00,772 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 23:21:00,773 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 23:21:00,773 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 23:21:00,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 23:21:00,819 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 23:21:00,823 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 23:21:00,825 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 23:21:00,825 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 23:21:00,826 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-04-11 23:21:01,152 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4d07cf789 [2018-04-11 23:21:01,273 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 23:21:01,273 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 23:21:01,274 INFO L168 CDTParser]: Scanning test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 23:21:01,275 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 23:21:01,275 INFO L215 ultiparseSymbolTable]: [2018-04-11 23:21:01,275 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 23:21:01,275 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 23:21:01,275 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 23:21:01,275 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-04-11 23:21:01,275 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-04-11 23:21:01,289 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG4d07cf789 [2018-04-11 23:21:01,294 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 23:21:01,296 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 23:21:01,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 23:21:01,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 23:21:01,302 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 23:21:01,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:21:01" (1/1) ... [2018-04-11 23:21:01,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fec0741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01, skipping insertion in model container [2018-04-11 23:21:01,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 11:21:01" (1/1) ... [2018-04-11 23:21:01,318 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:21:01,331 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 23:21:01,455 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:21:01,480 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 23:21:01,486 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 12 non ball SCCs. Number of states in SCCs 12. [2018-04-11 23:21:01,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01 WrapperNode [2018-04-11 23:21:01,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 23:21:01,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 23:21:01,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 23:21:01,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 23:21:01,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01" (1/1) ... [2018-04-11 23:21:01,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01" (1/1) ... [2018-04-11 23:21:01,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01" (1/1) ... [2018-04-11 23:21:01,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01" (1/1) ... [2018-04-11 23:21:01,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01" (1/1) ... [2018-04-11 23:21:01,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01" (1/1) ... [2018-04-11 23:21:01,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01" (1/1) ... [2018-04-11 23:21:01,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 23:21:01,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 23:21:01,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 23:21:01,541 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 23:21:01,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 23:21:01,602 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 23:21:01,602 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 23:21:01,603 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 23:21:01,603 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-04-11 23:21:01,603 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-04-11 23:21:01,603 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 23:21:01,603 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 23:21:01,603 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 23:21:01,603 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 23:21:01,604 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-04-11 23:21:01,604 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 23:21:01,604 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 23:21:01,604 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 23:21:01,604 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 23:21:01,604 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 23:21:01,605 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 23:21:01,995 WARN L446 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-04-11 23:21:02,021 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 23:21:02,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:21:02 BoogieIcfgContainer [2018-04-11 23:21:02,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 23:21:02,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 23:21:02,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 23:21:02,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 23:21:02,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 11:21:01" (1/3) ... [2018-04-11 23:21:02,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb564db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:21:02, skipping insertion in model container [2018-04-11 23:21:02,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 11:21:01" (2/3) ... [2018-04-11 23:21:02,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb564db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 11:21:02, skipping insertion in model container [2018-04-11 23:21:02,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 11:21:02" (3/3) ... [2018-04-11 23:21:02,028 INFO L107 eAbstractionObserver]: Analyzing ICFG test-bitfields-2_true-valid-memsafety_true-termination.i [2018-04-11 23:21:02,034 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 23:21:02,040 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-04-11 23:21:02,083 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 23:21:02,084 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 23:21:02,084 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 23:21:02,084 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 23:21:02,084 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 23:21:02,084 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 23:21:02,084 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 23:21:02,084 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 23:21:02,084 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 23:21:02,085 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 23:21:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-04-11 23:21:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 23:21:02,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:21:02,104 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:21:02,104 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-04-11 23:21:02,108 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-04-11 23:21:02,119 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:21:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:21:02,163 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:21:02,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:21:02,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:02,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:02,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:21:02,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 23:21:02,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:02,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:21:02,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 23:21:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:02,276 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:21:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:02,333 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:21:02,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-11 23:21:02,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 23:21:02,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 23:21:02,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 23:21:02,349 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-04-11 23:21:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:21:02,491 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2018-04-11 23:21:02,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 23:21:02,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-11 23:21:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:21:02,507 INFO L225 Difference]: With dead ends: 160 [2018-04-11 23:21:02,507 INFO L226 Difference]: Without dead ends: 151 [2018-04-11 23:21:02,511 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-04-11 23:21:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-11 23:21:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2018-04-11 23:21:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-11 23:21:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-04-11 23:21:02,555 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 16 [2018-04-11 23:21:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:21:02,556 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-04-11 23:21:02,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 23:21:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-04-11 23:21:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 23:21:02,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:21:02,557 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:21:02,557 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-04-11 23:21:02,557 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-04-11 23:21:02,567 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:21:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:21:02,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:21:02,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:21:02,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:02,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:21:02,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:02,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:02,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 23:21:02,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:02,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:02,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 23:21:02,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:02,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:02,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:02,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 23:21:02,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:02,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 23:21:02,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-04-11 23:21:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:02,713 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:21:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:02,901 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:21:02,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 23:21:02,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:21:02,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:21:02,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:21:02,903 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 6 states. [2018-04-11 23:21:03,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:21:03,141 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-04-11 23:21:03,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:21:03,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-11 23:21:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:21:03,143 INFO L225 Difference]: With dead ends: 151 [2018-04-11 23:21:03,143 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 23:21:03,144 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-04-11 23:21:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 23:21:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-04-11 23:21:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 23:21:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-11 23:21:03,152 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 16 [2018-04-11 23:21:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:21:03,152 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-11 23:21:03,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:21:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-11 23:21:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 23:21:03,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:21:03,153 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:21:03,153 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-04-11 23:21:03,153 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-04-11 23:21:03,160 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:21:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:21:03,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:21:03,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:21:03,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:03,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:03,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:21:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:03,196 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:21:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:03,265 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:21:03,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 23:21:03,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:21:03,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:21:03,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:21:03,267 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 6 states. [2018-04-11 23:21:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:21:03,367 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2018-04-11 23:21:03,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 23:21:03,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 23:21:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:21:03,369 INFO L225 Difference]: With dead ends: 96 [2018-04-11 23:21:03,369 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 23:21:03,369 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-04-11 23:21:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 23:21:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-11 23:21:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 23:21:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-11 23:21:03,377 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 21 [2018-04-11 23:21:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:21:03,377 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-11 23:21:03,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:21:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-11 23:21:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 23:21:03,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:21:03,378 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:21:03,379 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-04-11 23:21:03,379 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-04-11 23:21:03,402 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:21:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:21:03,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:21:03,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:21:03,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:03,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:03,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 23:21:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:03,435 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:21:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:03,459 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:21:03,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 23:21:03,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 23:21:03,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 23:21:03,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 23:21:03,460 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 4 states. [2018-04-11 23:21:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:21:03,569 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-04-11 23:21:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 23:21:03,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-11 23:21:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:21:03,571 INFO L225 Difference]: With dead ends: 103 [2018-04-11 23:21:03,571 INFO L226 Difference]: Without dead ends: 93 [2018-04-11 23:21:03,572 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-04-11 23:21:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-11 23:21:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 70. [2018-04-11 23:21:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 23:21:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-04-11 23:21:03,579 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 21 [2018-04-11 23:21:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:21:03,580 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-04-11 23:21:03,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 23:21:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-04-11 23:21:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 23:21:03,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:21:03,581 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-04-11 23:21:03,581 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-04-11 23:21:03,582 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-04-11 23:21:03,590 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:21:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:21:03,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:21:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:03,661 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:21:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:03,730 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 23:21:03,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-11 23:21:03,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 23:21:03,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 23:21:03,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 23:21:03,731 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-04-11 23:21:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:21:03,771 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-04-11 23:21:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 23:21:03,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-04-11 23:21:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:21:03,773 INFO L225 Difference]: With dead ends: 117 [2018-04-11 23:21:03,773 INFO L226 Difference]: Without dead ends: 74 [2018-04-11 23:21:03,773 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-04-11 23:21:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-04-11 23:21:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-04-11 23:21:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 23:21:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-04-11 23:21:03,779 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 37 [2018-04-11 23:21:03,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:21:03,779 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-04-11 23:21:03,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 23:21:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-04-11 23:21:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 23:21:03,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:21:03,780 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-04-11 23:21:03,780 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-04-11 23:21:03,780 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-04-11 23:21:03,788 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:21:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:21:03,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:21:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:03,853 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:21:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:03,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:21:03,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-04-11 23:21:03,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 23:21:03,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 23:21:03,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-04-11 23:21:03,928 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 10 states. [2018-04-11 23:21:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:21:03,971 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-04-11 23:21:03,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 23:21:03,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-04-11 23:21:03,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:21:03,973 INFO L225 Difference]: With dead ends: 123 [2018-04-11 23:21:03,973 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 23:21:03,974 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-04-11 23:21:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 23:21:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-11 23:21:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 23:21:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-04-11 23:21:03,980 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 43 [2018-04-11 23:21:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:21:03,981 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-04-11 23:21:03,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 23:21:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-04-11 23:21:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 23:21:03,982 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:21:03,982 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-04-11 23:21:03,983 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-04-11 23:21:03,983 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-04-11 23:21:03,990 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:21:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:21:04,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:21:04,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 23:21:04,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 23:21:04,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-11 23:21:04,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 23:21:04,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-04-11 23:21:04,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 23:21:04,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-11 23:21:04,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-04-11 23:21:04,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 23:21:04,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-11 23:21:04,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-04-11 23:21:04,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-04-11 23:21:04,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-11 23:21:04,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-04-11 23:21:04,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-04-11 23:21:04,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-04-11 23:21:04,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 20 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 73 [2018-04-11 23:21:04,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:04,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-04-11 23:21:04,937 WARN L151 SmtUtils]: Spent 254ms on a formula simplification. DAG size of input: 103 DAG size of output 42 [2018-04-11 23:21:04,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 74 [2018-04-11 23:21:04,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 81 [2018-04-11 23:21:04,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2018-04-11 23:21:04,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,990 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-04-11 23:21:04,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:04,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,004 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,010 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-04-11 23:21:05,010 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:05,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:05,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:05,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:05,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:05,129 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-04-11 23:21:05,129 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:212, output treesize:100 [2018-04-11 23:21:05,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 73 [2018-04-11 23:21:05,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,221 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:21:05,222 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,240 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:21:05,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,252 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:21:05,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,253 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:21:05,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:21:05,300 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-04-11 23:21:05,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 12 xjuncts. [2018-04-11 23:21:05,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:05,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-04-11 23:21:05,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:107, output treesize:7 [2018-04-11 23:21:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:05,473 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:21:11,269 WARN L148 SmtUtils]: Spent 1728ms on a formula simplification that was a NOOP. DAG size: 77 [2018-04-11 23:21:19,276 WARN L148 SmtUtils]: Spent 2048ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-11 23:21:29,729 WARN L148 SmtUtils]: Spent 2053ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-11 23:21:42,983 WARN L148 SmtUtils]: Spent 319ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-11 23:21:43,308 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 23:21:43,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:21:43,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:21:43,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:277, output treesize:1 [2018-04-11 23:21:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:21:43,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 23:21:43,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 36 [2018-04-11 23:21:43,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 23:21:43,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 23:21:43,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1041, Unknown=21, NotChecked=0, Total=1260 [2018-04-11 23:21:43,355 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 36 states. [2018-04-11 23:22:30,282 WARN L151 SmtUtils]: Spent 43495ms on a formula simplification. DAG size of input: 169 DAG size of output 148 [2018-04-11 23:22:52,462 WARN L151 SmtUtils]: Spent 9588ms on a formula simplification. DAG size of input: 133 DAG size of output 124 [2018-04-11 23:23:25,318 WARN L151 SmtUtils]: Spent 8368ms on a formula simplification. DAG size of input: 125 DAG size of output 117 [2018-04-11 23:23:42,924 WARN L148 SmtUtils]: Spent 627ms on a formula simplification that was a NOOP. DAG size: 112 [2018-04-11 23:23:47,125 WARN L148 SmtUtils]: Spent 340ms on a formula simplification that was a NOOP. DAG size: 106 [2018-04-11 23:23:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 23:23:54,790 INFO L93 Difference]: Finished difference Result 238 states and 253 transitions. [2018-04-11 23:23:54,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 23:23:54,790 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 49 [2018-04-11 23:23:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 23:23:54,793 INFO L225 Difference]: With dead ends: 238 [2018-04-11 23:23:54,793 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 23:23:54,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 139.2s TimeCoverageRelationStatistics Valid=617, Invalid=3638, Unknown=35, NotChecked=0, Total=4290 [2018-04-11 23:23:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 23:23:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 97. [2018-04-11 23:23:54,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-11 23:23:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-04-11 23:23:54,809 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 49 [2018-04-11 23:23:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 23:23:54,810 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-04-11 23:23:54,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 23:23:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-04-11 23:23:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 23:23:54,811 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 23:23:54,812 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 23:23:54,812 INFO L408 AbstractCegarLoop]: === Iteration 8 === [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-04-11 23:23:54,812 INFO L82 PathProgramCache]: Analyzing trace with hash -22598269, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 23:23:54,818 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 23:23:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 23:23:54,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 23:23:54,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 23:23:54,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 23:23:54,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 23:23:54,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 23:23:54,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 23:23:54,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 23:23:54,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 23:23:54,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 23:23:54,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-04-11 23:23:54,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-11 23:23:54,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-11 23:23:54,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 88 [2018-04-11 23:23:54,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:54,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 23:23:54,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-04-11 23:23:54,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,983 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,984 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:54,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 163 [2018-04-11 23:23:54,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-04-11 23:23:55,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-04-11 23:23:55,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-04-11 23:23:55,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:7 [2018-04-11 23:23:55,677 WARN L151 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 112 DAG size of output 53 [2018-04-11 23:23:55,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 86 [2018-04-11 23:23:55,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-04-11 23:23:55,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2018-04-11 23:23:55,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,711 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 50 treesize of output 86 [2018-04-11 23:23:55,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 147 [2018-04-11 23:23:55,729 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,747 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,763 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 23:23:55,807 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:235, output treesize:115 [2018-04-11 23:23:55,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 80 [2018-04-11 23:23:55,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,894 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:23:55,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 115 [2018-04-11 23:23:55,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 23:23:55,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 23:23:55,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 79 [2018-04-11 23:23:55,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 23:23:55,961 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:124, output treesize:3 [2018-04-11 23:23:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 23:23:55,996 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 23:24:13,141 WARN L148 SmtUtils]: Spent 802ms on a formula simplification that was a NOOP. DAG size: 72 Received shutdown request... [2018-04-11 23:25:46,304 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 23:25:46,304 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 23:25:46,308 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 23:25:46,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 11:25:46 BoogieIcfgContainer [2018-04-11 23:25:46,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 23:25:46,309 INFO L168 Benchmark]: Toolchain (without parser) took 285015.13 ms. Allocated memory was 299.4 MB in the beginning and 510.1 MB in the end (delta: 210.8 MB). Free memory was 242.9 MB in the beginning and 306.2 MB in the end (delta: -63.3 MB). Peak memory consumption was 147.4 MB. Max. memory is 5.3 GB. [2018-04-11 23:25:46,310 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 299.4 MB. Free memory is still 260.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 23:25:46,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.80 ms. Allocated memory is still 299.4 MB. Free memory was 242.9 MB in the beginning and 230.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:25:46,311 INFO L168 Benchmark]: Boogie Preprocessor took 39.74 ms. Allocated memory is still 299.4 MB. Free memory was 230.9 MB in the beginning and 228.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:25:46,311 INFO L168 Benchmark]: RCFGBuilder took 480.87 ms. Allocated memory was 299.4 MB in the beginning and 451.9 MB in the end (delta: 152.6 MB). Free memory was 228.9 MB in the beginning and 409.6 MB in the end (delta: -180.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-04-11 23:25:46,311 INFO L168 Benchmark]: TraceAbstraction took 284285.66 ms. Allocated memory was 451.9 MB in the beginning and 510.1 MB in the end (delta: 58.2 MB). Free memory was 409.6 MB in the beginning and 306.2 MB in the end (delta: 103.4 MB). Peak memory consumption was 161.6 MB. Max. memory is 5.3 GB. [2018-04-11 23:25:46,313 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.22 ms. Allocated memory is still 299.4 MB. Free memory is still 260.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.80 ms. Allocated memory is still 299.4 MB. Free memory was 242.9 MB in the beginning and 230.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.74 ms. Allocated memory is still 299.4 MB. Free memory was 230.9 MB in the beginning and 228.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 480.87 ms. Allocated memory was 299.4 MB in the beginning and 451.9 MB in the end (delta: 152.6 MB). Free memory was 228.9 MB in the beginning and 409.6 MB in the end (delta: -180.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 284285.66 ms. Allocated memory was 451.9 MB in the beginning and 510.1 MB in the end (delta: 58.2 MB). Free memory was 409.6 MB in the beginning and 306.2 MB in the end (delta: 103.4 MB). Peak memory consumption was 161.6 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 analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 35]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 35). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 38). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 39). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 41). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 47). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 22]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 22). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 44). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 36]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 36). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 42). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 28]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 28). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 33]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 33). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 32]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 32). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 45]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 45). Cancelled while BasicCegarLoop was analyzing trace of length 53 with TraceHistMax 4, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 34 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 111 locations, 37 error locations. TIMEOUT Result, 284.2s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 132.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 400 SDtfs, 1500 SDslu, 1003 SDs, 0 SdLazy, 1108 SolverSat, 252 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 30.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 335 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 139.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, 7 MinimizatonAttempts, 228 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 40.0s 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-04-11_23-25-46-324.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-04-11_23-25-46-324.csv Completed graceful shutdown