./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:41:12,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:41:12,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:41:12,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:41:12,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:41:12,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:41:12,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:41:12,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:41:12,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:41:12,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:41:12,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:41:12,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:41:12,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:41:12,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:41:12,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:41:12,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:41:12,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:41:12,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:41:12,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:41:12,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:41:12,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:41:12,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:41:12,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:41:12,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:41:12,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:41:12,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:41:12,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:41:12,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:41:12,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:41:12,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:41:12,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:41:12,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:41:12,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:41:12,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:41:12,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:41:12,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:41:12,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:41:12,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:41:12,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:41:12,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:41:12,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:41:12,746 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 21:41:12,773 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:41:12,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:41:12,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:41:12,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:41:12,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:41:12,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:41:12,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:41:12,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:41:12,776 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:41:12,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:41:12,776 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:41:12,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:41:12,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:41:12,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:41:12,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:41:12,777 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:41:12,777 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:41:12,777 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:41:12,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:41:12,777 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:41:12,778 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:41:12,778 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:41:12,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:41:12,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:41:12,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:41:12,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:41:12,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:41:12,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:41:12,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 21:41:12,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 21:41:12,779 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:41:12,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2021-12-18 21:41:13,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:41:13,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:41:13,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:41:13,026 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:41:13,027 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:41:13,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2021-12-18 21:41:13,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8ce0398/7e6f23109f24428b8ee7fcbf2b90f12e/FLAGd271de413 [2021-12-18 21:41:13,431 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:41:13,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2021-12-18 21:41:13,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8ce0398/7e6f23109f24428b8ee7fcbf2b90f12e/FLAGd271de413 [2021-12-18 21:41:13,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8ce0398/7e6f23109f24428b8ee7fcbf2b90f12e [2021-12-18 21:41:13,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:41:13,832 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:41:13,833 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:41:13,833 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:41:13,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:41:13,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:41:13" (1/1) ... [2021-12-18 21:41:13,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599717d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:13, skipping insertion in model container [2021-12-18 21:41:13,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:41:13" (1/1) ... [2021-12-18 21:41:13,843 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:41:13,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:41:14,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2021-12-18 21:41:14,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:41:14,157 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:41:14,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2021-12-18 21:41:14,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:41:14,215 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:41:14,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14 WrapperNode [2021-12-18 21:41:14,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:41:14,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:41:14,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:41:14,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:41:14,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,263 INFO L137 Inliner]: procedures = 124, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2021-12-18 21:41:14,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:41:14,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:41:14,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:41:14,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:41:14,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:41:14,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:41:14,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:41:14,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:41:14,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (1/1) ... [2021-12-18 21:41:14,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:41:14,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:41:14,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 21:41:14,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 21:41:14,359 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-18 21:41:14,360 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-18 21:41:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 21:41:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 21:41:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:41:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:41:14,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:41:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:41:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 21:41:14,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:41:14,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:41:14,443 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:41:14,444 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:41:14,485 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-18 21:41:14,605 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:41:14,609 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:41:14,610 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-18 21:41:14,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:41:14 BoogieIcfgContainer [2021-12-18 21:41:14,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:41:14,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:41:14,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:41:14,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:41:14,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:41:13" (1/3) ... [2021-12-18 21:41:14,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560a6590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:41:14, skipping insertion in model container [2021-12-18 21:41:14,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:14" (2/3) ... [2021-12-18 21:41:14,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560a6590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:41:14, skipping insertion in model container [2021-12-18 21:41:14,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:41:14" (3/3) ... [2021-12-18 21:41:14,617 INFO L111 eAbstractionObserver]: Analyzing ICFG list-1.i [2021-12-18 21:41:14,620 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:41:14,621 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2021-12-18 21:41:14,648 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:41:14,654 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 21:41:14,654 INFO L340 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2021-12-18 21:41:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 38 states have (on average 2.0) internal successors, (76), 66 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-18 21:41:14,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:14,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:14,672 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:14,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238161, now seen corresponding path program 1 times [2021-12-18 21:41:14,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:14,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248496875] [2021-12-18 21:41:14,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:14,686 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:14,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:41:14,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248496875] [2021-12-18 21:41:14,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248496875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:14,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:14,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:41:14,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083354131] [2021-12-18 21:41:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:14,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:41:14,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:41:14,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:41:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:41:14,832 INFO L87 Difference]: Start difference. First operand has 68 states, 38 states have (on average 2.0) internal successors, (76), 66 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:14,961 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2021-12-18 21:41:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:41:14,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-18 21:41:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:14,967 INFO L225 Difference]: With dead ends: 75 [2021-12-18 21:41:14,967 INFO L226 Difference]: Without dead ends: 68 [2021-12-18 21:41:14,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:41:14,972 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 115 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:14,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 40 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-18 21:41:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2021-12-18 21:41:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:14,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2021-12-18 21:41:14,994 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 7 [2021-12-18 21:41:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:14,994 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2021-12-18 21:41:14,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2021-12-18 21:41:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-18 21:41:14,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:14,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:14,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 21:41:14,996 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:14,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:14,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238162, now seen corresponding path program 1 times [2021-12-18 21:41:14,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:14,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801168178] [2021-12-18 21:41:14,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:14,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:15,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:41:15,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801168178] [2021-12-18 21:41:15,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801168178] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:15,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:15,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:41:15,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097200189] [2021-12-18 21:41:15,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:15,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:41:15,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:41:15,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:41:15,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:41:15,050 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:15,153 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2021-12-18 21:41:15,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:41:15,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-18 21:41:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:15,154 INFO L225 Difference]: With dead ends: 88 [2021-12-18 21:41:15,154 INFO L226 Difference]: Without dead ends: 88 [2021-12-18 21:41:15,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:41:15,155 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 112 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:15,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 45 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-18 21:41:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2021-12-18 21:41:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 76 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2021-12-18 21:41:15,161 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 7 [2021-12-18 21:41:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:15,161 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2021-12-18 21:41:15,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2021-12-18 21:41:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 21:41:15,168 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:15,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:15,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 21:41:15,168 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:15,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -502587362, now seen corresponding path program 1 times [2021-12-18 21:41:15,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:15,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997455114] [2021-12-18 21:41:15,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:15,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:15,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:41:15,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997455114] [2021-12-18 21:41:15,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997455114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:15,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:15,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:41:15,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379089830] [2021-12-18 21:41:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:15,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:15,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:41:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:15,270 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:15,416 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2021-12-18 21:41:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:41:15,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 21:41:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:15,418 INFO L225 Difference]: With dead ends: 129 [2021-12-18 21:41:15,418 INFO L226 Difference]: Without dead ends: 129 [2021-12-18 21:41:15,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:41:15,419 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 100 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:15,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 172 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-18 21:41:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 84. [2021-12-18 21:41:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 83 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2021-12-18 21:41:15,444 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 15 [2021-12-18 21:41:15,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:15,445 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2021-12-18 21:41:15,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2021-12-18 21:41:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 21:41:15,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:15,446 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:15,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 21:41:15,446 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash 761251652, now seen corresponding path program 1 times [2021-12-18 21:41:15,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:15,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434751763] [2021-12-18 21:41:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:15,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:15,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:41:15,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434751763] [2021-12-18 21:41:15,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434751763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:15,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:15,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:41:15,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094956315] [2021-12-18 21:41:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:15,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:15,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:41:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:15,505 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:15,639 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2021-12-18 21:41:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:41:15,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 21:41:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:15,642 INFO L225 Difference]: With dead ends: 112 [2021-12-18 21:41:15,642 INFO L226 Difference]: Without dead ends: 112 [2021-12-18 21:41:15,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:41:15,647 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 87 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:15,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 151 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-18 21:41:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 87. [2021-12-18 21:41:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.463768115942029) internal successors, (101), 86 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2021-12-18 21:41:15,651 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 15 [2021-12-18 21:41:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:15,652 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2021-12-18 21:41:15,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2021-12-18 21:41:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 21:41:15,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:15,653 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:15,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 21:41:15,654 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash 761251653, now seen corresponding path program 1 times [2021-12-18 21:41:15,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:15,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692843737] [2021-12-18 21:41:15,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:15,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:15,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:41:15,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692843737] [2021-12-18 21:41:15,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692843737] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:15,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:15,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:41:15,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570634584] [2021-12-18 21:41:15,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:15,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:15,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:41:15,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:15,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:15,757 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:15,927 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2021-12-18 21:41:15,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:41:15,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 21:41:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:15,928 INFO L225 Difference]: With dead ends: 113 [2021-12-18 21:41:15,928 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:41:15,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:41:15,932 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 61 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:15,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 186 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:15,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:41:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2021-12-18 21:41:15,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 82 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2021-12-18 21:41:15,944 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 15 [2021-12-18 21:41:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:15,944 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2021-12-18 21:41:15,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2021-12-18 21:41:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:41:15,945 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:15,945 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:15,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 21:41:15,946 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1997748640, now seen corresponding path program 1 times [2021-12-18 21:41:15,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:15,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498732291] [2021-12-18 21:41:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:15,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:15,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:41:15,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498732291] [2021-12-18 21:41:15,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498732291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:15,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:15,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:41:15,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299792304] [2021-12-18 21:41:15,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:15,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:15,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:41:15,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:15,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:15,988 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:16,074 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2021-12-18 21:41:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:41:16,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 21:41:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:16,076 INFO L225 Difference]: With dead ends: 124 [2021-12-18 21:41:16,076 INFO L226 Difference]: Without dead ends: 124 [2021-12-18 21:41:16,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:41:16,078 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:16,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 162 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-18 21:41:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 90. [2021-12-18 21:41:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2021-12-18 21:41:16,094 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 17 [2021-12-18 21:41:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:16,094 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2021-12-18 21:41:16,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2021-12-18 21:41:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:41:16,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:16,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:16,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 21:41:16,096 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1997696085, now seen corresponding path program 1 times [2021-12-18 21:41:16,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:16,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219684272] [2021-12-18 21:41:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:16,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:16,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:41:16,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219684272] [2021-12-18 21:41:16,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219684272] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:16,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:16,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:41:16,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206144389] [2021-12-18 21:41:16,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:16,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:16,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:41:16,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:16,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:16,157 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:16,266 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2021-12-18 21:41:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:41:16,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 21:41:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:16,267 INFO L225 Difference]: With dead ends: 151 [2021-12-18 21:41:16,267 INFO L226 Difference]: Without dead ends: 151 [2021-12-18 21:41:16,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:41:16,268 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:16,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 204 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-18 21:41:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2021-12-18 21:41:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 105 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2021-12-18 21:41:16,271 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 17 [2021-12-18 21:41:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:16,272 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2021-12-18 21:41:16,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,272 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2021-12-18 21:41:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:41:16,272 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:16,273 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:16,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 21:41:16,273 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:16,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:16,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2001456982, now seen corresponding path program 1 times [2021-12-18 21:41:16,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:16,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308345566] [2021-12-18 21:41:16,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:16,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:16,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:41:16,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308345566] [2021-12-18 21:41:16,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308345566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:16,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:16,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:41:16,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599911191] [2021-12-18 21:41:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:16,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:16,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:41:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:16,315 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:16,393 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2021-12-18 21:41:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:41:16,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 21:41:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:16,394 INFO L225 Difference]: With dead ends: 108 [2021-12-18 21:41:16,394 INFO L226 Difference]: Without dead ends: 108 [2021-12-18 21:41:16,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:41:16,395 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 80 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:16,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 122 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-18 21:41:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2021-12-18 21:41:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2021-12-18 21:41:16,398 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 17 [2021-12-18 21:41:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:16,398 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2021-12-18 21:41:16,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2021-12-18 21:41:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:41:16,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:16,399 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:16,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 21:41:16,399 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2001456983, now seen corresponding path program 1 times [2021-12-18 21:41:16,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:16,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550148794] [2021-12-18 21:41:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:16,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:16,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:41:16,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550148794] [2021-12-18 21:41:16,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550148794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:16,446 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:16,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:41:16,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313746199] [2021-12-18 21:41:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:16,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:16,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:41:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:16,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:16,447 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:16,575 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2021-12-18 21:41:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:41:16,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 21:41:16,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:16,577 INFO L225 Difference]: With dead ends: 105 [2021-12-18 21:41:16,577 INFO L226 Difference]: Without dead ends: 105 [2021-12-18 21:41:16,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:41:16,578 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 53 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:16,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 147 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-18 21:41:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2021-12-18 21:41:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 91 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2021-12-18 21:41:16,580 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 17 [2021-12-18 21:41:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:16,581 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2021-12-18 21:41:16,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2021-12-18 21:41:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 21:41:16,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:16,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:16,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 21:41:16,581 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1800660604, now seen corresponding path program 1 times [2021-12-18 21:41:16,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:41:16,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118879483] [2021-12-18 21:41:16,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:16,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:41:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:41:16,602 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 21:41:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:41:16,624 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 21:41:16,625 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 21:41:16,625 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2021-12-18 21:41:16,627 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (24 of 26 remaining) [2021-12-18 21:41:16,627 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (23 of 26 remaining) [2021-12-18 21:41:16,627 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (22 of 26 remaining) [2021-12-18 21:41:16,627 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (21 of 26 remaining) [2021-12-18 21:41:16,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (20 of 26 remaining) [2021-12-18 21:41:16,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (19 of 26 remaining) [2021-12-18 21:41:16,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (18 of 26 remaining) [2021-12-18 21:41:16,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (17 of 26 remaining) [2021-12-18 21:41:16,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (16 of 26 remaining) [2021-12-18 21:41:16,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (15 of 26 remaining) [2021-12-18 21:41:16,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (14 of 26 remaining) [2021-12-18 21:41:16,628 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (13 of 26 remaining) [2021-12-18 21:41:16,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (12 of 26 remaining) [2021-12-18 21:41:16,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (11 of 26 remaining) [2021-12-18 21:41:16,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (10 of 26 remaining) [2021-12-18 21:41:16,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (9 of 26 remaining) [2021-12-18 21:41:16,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (8 of 26 remaining) [2021-12-18 21:41:16,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (7 of 26 remaining) [2021-12-18 21:41:16,629 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (6 of 26 remaining) [2021-12-18 21:41:16,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (5 of 26 remaining) [2021-12-18 21:41:16,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (4 of 26 remaining) [2021-12-18 21:41:16,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (3 of 26 remaining) [2021-12-18 21:41:16,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (2 of 26 remaining) [2021-12-18 21:41:16,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (1 of 26 remaining) [2021-12-18 21:41:16,630 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2021-12-18 21:41:16,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 21:41:16,633 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:16,636 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 21:41:16,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:41:16 BoogieIcfgContainer [2021-12-18 21:41:16,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 21:41:16,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 21:41:16,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 21:41:16,652 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 21:41:16,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:41:14" (3/4) ... [2021-12-18 21:41:16,656 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 21:41:16,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 21:41:16,656 INFO L158 Benchmark]: Toolchain (without parser) took 2825.39ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 84.2MB in the beginning and 63.1MB in the end (delta: 21.1MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2021-12-18 21:41:16,657 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:41:16,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.85ms. Allocated memory is still 117.4MB. Free memory was 83.9MB in the beginning and 84.9MB in the end (delta: -931.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 21:41:16,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.23ms. Allocated memory is still 117.4MB. Free memory was 84.9MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:41:16,657 INFO L158 Benchmark]: Boogie Preprocessor took 41.54ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:41:16,657 INFO L158 Benchmark]: RCFGBuilder took 304.49ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 66.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-18 21:41:16,657 INFO L158 Benchmark]: TraceAbstraction took 2039.30ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 66.4MB in the beginning and 63.1MB in the end (delta: 3.3MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2021-12-18 21:41:16,658 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 144.7MB. Free memory is still 63.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:41:16,659 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.85ms. Allocated memory is still 117.4MB. Free memory was 83.9MB in the beginning and 84.9MB in the end (delta: -931.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.23ms. Allocated memory is still 117.4MB. Free memory was 84.9MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.54ms. Allocated memory is still 117.4MB. Free memory was 82.8MB in the beginning and 81.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 304.49ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 66.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2039.30ms. Allocated memory was 117.4MB in the beginning and 144.7MB in the end (delta: 27.3MB). Free memory was 66.4MB in the beginning and 63.1MB in the end (delta: 3.3MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 144.7MB. Free memory is still 63.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={-1:0}] [L534] List t; [L535] List p = a; VAL [a={-1:0}, p={-1:0}] [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 VAL [a={-1:0}, p={-1:0}] [L551] p = a VAL [a={-1:0}, p={-1:0}] [L552] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=3] [L552] COND FALSE !(p->h == 1) [L554] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=3] [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h VAL [a={-1:0}, p={-1:0}, p->h=3] [L556] COND FALSE !(p->h != 3) [L558] return 0; VAL [\result=0, a={-1:0}, p={-1:0}] - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 773 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 773 mSDsluCounter, 1229 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 837 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1173 IncrementalHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 392 mSDtfsCounter, 1173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 212 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-18 21:41:16,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:41:18,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:41:18,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:41:18,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:41:18,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:41:18,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:41:18,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:41:18,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:41:18,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:41:18,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:41:18,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:41:18,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:41:18,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:41:18,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:41:18,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:41:18,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:41:18,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:41:18,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:41:18,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:41:18,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:41:18,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:41:18,373 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:41:18,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:41:18,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:41:18,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:41:18,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:41:18,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:41:18,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:41:18,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:41:18,383 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:41:18,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:41:18,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:41:18,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:41:18,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:41:18,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:41:18,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:41:18,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:41:18,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:41:18,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:41:18,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:41:18,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:41:18,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 21:41:18,412 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:41:18,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:41:18,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:41:18,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:41:18,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:41:18,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:41:18,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:41:18,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:41:18,415 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:41:18,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:41:18,416 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:41:18,416 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:41:18,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:41:18,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:41:18,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:41:18,417 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:41:18,417 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:41:18,417 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:41:18,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:41:18,418 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:41:18,418 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 21:41:18,418 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 21:41:18,418 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:41:18,418 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:41:18,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:41:18,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:41:18,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:41:18,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:41:18,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:41:18,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:41:18,419 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 21:41:18,420 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 21:41:18,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:41:18,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 21:41:18,420 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 657efb2af25c5cc2c0afb2bbf76276caecae7904494acc21657e1ac1176685b7 [2021-12-18 21:41:18,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:41:18,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:41:18,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:41:18,712 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:41:18,713 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:41:18,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list-1.i [2021-12-18 21:41:18,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a764db/91f2a0caf2e44b7fb6098c78a7788473/FLAG49548c0ba [2021-12-18 21:41:19,148 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:41:19,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i [2021-12-18 21:41:19,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a764db/91f2a0caf2e44b7fb6098c78a7788473/FLAG49548c0ba [2021-12-18 21:41:19,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d85a764db/91f2a0caf2e44b7fb6098c78a7788473 [2021-12-18 21:41:19,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:41:19,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:41:19,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:41:19,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:41:19,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:41:19,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9d155c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19, skipping insertion in model container [2021-12-18 21:41:19,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:41:19,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:41:19,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2021-12-18 21:41:19,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:41:19,504 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:41:19,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list-1.i[23408,23421] [2021-12-18 21:41:19,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:41:19,576 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:41:19,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19 WrapperNode [2021-12-18 21:41:19,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:41:19,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:41:19,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:41:19,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:41:19,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,628 INFO L137 Inliner]: procedures = 127, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2021-12-18 21:41:19,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:41:19,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:41:19,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:41:19,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:41:19,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:41:19,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:41:19,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:41:19,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:41:19,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (1/1) ... [2021-12-18 21:41:19,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:41:19,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:41:19,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 21:41:19,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 21:41:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-18 21:41:19,736 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-18 21:41:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 21:41:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:41:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:41:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:41:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:41:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 21:41:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 21:41:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:41:19,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:41:19,842 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:41:19,844 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:41:19,874 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-18 21:41:20,046 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:41:20,050 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:41:20,050 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-18 21:41:20,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:41:20 BoogieIcfgContainer [2021-12-18 21:41:20,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:41:20,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:41:20,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:41:20,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:41:20,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:41:19" (1/3) ... [2021-12-18 21:41:20,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e299884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:41:20, skipping insertion in model container [2021-12-18 21:41:20,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:41:19" (2/3) ... [2021-12-18 21:41:20,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e299884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:41:20, skipping insertion in model container [2021-12-18 21:41:20,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:41:20" (3/3) ... [2021-12-18 21:41:20,056 INFO L111 eAbstractionObserver]: Analyzing ICFG list-1.i [2021-12-18 21:41:20,059 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:41:20,059 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2021-12-18 21:41:20,089 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:41:20,095 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 21:41:20,095 INFO L340 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2021-12-18 21:41:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 21:41:20,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:20,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 21:41:20,109 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516551, now seen corresponding path program 1 times [2021-12-18 21:41:20,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:20,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815131286] [2021-12-18 21:41:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:20,123 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:20,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:20,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:20,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 21:41:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:20,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:41:20,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:20,249 INFO L388 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 [2021-12-18 21:41:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:20,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:41:20,270 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:41:20,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815131286] [2021-12-18 21:41:20,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815131286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:20,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:20,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:41:20,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582965686] [2021-12-18 21:41:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:20,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:41:20,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:41:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:41:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:41:20,293 INFO L87 Difference]: Start difference. First operand has 66 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 64 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:20,508 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2021-12-18 21:41:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:41:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 21:41:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:20,515 INFO L225 Difference]: With dead ends: 71 [2021-12-18 21:41:20,515 INFO L226 Difference]: Without dead ends: 64 [2021-12-18 21:41:20,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:41:20,518 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 110 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:20,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 36 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:41:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-18 21:41:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2021-12-18 21:41:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.725) internal successors, (69), 58 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2021-12-18 21:41:20,546 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 6 [2021-12-18 21:41:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:20,547 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2021-12-18 21:41:20,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2021-12-18 21:41:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 21:41:20,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:20,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 21:41:20,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 21:41:20,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:20,758 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:20,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516552, now seen corresponding path program 1 times [2021-12-18 21:41:20,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:20,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446316047] [2021-12-18 21:41:20,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:20,759 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:20,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:20,770 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:20,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 21:41:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:20,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:41:20,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:20,839 INFO L388 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 [2021-12-18 21:41:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:20,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:41:20,890 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:41:20,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446316047] [2021-12-18 21:41:20,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446316047] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:20,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:20,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:41:20,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151694119] [2021-12-18 21:41:20,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:20,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:41:20,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:41:20,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:41:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:41:20,898 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:21,081 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2021-12-18 21:41:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:41:21,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 21:41:21,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:21,084 INFO L225 Difference]: With dead ends: 84 [2021-12-18 21:41:21,084 INFO L226 Difference]: Without dead ends: 84 [2021-12-18 21:41:21,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:41:21,085 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 107 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:21,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 41 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:41:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-18 21:41:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2021-12-18 21:41:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.5) internal successors, (81), 72 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2021-12-18 21:41:21,090 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 6 [2021-12-18 21:41:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:21,090 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2021-12-18 21:41:21,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2021-12-18 21:41:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 21:41:21,090 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:21,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:21,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 21:41:21,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:21,299 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:21,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:21,299 INFO L85 PathProgramCache]: Analyzing trace with hash 423224549, now seen corresponding path program 1 times [2021-12-18 21:41:21,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:21,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142508444] [2021-12-18 21:41:21,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:21,300 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:21,301 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:21,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 21:41:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:21,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 21:41:21,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:21,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-18 21:41:21,433 INFO L388 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 15 treesize of output 7 [2021-12-18 21:41:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:21,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:41:21,443 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:41:21,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142508444] [2021-12-18 21:41:21,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142508444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:21,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:21,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:41:21,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112350281] [2021-12-18 21:41:21,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:21,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:21,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:41:21,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:21,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:21,445 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:21,663 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2021-12-18 21:41:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:41:21,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 21:41:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:21,667 INFO L225 Difference]: With dead ends: 112 [2021-12-18 21:41:21,667 INFO L226 Difference]: Without dead ends: 112 [2021-12-18 21:41:21,667 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:41:21,668 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 76 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:21,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 161 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:41:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-18 21:41:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 76. [2021-12-18 21:41:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2021-12-18 21:41:21,673 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 13 [2021-12-18 21:41:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:21,674 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2021-12-18 21:41:21,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2021-12-18 21:41:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 21:41:21,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:21,675 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:21,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 21:41:21,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:21,879 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769667, now seen corresponding path program 1 times [2021-12-18 21:41:21,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:21,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795356446] [2021-12-18 21:41:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:21,880 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:21,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:21,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:21,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 21:41:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:21,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:41:21,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:21,948 INFO L388 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 [2021-12-18 21:41:21,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-18 21:41:21,979 INFO L388 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 24 treesize of output 12 [2021-12-18 21:41:21,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:21,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:41:21,999 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:41:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795356446] [2021-12-18 21:41:21,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795356446] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:21,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:21,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:41:21,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471716501] [2021-12-18 21:41:21,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:22,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:22,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:41:22,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:22,001 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:22,266 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-12-18 21:41:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:41:22,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 21:41:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:22,267 INFO L225 Difference]: With dead ends: 100 [2021-12-18 21:41:22,267 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 21:41:22,268 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:41:22,268 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 84 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:22,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 131 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:41:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 21:41:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 78. [2021-12-18 21:41:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2021-12-18 21:41:22,273 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 13 [2021-12-18 21:41:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:22,273 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2021-12-18 21:41:22,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2021-12-18 21:41:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 21:41:22,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:22,274 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:22,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 21:41:22,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:22,475 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769666, now seen corresponding path program 1 times [2021-12-18 21:41:22,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:22,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933815918] [2021-12-18 21:41:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:22,475 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:22,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:22,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:22,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 21:41:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:22,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 21:41:22,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:22,535 INFO L388 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 [2021-12-18 21:41:22,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-18 21:41:22,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-18 21:41:22,588 INFO L388 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 21 treesize of output 9 [2021-12-18 21:41:22,593 INFO L388 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 19 treesize of output 7 [2021-12-18 21:41:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:22,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:41:22,622 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:41:22,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933815918] [2021-12-18 21:41:22,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933815918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:22,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:22,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:41:22,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949634119] [2021-12-18 21:41:22,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:22,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:22,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:41:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:22,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:22,624 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:22,959 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2021-12-18 21:41:22,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:41:22,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 21:41:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:22,960 INFO L225 Difference]: With dead ends: 101 [2021-12-18 21:41:22,961 INFO L226 Difference]: Without dead ends: 101 [2021-12-18 21:41:22,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:41:22,961 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 58 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:22,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 166 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:41:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-18 21:41:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2021-12-18 21:41:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2021-12-18 21:41:22,965 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 13 [2021-12-18 21:41:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:22,965 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2021-12-18 21:41:22,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2021-12-18 21:41:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 21:41:22,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:22,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:22,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 21:41:23,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:23,173 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:23,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:23,174 INFO L85 PathProgramCache]: Analyzing trace with hash 916718725, now seen corresponding path program 1 times [2021-12-18 21:41:23,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:23,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712621601] [2021-12-18 21:41:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:23,174 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:23,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:23,175 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:23,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 21:41:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:23,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:41:23,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:23,228 INFO L388 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 [2021-12-18 21:41:23,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-18 21:41:23,250 INFO L388 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 24 treesize of output 12 [2021-12-18 21:41:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:23,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:41:23,276 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:41:23,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712621601] [2021-12-18 21:41:23,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712621601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:23,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:23,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:41:23,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981986798] [2021-12-18 21:41:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:23,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:23,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:41:23,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:23,278 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:23,511 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2021-12-18 21:41:23,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:41:23,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-18 21:41:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:23,512 INFO L225 Difference]: With dead ends: 91 [2021-12-18 21:41:23,512 INFO L226 Difference]: Without dead ends: 91 [2021-12-18 21:41:23,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:41:23,513 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 77 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:23,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 123 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:41:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-18 21:41:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2021-12-18 21:41:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2021-12-18 21:41:23,517 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 14 [2021-12-18 21:41:23,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:23,517 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2021-12-18 21:41:23,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:23,517 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2021-12-18 21:41:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 21:41:23,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:23,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:23,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 21:41:23,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:23,724 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash 916718726, now seen corresponding path program 1 times [2021-12-18 21:41:23,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:23,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577721657] [2021-12-18 21:41:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:23,725 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:23,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:23,726 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:23,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 21:41:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:23,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 21:41:23,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:23,787 INFO L388 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 [2021-12-18 21:41:23,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-18 21:41:23,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-12-18 21:41:23,846 INFO L388 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 21 treesize of output 9 [2021-12-18 21:41:23,849 INFO L388 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 19 treesize of output 7 [2021-12-18 21:41:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:23,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:41:23,886 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:41:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577721657] [2021-12-18 21:41:23,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577721657] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:23,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:23,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:41:23,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363129974] [2021-12-18 21:41:23,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:23,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:23,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:41:23,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:23,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:23,888 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:24,173 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2021-12-18 21:41:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:41:24,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-18 21:41:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:24,174 INFO L225 Difference]: With dead ends: 88 [2021-12-18 21:41:24,174 INFO L226 Difference]: Without dead ends: 88 [2021-12-18 21:41:24,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:41:24,174 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:24,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 154 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:41:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-18 21:41:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2021-12-18 21:41:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2021-12-18 21:41:24,177 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 14 [2021-12-18 21:41:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:24,177 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2021-12-18 21:41:24,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2021-12-18 21:41:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 21:41:24,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:24,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:24,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-18 21:41:24,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:24,385 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1350732505, now seen corresponding path program 1 times [2021-12-18 21:41:24,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:24,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265915577] [2021-12-18 21:41:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:24,386 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:24,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:24,387 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:24,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 21:41:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:24,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 21:41:24,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:24,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-18 21:41:24,481 INFO L388 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 15 treesize of output 7 [2021-12-18 21:41:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:24,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:41:24,491 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:41:24,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265915577] [2021-12-18 21:41:24,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265915577] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:24,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:24,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:41:24,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037520077] [2021-12-18 21:41:24,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:24,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:24,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:41:24,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:24,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:24,492 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:24,659 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-12-18 21:41:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:41:24,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 21:41:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:24,664 INFO L225 Difference]: With dead ends: 100 [2021-12-18 21:41:24,664 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 21:41:24,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:41:24,664 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 66 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:24,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 134 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 21:41:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 60. [2021-12-18 21:41:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2021-12-18 21:41:24,667 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 15 [2021-12-18 21:41:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:24,667 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2021-12-18 21:41:24,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-12-18 21:41:24,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 21:41:24,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:24,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:24,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-18 21:41:24,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:24,875 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1350679950, now seen corresponding path program 1 times [2021-12-18 21:41:24,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:24,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353183815] [2021-12-18 21:41:24,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:24,876 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:24,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:24,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:24,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 21:41:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:41:24,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 21:41:24,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:24,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-12-18 21:41:24,966 INFO L388 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 15 treesize of output 7 [2021-12-18 21:41:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:24,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:41:24,976 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:41:24,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353183815] [2021-12-18 21:41:24,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353183815] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:41:24,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:24,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:41:24,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354577071] [2021-12-18 21:41:24,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:41:24,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:41:24,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:41:24,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:41:24,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:41:24,977 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:25,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:41:25,145 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2021-12-18 21:41:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:41:25,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 21:41:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:41:25,146 INFO L225 Difference]: With dead ends: 83 [2021-12-18 21:41:25,146 INFO L226 Difference]: Without dead ends: 83 [2021-12-18 21:41:25,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:41:25,147 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:41:25,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 124 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:41:25,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-18 21:41:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 60. [2021-12-18 21:41:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2021-12-18 21:41:25,149 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 15 [2021-12-18 21:41:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:41:25,149 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2021-12-18 21:41:25,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:41:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2021-12-18 21:41:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 21:41:25,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:41:25,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:25,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 21:41:25,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:25,357 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:41:25,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:41:25,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1076970395, now seen corresponding path program 1 times [2021-12-18 21:41:25,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:41:25,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523780897] [2021-12-18 21:41:25,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:41:25,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:41:25,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:41:25,358 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:41:25,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 21:41:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:41:25,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 21:41:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 21:41:25,430 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-18 21:41:25,430 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 21:41:25,431 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2021-12-18 21:41:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (24 of 26 remaining) [2021-12-18 21:41:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (23 of 26 remaining) [2021-12-18 21:41:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (22 of 26 remaining) [2021-12-18 21:41:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (21 of 26 remaining) [2021-12-18 21:41:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (20 of 26 remaining) [2021-12-18 21:41:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (19 of 26 remaining) [2021-12-18 21:41:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (18 of 26 remaining) [2021-12-18 21:41:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (17 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (16 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (15 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (14 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (13 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (12 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (11 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (10 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (9 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (8 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (7 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (6 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (5 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (4 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (3 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (2 of 26 remaining) [2021-12-18 21:41:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (1 of 26 remaining) [2021-12-18 21:41:25,434 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2021-12-18 21:41:25,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 21:41:25,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:41:25,636 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:25,638 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 21:41:25,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:41:25 BoogieIcfgContainer [2021-12-18 21:41:25,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 21:41:25,650 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 21:41:25,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 21:41:25,651 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 21:41:25,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:41:20" (3/4) ... [2021-12-18 21:41:25,656 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 21:41:25,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 21:41:25,657 INFO L158 Benchmark]: Toolchain (without parser) took 6474.38ms. Allocated memory was 52.4MB in the beginning and 75.5MB in the end (delta: 23.1MB). Free memory was 28.7MB in the beginning and 44.2MB in the end (delta: -15.5MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2021-12-18 21:41:25,657 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 52.4MB. Free memory was 34.9MB in the beginning and 34.9MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:41:25,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.97ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.4MB in the beginning and 38.7MB in the end (delta: -10.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2021-12-18 21:41:25,660 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.77ms. Allocated memory is still 62.9MB. Free memory was 38.7MB in the beginning and 36.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:41:25,661 INFO L158 Benchmark]: Boogie Preprocessor took 45.17ms. Allocated memory is still 62.9MB. Free memory was 36.7MB in the beginning and 35.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:41:25,661 INFO L158 Benchmark]: RCFGBuilder took 376.00ms. Allocated memory is still 62.9MB. Free memory was 35.1MB in the beginning and 31.8MB in the end (delta: 3.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2021-12-18 21:41:25,661 INFO L158 Benchmark]: TraceAbstraction took 5597.83ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 31.3MB in the beginning and 44.8MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:41:25,662 INFO L158 Benchmark]: Witness Printer took 6.15ms. Allocated memory is still 75.5MB. Free memory was 44.8MB in the beginning and 44.2MB in the end (delta: 554.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:41:25,663 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 52.4MB. Free memory was 34.9MB in the beginning and 34.9MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.97ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 28.4MB in the beginning and 38.7MB in the end (delta: -10.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.77ms. Allocated memory is still 62.9MB. Free memory was 38.7MB in the beginning and 36.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.17ms. Allocated memory is still 62.9MB. Free memory was 36.7MB in the beginning and 35.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 376.00ms. Allocated memory is still 62.9MB. Free memory was 35.1MB in the beginning and 31.8MB in the end (delta: 3.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5597.83ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 31.3MB in the beginning and 44.8MB in the end (delta: -13.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.15ms. Allocated memory is still 75.5MB. Free memory was 44.8MB in the beginning and 44.2MB in the end (delta: 554.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] List a = (List) malloc(sizeof(struct node)); [L533] COND FALSE !(a == 0) VAL [a={6:0}] [L534] List t; [L535] List p = a; VAL [a={6:0}, p={6:0}] [L536] COND FALSE !(__VERIFIER_nondet_int()) [L543] COND FALSE !(__VERIFIER_nondet_int()) [L550] p->h = 3 VAL [a={6:0}, p={6:0}] [L551] p = a VAL [a={6:0}, p={6:0}] [L552] EXPR p->h VAL [a={6:0}, p={6:0}, p->h=3] [L552] COND FALSE !(p->h == 1) [L554] EXPR p->h VAL [a={6:0}, p={6:0}, p->h=3] [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h VAL [a={6:0}, p={6:0}, p->h=3] [L556] COND FALSE !(p->h != 3) [L558] return 0; VAL [\result=0, a={6:0}, p={6:0}] - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 544]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 547]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 550]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 674 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 1070 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 719 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1157 IncrementalHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 351 mSDtfsCounter, 1157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=4, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 225 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 508 SizeOfPredicates, 44 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-18 21:41:25,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample