./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.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 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:12:14,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:12:14,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:12:14,648 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:12:14,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:12:14,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:12:14,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:12:14,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:12:14,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:12:14,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:12:14,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:12:14,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:12:14,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:12:14,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:12:14,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:12:14,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:12:14,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:12:14,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:12:14,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:12:14,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:12:14,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:12:14,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:12:14,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:12:14,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:12:14,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:12:14,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:12:14,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:12:14,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:12:14,692 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:12:14,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:12:14,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:12:14,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:12:14,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:12:14,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:12:14,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:12:14,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:12:14,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:12:14,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:12:14,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:12:14,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:12:14,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:12:14,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:12:14,731 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:12:14,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:12:14,732 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:12:14,732 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:12:14,733 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:12:14,733 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:12:14,734 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:12:14,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:12:14,734 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:12:14,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:12:14,735 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:12:14,735 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:12:14,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:12:14,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:12:14,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:12:14,736 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:12:14,736 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:12:14,736 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:12:14,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:12:14,736 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:12:14,737 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:12:14,737 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:12:14,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:12:14,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:12:14,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:12:14,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:12:14,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:12:14,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:12:14,738 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:12:14,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:12:14,738 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:12:14,738 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:12:14,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:12:14,739 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:12:14,739 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:12:15,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:12:15,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:12:15,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:12:15,074 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:12:15,076 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:12:15,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-29 20:12:16,361 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:12:16,620 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:12:16,621 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-29 20:12:16,632 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9e66699/e8bd9fe4ce784c70a95ad781ca5f34a1/FLAG084b19d5c [2023-08-29 20:12:16,646 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef9e66699/e8bd9fe4ce784c70a95ad781ca5f34a1 [2023-08-29 20:12:16,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:12:16,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:12:16,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:12:16,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:12:16,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:12:16,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:12:16" (1/1) ... [2023-08-29 20:12:16,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54463f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:16, skipping insertion in model container [2023-08-29 20:12:16,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:12:16" (1/1) ... [2023-08-29 20:12:16,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:12:16,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:12:16,825 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2023-08-29 20:12:17,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:12:17,069 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:12:17,083 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2023-08-29 20:12:17,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:12:17,195 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:12:17,195 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:12:17,201 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:12:17,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17 WrapperNode [2023-08-29 20:12:17,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:12:17,203 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:12:17,203 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:12:17,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:12:17,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,280 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-29 20:12:17,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:12:17,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:12:17,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:12:17,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:12:17,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,319 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,333 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:12:17,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:12:17,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:12:17,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:12:17,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (1/1) ... [2023-08-29 20:12:17,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:12:17,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:12:17,382 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) [2023-08-29 20:12:17,397 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 [2023-08-29 20:12:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:12:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:12:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:12:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:12:17,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:12:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:12:17,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:12:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:12:17,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:12:17,423 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:12:17,423 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:12:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:12:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:12:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:12:17,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:12:17,426 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:12:17,541 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:12:17,543 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:12:18,017 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:12:18,131 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:12:18,131 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:12:18,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:12:18 BoogieIcfgContainer [2023-08-29 20:12:18,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:12:18,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:12:18,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:12:18,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:12:18,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:12:16" (1/3) ... [2023-08-29 20:12:18,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c74837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:12:18, skipping insertion in model container [2023-08-29 20:12:18,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:17" (2/3) ... [2023-08-29 20:12:18,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c74837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:12:18, skipping insertion in model container [2023-08-29 20:12:18,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:12:18" (3/3) ... [2023-08-29 20:12:18,140 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-29 20:12:18,155 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:12:18,155 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:12:18,155 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:12:18,215 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:12:18,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2023-08-29 20:12:18,327 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-29 20:12:18,328 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:12:18,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:12:18,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2023-08-29 20:12:18,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2023-08-29 20:12:18,343 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:12:18,364 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-29 20:12:18,370 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-29 20:12:18,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2023-08-29 20:12:18,407 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-29 20:12:18,407 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:12:18,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:12:18,410 INFO L119 LiptonReduction]: Number of co-enabled transitions 2068 [2023-08-29 20:12:22,096 INFO L134 LiptonReduction]: Checked pairs total: 5574 [2023-08-29 20:12:22,097 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-29 20:12:22,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:12:22,120 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@32cb6987, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:12:22,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:12:22,122 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:12:22,122 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:12:22,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:22,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:12:22,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:22,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash 542, now seen corresponding path program 1 times [2023-08-29 20:12:22,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:22,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11389223] [2023-08-29 20:12:22,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:22,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:22,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:22,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11389223] [2023-08-29 20:12:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11389223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:22,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:22,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:12:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418570376] [2023-08-29 20:12:22,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:22,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:12:22,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:22,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:12:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:12:22,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-08-29 20:12:22,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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) [2023-08-29 20:12:22,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:22,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-08-29 20:12:22,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:22,597 INFO L130 PetriNetUnfolder]: 1263/1904 cut-off events. [2023-08-29 20:12:22,598 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-29 20:12:22,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 1904 events. 1263/1904 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9278 event pairs, 1263 based on Foata normal form. 72/1642 useless extension candidates. Maximal degree in co-relation 3800. Up to 1871 conditions per place. [2023-08-29 20:12:22,615 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-29 20:12:22,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-29 20:12:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:12:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:12:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 248 transitions. [2023-08-29 20:12:22,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254237288135594 [2023-08-29 20:12:22,632 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 248 transitions. [2023-08-29 20:12:22,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 248 transitions. [2023-08-29 20:12:22,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:22,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 248 transitions. [2023-08-29 20:12:22,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 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) [2023-08-29 20:12:22,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2023-08-29 20:12:22,646 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2023-08-29 20:12:22,647 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 248 transitions. [2023-08-29 20:12:22,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-29 20:12:22,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:12:22,651 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-29 20:12:22,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-29 20:12:22,656 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:12:22,656 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-29 20:12:22,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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) [2023-08-29 20:12:22,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:22,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:22,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:12:22,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:22,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:22,658 INFO L85 PathProgramCache]: Analyzing trace with hash -176197795, now seen corresponding path program 1 times [2023-08-29 20:12:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:22,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343093529] [2023-08-29 20:12:22,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:22,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:22,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343093529] [2023-08-29 20:12:22,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343093529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:22,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:22,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:12:22,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615828115] [2023-08-29 20:12:22,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:22,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:12:22,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:22,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:12:22,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:12:22,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 236 [2023-08-29 20:12:22,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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) [2023-08-29 20:12:22,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:22,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 236 [2023-08-29 20:12:22,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:23,173 INFO L130 PetriNetUnfolder]: 1043/1657 cut-off events. [2023-08-29 20:12:23,174 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:12:23,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 1657 events. 1043/1657 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8741 event pairs, 163 based on Foata normal form. 0/1473 useless extension candidates. Maximal degree in co-relation 3243. Up to 1265 conditions per place. [2023-08-29 20:12:23,182 INFO L137 encePairwiseOnDemand]: 233/236 looper letters, 28 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-08-29 20:12:23,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 148 flow [2023-08-29 20:12:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:12:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:12:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-29 20:12:23,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070621468926554 [2023-08-29 20:12:23,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-29 20:12:23,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-29 20:12:23,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:23,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-29 20:12:23,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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) [2023-08-29 20:12:23,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-29 20:12:23,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-29 20:12:23,195 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 359 transitions. [2023-08-29 20:12:23,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 148 flow [2023-08-29 20:12:23,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:12:23,197 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-29 20:12:23,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-29 20:12:23,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-29 20:12:23,198 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-29 20:12:23,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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) [2023-08-29 20:12:23,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:23,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:23,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:12:23,199 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:23,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:23,202 INFO L85 PathProgramCache]: Analyzing trace with hash -656238071, now seen corresponding path program 1 times [2023-08-29 20:12:23,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:23,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798246253] [2023-08-29 20:12:23,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:23,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798246253] [2023-08-29 20:12:23,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798246253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:23,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:23,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:12:23,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420573475] [2023-08-29 20:12:23,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:23,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:12:23,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:12:23,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:12:23,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 236 [2023-08-29 20:12:23,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 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) [2023-08-29 20:12:23,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:23,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 236 [2023-08-29 20:12:23,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:24,257 INFO L130 PetriNetUnfolder]: 1367/2104 cut-off events. [2023-08-29 20:12:24,258 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2023-08-29 20:12:24,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4352 conditions, 2104 events. 1367/2104 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10764 event pairs, 462 based on Foata normal form. 0/2053 useless extension candidates. Maximal degree in co-relation 4348. Up to 847 conditions per place. [2023-08-29 20:12:24,269 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 47 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-08-29 20:12:24,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 230 flow [2023-08-29 20:12:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:12:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:12:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2023-08-29 20:12:24,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4364406779661017 [2023-08-29 20:12:24,272 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 618 transitions. [2023-08-29 20:12:24,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 618 transitions. [2023-08-29 20:12:24,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:24,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 618 transitions. [2023-08-29 20:12:24,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 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) [2023-08-29 20:12:24,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 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) [2023-08-29 20:12:24,278 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 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) [2023-08-29 20:12:24,278 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 6 states and 618 transitions. [2023-08-29 20:12:24,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 230 flow [2023-08-29 20:12:24,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:12:24,281 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 78 flow [2023-08-29 20:12:24,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-08-29 20:12:24,282 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-29 20:12:24,287 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 78 flow [2023-08-29 20:12:24,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 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) [2023-08-29 20:12:24,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:24,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:24,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:12:24,289 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:24,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash -656238146, now seen corresponding path program 1 times [2023-08-29 20:12:24,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:24,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894007124] [2023-08-29 20:12:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:24,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:24,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:24,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894007124] [2023-08-29 20:12:24,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894007124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:24,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:24,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:12:24,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999436827] [2023-08-29 20:12:24,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:24,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:12:24,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:24,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:12:24,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:12:24,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 236 [2023-08-29 20:12:24,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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) [2023-08-29 20:12:24,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:24,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 236 [2023-08-29 20:12:24,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:24,944 INFO L130 PetriNetUnfolder]: 2422/3619 cut-off events. [2023-08-29 20:12:24,945 INFO L131 PetriNetUnfolder]: For 552/552 co-relation queries the response was YES. [2023-08-29 20:12:24,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7784 conditions, 3619 events. 2422/3619 cut-off events. For 552/552 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17160 event pairs, 1222 based on Foata normal form. 120/3739 useless extension candidates. Maximal degree in co-relation 7777. Up to 3016 conditions per place. [2023-08-29 20:12:24,963 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 42 selfloop transitions, 6 changer transitions 9/57 dead transitions. [2023-08-29 20:12:24,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 282 flow [2023-08-29 20:12:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-29 20:12:24,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45847457627118643 [2023-08-29 20:12:24,966 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-29 20:12:24,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-29 20:12:25,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:25,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-29 20:12:25,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 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) [2023-08-29 20:12:25,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:25,004 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:25,004 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 78 flow. Second operand 5 states and 541 transitions. [2023-08-29 20:12:25,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 282 flow [2023-08-29 20:12:25,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:12:25,007 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 126 flow [2023-08-29 20:12:25,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-08-29 20:12:25,008 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-29 20:12:25,008 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 126 flow [2023-08-29 20:12:25,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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) [2023-08-29 20:12:25,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:25,009 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:25,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:12:25,009 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:25,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:25,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1035433971, now seen corresponding path program 1 times [2023-08-29 20:12:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:25,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789940206] [2023-08-29 20:12:25,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:25,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:25,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789940206] [2023-08-29 20:12:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789940206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:25,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:25,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:12:25,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085335366] [2023-08-29 20:12:25,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:25,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:12:25,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:12:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:12:25,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 236 [2023-08-29 20:12:25,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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) [2023-08-29 20:12:25,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:25,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 236 [2023-08-29 20:12:25,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:25,650 INFO L130 PetriNetUnfolder]: 2292/3425 cut-off events. [2023-08-29 20:12:25,650 INFO L131 PetriNetUnfolder]: For 3396/3396 co-relation queries the response was YES. [2023-08-29 20:12:25,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9083 conditions, 3425 events. 2292/3425 cut-off events. For 3396/3396 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15866 event pairs, 553 based on Foata normal form. 168/3593 useless extension candidates. Maximal degree in co-relation 9073. Up to 2049 conditions per place. [2023-08-29 20:12:25,671 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 50 selfloop transitions, 6 changer transitions 4/60 dead transitions. [2023-08-29 20:12:25,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 364 flow [2023-08-29 20:12:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:25,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-29 20:12:25,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45847457627118643 [2023-08-29 20:12:25,674 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-29 20:12:25,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-29 20:12:25,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:25,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-29 20:12:25,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 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) [2023-08-29 20:12:25,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:25,678 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:25,679 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 126 flow. Second operand 5 states and 541 transitions. [2023-08-29 20:12:25,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 364 flow [2023-08-29 20:12:25,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 351 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:12:25,697 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 166 flow [2023-08-29 20:12:25,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-08-29 20:12:25,698 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-29 20:12:25,698 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 166 flow [2023-08-29 20:12:25,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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) [2023-08-29 20:12:25,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:25,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:25,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:12:25,699 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:25,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:25,699 INFO L85 PathProgramCache]: Analyzing trace with hash 609275596, now seen corresponding path program 1 times [2023-08-29 20:12:25,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:25,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50202174] [2023-08-29 20:12:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:25,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50202174] [2023-08-29 20:12:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50202174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:25,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:25,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:12:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574176320] [2023-08-29 20:12:25,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:25,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:12:25,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:25,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:12:25,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:12:26,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 236 [2023-08-29 20:12:26,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 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) [2023-08-29 20:12:26,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:26,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 236 [2023-08-29 20:12:26,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:26,443 INFO L130 PetriNetUnfolder]: 1424/2340 cut-off events. [2023-08-29 20:12:26,444 INFO L131 PetriNetUnfolder]: For 2602/2619 co-relation queries the response was YES. [2023-08-29 20:12:26,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 2340 events. 1424/2340 cut-off events. For 2602/2619 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12639 event pairs, 618 based on Foata normal form. 98/2398 useless extension candidates. Maximal degree in co-relation 6013. Up to 2089 conditions per place. [2023-08-29 20:12:26,459 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 24 selfloop transitions, 4 changer transitions 2/37 dead transitions. [2023-08-29 20:12:26,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 37 transitions, 220 flow [2023-08-29 20:12:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-08-29 20:12:26,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4211864406779661 [2023-08-29 20:12:26,462 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-08-29 20:12:26,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-08-29 20:12:26,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:26,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-08-29 20:12:26,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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) [2023-08-29 20:12:26,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:26,466 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:26,466 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 166 flow. Second operand 5 states and 497 transitions. [2023-08-29 20:12:26,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 37 transitions, 220 flow [2023-08-29 20:12:26,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 37 transitions, 209 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:12:26,472 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 125 flow [2023-08-29 20:12:26,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2023-08-29 20:12:26,472 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-08-29 20:12:26,473 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 125 flow [2023-08-29 20:12:26,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 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) [2023-08-29 20:12:26,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:26,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:26,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:12:26,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:26,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:26,474 INFO L85 PathProgramCache]: Analyzing trace with hash -934038003, now seen corresponding path program 1 times [2023-08-29 20:12:26,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:26,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464184930] [2023-08-29 20:12:26,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:26,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:26,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:26,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464184930] [2023-08-29 20:12:26,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464184930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:26,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:26,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:12:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789061967] [2023-08-29 20:12:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:26,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:12:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:26,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:12:26,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:12:26,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 236 [2023-08-29 20:12:26,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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) [2023-08-29 20:12:26,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:26,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 236 [2023-08-29 20:12:26,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:27,053 INFO L130 PetriNetUnfolder]: 1790/2699 cut-off events. [2023-08-29 20:12:27,054 INFO L131 PetriNetUnfolder]: For 2359/2359 co-relation queries the response was YES. [2023-08-29 20:12:27,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 2699 events. 1790/2699 cut-off events. For 2359/2359 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12250 event pairs, 811 based on Foata normal form. 80/2779 useless extension candidates. Maximal degree in co-relation 7057. Up to 2036 conditions per place. [2023-08-29 20:12:27,072 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 34 selfloop transitions, 5 changer transitions 17/56 dead transitions. [2023-08-29 20:12:27,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 323 flow [2023-08-29 20:12:27,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 538 transitions. [2023-08-29 20:12:27,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559322033898305 [2023-08-29 20:12:27,075 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 538 transitions. [2023-08-29 20:12:27,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 538 transitions. [2023-08-29 20:12:27,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:27,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 538 transitions. [2023-08-29 20:12:27,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 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) [2023-08-29 20:12:27,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:27,079 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:27,079 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 125 flow. Second operand 5 states and 538 transitions. [2023-08-29 20:12:27,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 323 flow [2023-08-29 20:12:27,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 309 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-29 20:12:27,085 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 133 flow [2023-08-29 20:12:27,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=133, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-29 20:12:27,086 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-29 20:12:27,086 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 133 flow [2023-08-29 20:12:27,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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) [2023-08-29 20:12:27,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:27,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:27,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:12:27,087 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:27,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:27,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1272457718, now seen corresponding path program 1 times [2023-08-29 20:12:27,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:27,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119283717] [2023-08-29 20:12:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:27,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119283717] [2023-08-29 20:12:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119283717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:27,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:27,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:12:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843289425] [2023-08-29 20:12:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:27,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:12:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:27,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:12:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:12:27,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-08-29 20:12:27,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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) [2023-08-29 20:12:27,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:27,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-08-29 20:12:27,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:27,494 INFO L130 PetriNetUnfolder]: 637/1122 cut-off events. [2023-08-29 20:12:27,494 INFO L131 PetriNetUnfolder]: For 572/585 co-relation queries the response was YES. [2023-08-29 20:12:27,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1122 events. 637/1122 cut-off events. For 572/585 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5562 event pairs, 161 based on Foata normal form. 60/1171 useless extension candidates. Maximal degree in co-relation 2865. Up to 910 conditions per place. [2023-08-29 20:12:27,503 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-29 20:12:27,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 249 flow [2023-08-29 20:12:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:12:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:12:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-29 20:12:27,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915254237288136 [2023-08-29 20:12:27,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-29 20:12:27,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-29 20:12:27,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:27,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-29 20:12:27,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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) [2023-08-29 20:12:27,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-29 20:12:27,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 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) [2023-08-29 20:12:27,508 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 133 flow. Second operand 3 states and 348 transitions. [2023-08-29 20:12:27,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 249 flow [2023-08-29 20:12:27,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 235 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-29 20:12:27,511 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 145 flow [2023-08-29 20:12:27,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-29 20:12:27,512 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-29 20:12:27,512 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 145 flow [2023-08-29 20:12:27,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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) [2023-08-29 20:12:27,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:27,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:27,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:12:27,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:27,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1633965920, now seen corresponding path program 1 times [2023-08-29 20:12:27,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:27,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811177365] [2023-08-29 20:12:27,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:27,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:27,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:27,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811177365] [2023-08-29 20:12:27,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811177365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:27,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:27,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:12:27,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118309047] [2023-08-29 20:12:27,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:27,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:12:27,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:27,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:12:27,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:12:27,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-08-29 20:12:27,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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) [2023-08-29 20:12:27,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:27,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-08-29 20:12:27,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:27,920 INFO L130 PetriNetUnfolder]: 285/579 cut-off events. [2023-08-29 20:12:27,920 INFO L131 PetriNetUnfolder]: For 239/245 co-relation queries the response was YES. [2023-08-29 20:12:27,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1720 conditions, 579 events. 285/579 cut-off events. For 239/245 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2704 event pairs, 79 based on Foata normal form. 63/633 useless extension candidates. Maximal degree in co-relation 1710. Up to 204 conditions per place. [2023-08-29 20:12:27,924 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 39 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-29 20:12:27,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 315 flow [2023-08-29 20:12:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:12:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:12:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-29 20:12:27,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915254237288136 [2023-08-29 20:12:27,927 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-29 20:12:27,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-29 20:12:27,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:27,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-29 20:12:27,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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) [2023-08-29 20:12:27,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-29 20:12:27,931 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 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) [2023-08-29 20:12:27,931 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 145 flow. Second operand 4 states and 464 transitions. [2023-08-29 20:12:27,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 315 flow [2023-08-29 20:12:27,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:12:27,933 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 181 flow [2023-08-29 20:12:27,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-08-29 20:12:27,934 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-29 20:12:27,934 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 181 flow [2023-08-29 20:12:27,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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) [2023-08-29 20:12:27,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:27,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:27,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:12:27,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:27,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1574906073, now seen corresponding path program 1 times [2023-08-29 20:12:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:27,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380434324] [2023-08-29 20:12:27,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:28,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:28,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380434324] [2023-08-29 20:12:28,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380434324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:28,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:28,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:12:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121249085] [2023-08-29 20:12:28,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:28,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:12:28,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:28,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:12:28,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:12:28,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 236 [2023-08-29 20:12:28,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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) [2023-08-29 20:12:28,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:28,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 236 [2023-08-29 20:12:28,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:28,464 INFO L130 PetriNetUnfolder]: 579/1082 cut-off events. [2023-08-29 20:12:28,464 INFO L131 PetriNetUnfolder]: For 1507/1507 co-relation queries the response was YES. [2023-08-29 20:12:28,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3726 conditions, 1082 events. 579/1082 cut-off events. For 1507/1507 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5283 event pairs, 155 based on Foata normal form. 14/1096 useless extension candidates. Maximal degree in co-relation 3715. Up to 606 conditions per place. [2023-08-29 20:12:28,470 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 53 selfloop transitions, 9 changer transitions 28/90 dead transitions. [2023-08-29 20:12:28,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 625 flow [2023-08-29 20:12:28,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:12:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:12:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 737 transitions. [2023-08-29 20:12:28,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44612590799031476 [2023-08-29 20:12:28,473 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 737 transitions. [2023-08-29 20:12:28,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 737 transitions. [2023-08-29 20:12:28,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:28,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 737 transitions. [2023-08-29 20:12:28,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 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) [2023-08-29 20:12:28,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 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) [2023-08-29 20:12:28,479 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 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) [2023-08-29 20:12:28,479 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 181 flow. Second operand 7 states and 737 transitions. [2023-08-29 20:12:28,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 625 flow [2023-08-29 20:12:28,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 591 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:12:28,483 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 210 flow [2023-08-29 20:12:28,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-08-29 20:12:28,483 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-08-29 20:12:28,484 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 210 flow [2023-08-29 20:12:28,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 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) [2023-08-29 20:12:28,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:28,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:28,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:12:28,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:28,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:28,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1858273731, now seen corresponding path program 2 times [2023-08-29 20:12:28,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:28,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497589785] [2023-08-29 20:12:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:28,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:28,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:28,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497589785] [2023-08-29 20:12:28,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497589785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:28,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:28,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:12:28,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235852215] [2023-08-29 20:12:28,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:28,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:12:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:28,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:12:28,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:12:28,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-08-29 20:12:28,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 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) [2023-08-29 20:12:28,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:28,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-08-29 20:12:28,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:28,888 INFO L130 PetriNetUnfolder]: 288/579 cut-off events. [2023-08-29 20:12:28,888 INFO L131 PetriNetUnfolder]: For 548/566 co-relation queries the response was YES. [2023-08-29 20:12:28,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 579 events. 288/579 cut-off events. For 548/566 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2934 event pairs, 74 based on Foata normal form. 35/597 useless extension candidates. Maximal degree in co-relation 1823. Up to 238 conditions per place. [2023-08-29 20:12:28,891 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 35 selfloop transitions, 10 changer transitions 6/56 dead transitions. [2023-08-29 20:12:28,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 378 flow [2023-08-29 20:12:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2023-08-29 20:12:28,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822033898305085 [2023-08-29 20:12:28,894 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2023-08-29 20:12:28,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2023-08-29 20:12:28,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:28,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2023-08-29 20:12:28,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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) [2023-08-29 20:12:28,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:28,898 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:28,898 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 210 flow. Second operand 5 states and 569 transitions. [2023-08-29 20:12:28,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 378 flow [2023-08-29 20:12:28,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 351 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-29 20:12:28,901 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 177 flow [2023-08-29 20:12:28,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=53, PETRI_TRANSITIONS=32} [2023-08-29 20:12:28,902 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-08-29 20:12:28,902 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 177 flow [2023-08-29 20:12:28,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 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) [2023-08-29 20:12:28,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:28,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:28,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:12:28,903 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:28,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash 300637192, now seen corresponding path program 1 times [2023-08-29 20:12:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:28,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435740226] [2023-08-29 20:12:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:29,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:29,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435740226] [2023-08-29 20:12:29,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435740226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:29,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:29,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:12:29,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100679950] [2023-08-29 20:12:29,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:29,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:12:29,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:29,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:12:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:12:29,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-29 20:12:29,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 32 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 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) [2023-08-29 20:12:29,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:29,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-29 20:12:29,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:29,296 INFO L130 PetriNetUnfolder]: 194/421 cut-off events. [2023-08-29 20:12:29,296 INFO L131 PetriNetUnfolder]: For 831/831 co-relation queries the response was YES. [2023-08-29 20:12:29,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 421 events. 194/421 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1893 event pairs, 58 based on Foata normal form. 2/423 useless extension candidates. Maximal degree in co-relation 1454. Up to 230 conditions per place. [2023-08-29 20:12:29,298 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 27 selfloop transitions, 1 changer transitions 31/61 dead transitions. [2023-08-29 20:12:29,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 452 flow [2023-08-29 20:12:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 547 transitions. [2023-08-29 20:12:29,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4635593220338983 [2023-08-29 20:12:29,300 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 547 transitions. [2023-08-29 20:12:29,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 547 transitions. [2023-08-29 20:12:29,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:29,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 547 transitions. [2023-08-29 20:12:29,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 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) [2023-08-29 20:12:29,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:29,304 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 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) [2023-08-29 20:12:29,304 INFO L175 Difference]: Start difference. First operand has 53 places, 32 transitions, 177 flow. Second operand 5 states and 547 transitions. [2023-08-29 20:12:29,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 452 flow [2023-08-29 20:12:29,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 386 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-08-29 20:12:29,307 INFO L231 Difference]: Finished difference. Result has 53 places, 28 transitions, 132 flow [2023-08-29 20:12:29,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=53, PETRI_TRANSITIONS=28} [2023-08-29 20:12:29,309 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2023-08-29 20:12:29,309 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 28 transitions, 132 flow [2023-08-29 20:12:29,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 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) [2023-08-29 20:12:29,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:29,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:29,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:12:29,310 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:29,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1680905142, now seen corresponding path program 2 times [2023-08-29 20:12:29,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:29,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109087385] [2023-08-29 20:12:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:29,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:30,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:12:30,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109087385] [2023-08-29 20:12:30,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109087385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:30,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:30,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:12:30,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655380873] [2023-08-29 20:12:30,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:30,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:12:30,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:12:30,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:12:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:12:30,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 236 [2023-08-29 20:12:30,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 28 transitions, 132 flow. Second operand has 8 states, 8 states have (on average 101.375) internal successors, (811), 8 states have internal predecessors, (811), 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) [2023-08-29 20:12:30,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:30,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 236 [2023-08-29 20:12:30,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:30,533 INFO L130 PetriNetUnfolder]: 66/166 cut-off events. [2023-08-29 20:12:30,533 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2023-08-29 20:12:30,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 166 events. 66/166 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 577 event pairs, 11 based on Foata normal form. 1/161 useless extension candidates. Maximal degree in co-relation 539. Up to 59 conditions per place. [2023-08-29 20:12:30,534 INFO L137 encePairwiseOnDemand]: 228/236 looper letters, 22 selfloop transitions, 4 changer transitions 24/53 dead transitions. [2023-08-29 20:12:30,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 358 flow [2023-08-29 20:12:30,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:12:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:12:30,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 928 transitions. [2023-08-29 20:12:30,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369114877589454 [2023-08-29 20:12:30,537 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 928 transitions. [2023-08-29 20:12:30,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 928 transitions. [2023-08-29 20:12:30,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:30,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 928 transitions. [2023-08-29 20:12:30,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.11111111111111) internal successors, (928), 9 states have internal predecessors, (928), 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) [2023-08-29 20:12:30,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 236.0) internal successors, (2360), 10 states have internal predecessors, (2360), 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) [2023-08-29 20:12:30,543 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 236.0) internal successors, (2360), 10 states have internal predecessors, (2360), 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) [2023-08-29 20:12:30,544 INFO L175 Difference]: Start difference. First operand has 53 places, 28 transitions, 132 flow. Second operand 9 states and 928 transitions. [2023-08-29 20:12:30,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 358 flow [2023-08-29 20:12:30,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 336 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-29 20:12:30,546 INFO L231 Difference]: Finished difference. Result has 56 places, 28 transitions, 135 flow [2023-08-29 20:12:30,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=135, PETRI_PLACES=56, PETRI_TRANSITIONS=28} [2023-08-29 20:12:30,546 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2023-08-29 20:12:30,547 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 28 transitions, 135 flow [2023-08-29 20:12:30,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.375) internal successors, (811), 8 states have internal predecessors, (811), 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) [2023-08-29 20:12:30,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:30,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:30,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:12:30,548 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:30,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2118210070, now seen corresponding path program 3 times [2023-08-29 20:12:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:12:30,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203943672] [2023-08-29 20:12:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:12:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:12:30,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:12:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:12:30,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:12:30,655 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:12:30,656 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:12:30,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:12:30,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:12:30,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:12:30,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:12:30,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:12:30,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:12:30,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:12:30,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:12:30,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:12:30,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:12:30,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:12:30,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:12:30,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:12:30,661 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:30,666 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:12:30,666 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:12:30,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:12:30 BasicIcfg [2023-08-29 20:12:30,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:12:30,726 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:12:30,726 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:12:30,727 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:12:30,727 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:12:18" (3/4) ... [2023-08-29 20:12:30,729 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:12:30,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:12:30,730 INFO L158 Benchmark]: Toolchain (without parser) took 14081.50ms. Allocated memory was 69.2MB in the beginning and 591.4MB in the end (delta: 522.2MB). Free memory was 44.7MB in the beginning and 445.7MB in the end (delta: -401.0MB). Peak memory consumption was 124.3MB. Max. memory is 16.1GB. [2023-08-29 20:12:30,730 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 69.2MB. Free memory was 46.6MB in the beginning and 46.6MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:12:30,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.05ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 44.5MB in the beginning and 62.9MB in the end (delta: -18.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2023-08-29 20:12:30,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.35ms. Allocated memory is still 94.4MB. Free memory was 62.9MB in the beginning and 59.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:12:30,731 INFO L158 Benchmark]: Boogie Preprocessor took 60.47ms. Allocated memory is still 94.4MB. Free memory was 59.9MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:12:30,731 INFO L158 Benchmark]: RCFGBuilder took 788.51ms. Allocated memory is still 94.4MB. Free memory was 57.8MB in the beginning and 48.7MB in the end (delta: 9.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2023-08-29 20:12:30,732 INFO L158 Benchmark]: TraceAbstraction took 12591.05ms. Allocated memory was 94.4MB in the beginning and 591.4MB in the end (delta: 497.0MB). Free memory was 48.2MB in the beginning and 445.7MB in the end (delta: -397.6MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2023-08-29 20:12:30,732 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 591.4MB. Free memory is still 445.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:12:30,733 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.20ms. Allocated memory is still 69.2MB. Free memory was 46.6MB in the beginning and 46.6MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.05ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 44.5MB in the beginning and 62.9MB in the end (delta: -18.4MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.35ms. Allocated memory is still 94.4MB. Free memory was 62.9MB in the beginning and 59.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.47ms. Allocated memory is still 94.4MB. Free memory was 59.9MB in the beginning and 57.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 788.51ms. Allocated memory is still 94.4MB. Free memory was 57.8MB in the beginning and 48.7MB in the end (delta: 9.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12591.05ms. Allocated memory was 94.4MB in the beginning and 591.4MB in the end (delta: 497.0MB). Free memory was 48.2MB in the beginning and 445.7MB in the end (delta: -397.6MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 591.4MB. Free memory is still 445.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 126 PlacesBefore, 42 PlacesAfterwards, 118 TransitionsBefore, 33 TransitionsAfterwards, 2068 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 5574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2696, independent: 2510, independent conditional: 0, independent unconditional: 2510, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1111, independent: 1081, independent conditional: 0, independent unconditional: 1081, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2696, independent: 1429, independent conditional: 0, independent unconditional: 1429, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1111, unknown conditional: 0, unknown unconditional: 1111] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t65, ((void *)0), P0, ((void *)0))=7, t65={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t66, ((void *)0), P1, ((void *)0))=8, t65={5:0}, t66={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t67, ((void *)0), P2, ((void *)0))=9, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L749] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L767] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65={5:0}, t66={6:0}, t67={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 688 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 386 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 264 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1784 IncrementalHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 122 mSDtfsCounter, 1784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=10, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 1430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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 [2023-08-29 20:12:30,767 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 ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.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 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:12:32,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:12:32,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:12:32,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:12:32,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:12:32,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:12:32,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:12:32,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:12:32,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:12:32,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:12:32,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:12:32,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:12:32,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:12:32,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:12:32,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:12:32,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:12:32,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:12:32,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:12:32,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:12:32,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:12:32,748 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:12:32,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:12:32,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:12:32,750 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:12:32,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:12:32,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:12:32,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:12:32,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:12:32,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:12:32,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:12:32,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:12:32,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:12:32,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:12:32,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:12:32,769 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:12:32,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:12:32,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:12:32,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:12:32,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:12:32,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:12:32,771 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:12:32,772 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:12:32,803 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:12:32,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:12:32,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:12:32,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:12:32,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:12:32,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:12:32,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:12:32,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:12:32,806 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:12:32,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:12:32,807 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:12:32,807 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:12:32,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:12:32,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:12:32,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:12:32,808 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:12:32,808 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:12:32,808 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:12:32,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:12:32,809 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:12:32,809 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:12:32,809 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:12:32,809 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:12:32,809 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:12:32,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:12:32,810 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:12:32,810 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:12:32,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:12:32,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:12:32,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:12:32,811 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:12:32,811 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:12:32,811 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:12:32,811 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:12:32,811 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:12:32,811 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:12:32,812 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:12:32,812 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 80bd490b89eb696c85e417e2f0348670cfb7c8195637276a01d1016d9277f95a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:12:33,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:12:33,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:12:33,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:12:33,156 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:12:33,156 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:12:33,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-29 20:12:34,513 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:12:34,779 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:12:34,779 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-29 20:12:34,795 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdd0da88/9913ce4e6ea94c48a2d1a1ab52b6eda3/FLAG93e0a7e68 [2023-08-29 20:12:34,809 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afdd0da88/9913ce4e6ea94c48a2d1a1ab52b6eda3 [2023-08-29 20:12:34,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:12:34,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:12:34,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:12:34,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:12:34,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:12:34,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:12:34" (1/1) ... [2023-08-29 20:12:34,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46dc560d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:34, skipping insertion in model container [2023-08-29 20:12:34,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:12:34" (1/1) ... [2023-08-29 20:12:34,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:12:34,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:12:35,011 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2023-08-29 20:12:35,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:12:35,256 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:12:35,267 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2023-08-29 20:12:35,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:12:35,349 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:12:35,349 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:12:35,355 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:12:35,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35 WrapperNode [2023-08-29 20:12:35,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:12:35,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:12:35,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:12:35,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:12:35,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,431 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-29 20:12:35,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:12:35,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:12:35,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:12:35,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:12:35,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,488 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:12:35,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:12:35,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:12:35,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:12:35,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (1/1) ... [2023-08-29 20:12:35,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:12:35,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:12:35,538 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) [2023-08-29 20:12:35,568 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 [2023-08-29 20:12:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:12:35,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:12:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:12:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:12:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:12:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:12:35,583 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:12:35,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:12:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:12:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:12:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:12:35,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:12:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:12:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:12:35,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:12:35,586 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:12:35,795 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:12:35,797 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:12:36,170 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:12:36,388 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:12:36,393 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:12:36,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:12:36 BoogieIcfgContainer [2023-08-29 20:12:36,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:12:36,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:12:36,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:12:36,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:12:36,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:12:34" (1/3) ... [2023-08-29 20:12:36,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2968f829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:12:36, skipping insertion in model container [2023-08-29 20:12:36,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:12:35" (2/3) ... [2023-08-29 20:12:36,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2968f829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:12:36, skipping insertion in model container [2023-08-29 20:12:36,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:12:36" (3/3) ... [2023-08-29 20:12:36,404 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2023-08-29 20:12:36,419 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:12:36,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:12:36,420 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:12:36,516 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:12:36,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2023-08-29 20:12:36,629 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2023-08-29 20:12:36,629 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:12:36,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:12:36,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2023-08-29 20:12:36,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2023-08-29 20:12:36,645 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:12:36,657 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 119 transitions, 247 flow [2023-08-29 20:12:36,661 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 119 transitions, 247 flow [2023-08-29 20:12:36,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 247 flow [2023-08-29 20:12:36,700 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2023-08-29 20:12:36,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:12:36,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:12:36,704 INFO L119 LiptonReduction]: Number of co-enabled transitions 2068 [2023-08-29 20:12:42,364 INFO L134 LiptonReduction]: Checked pairs total: 6015 [2023-08-29 20:12:42,365 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-29 20:12:42,376 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:12:42,382 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@30910224, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:12:42,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:12:42,384 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:12:42,384 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:12:42,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:42,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:12:42,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:42,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 1 times [2023-08-29 20:12:42,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:12:42,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893435008] [2023-08-29 20:12:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:42,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:42,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:12:42,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:12:42,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:12:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:42,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:12:42,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:12:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:42,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:12:42,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:12:42,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893435008] [2023-08-29 20:12:42,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893435008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:42,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:42,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:12:42,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234709053] [2023-08-29 20:12:42,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:42,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:12:42,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:12:42,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:12:42,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:12:42,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-08-29 20:12:42,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 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) [2023-08-29 20:12:42,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:42,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-08-29 20:12:42,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:42,922 INFO L130 PetriNetUnfolder]: 1263/1913 cut-off events. [2023-08-29 20:12:42,923 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2023-08-29 20:12:42,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 1913 events. 1263/1913 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9424 event pairs, 1263 based on Foata normal form. 72/1648 useless extension candidates. Maximal degree in co-relation 3809. Up to 1871 conditions per place. [2023-08-29 20:12:42,940 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-29 20:12:42,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-29 20:12:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:12:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:12:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2023-08-29 20:12:42,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5252100840336135 [2023-08-29 20:12:42,958 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2023-08-29 20:12:42,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2023-08-29 20:12:42,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:42,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2023-08-29 20:12:42,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 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) [2023-08-29 20:12:42,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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) [2023-08-29 20:12:42,972 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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) [2023-08-29 20:12:42,973 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 250 transitions. [2023-08-29 20:12:42,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-29 20:12:42,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:12:42,981 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-29 20:12:42,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-29 20:12:42,985 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:12:42,986 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-29 20:12:42,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 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) [2023-08-29 20:12:42,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:42,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:42,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:12:43,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:43,194 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:43,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1866706013, now seen corresponding path program 1 times [2023-08-29 20:12:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:12:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801699402] [2023-08-29 20:12:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:43,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:43,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:12:43,198 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:12:43,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:12:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:43,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:12:43,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:12:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:43,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:12:43,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:12:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801699402] [2023-08-29 20:12:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801699402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:43,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:43,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:12:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385650751] [2023-08-29 20:12:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:43,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:12:43,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:12:43,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:12:43,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:12:43,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-08-29 20:12:43,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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) [2023-08-29 20:12:43,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:43,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-08-29 20:12:43,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:43,641 INFO L130 PetriNetUnfolder]: 1043/1657 cut-off events. [2023-08-29 20:12:43,642 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:12:43,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 1657 events. 1043/1657 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8587 event pairs, 163 based on Foata normal form. 0/1473 useless extension candidates. Maximal degree in co-relation 3243. Up to 1265 conditions per place. [2023-08-29 20:12:43,649 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 28 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-08-29 20:12:43,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 148 flow [2023-08-29 20:12:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:12:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:12:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-29 20:12:43,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070028011204482 [2023-08-29 20:12:43,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-29 20:12:43,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-29 20:12:43,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:43,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-29 20:12:43,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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) [2023-08-29 20:12:43,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-08-29 20:12:43,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-08-29 20:12:43,674 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 362 transitions. [2023-08-29 20:12:43,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 148 flow [2023-08-29 20:12:43,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:12:43,675 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-29 20:12:43,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-29 20:12:43,677 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-29 20:12:43,677 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-29 20:12:43,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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) [2023-08-29 20:12:43,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:43,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:43,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:12:43,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:43,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:43,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash 199952220, now seen corresponding path program 1 times [2023-08-29 20:12:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:12:43,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766286368] [2023-08-29 20:12:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:43,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:43,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:12:43,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:12:43,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:12:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:43,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:12:43,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:12:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:44,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:12:44,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:12:44,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766286368] [2023-08-29 20:12:44,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766286368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:44,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:44,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:12:44,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146457538] [2023-08-29 20:12:44,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:44,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:12:44,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:12:44,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:12:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:12:44,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-08-29 20:12:44,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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) [2023-08-29 20:12:44,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:44,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-08-29 20:12:44,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:44,171 INFO L130 PetriNetUnfolder]: 417/699 cut-off events. [2023-08-29 20:12:44,171 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-29 20:12:44,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 699 events. 417/699 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3072 event pairs, 95 based on Foata normal form. 24/684 useless extension candidates. Maximal degree in co-relation 1462. Up to 609 conditions per place. [2023-08-29 20:12:44,182 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 29 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-08-29 20:12:44,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 154 flow [2023-08-29 20:12:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:12:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:12:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-29 20:12:44,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49299719887955185 [2023-08-29 20:12:44,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-29 20:12:44,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-29 20:12:44,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:44,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-29 20:12:44,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2023-08-29 20:12:44,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-08-29 20:12:44,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 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) [2023-08-29 20:12:44,188 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 3 states and 352 transitions. [2023-08-29 20:12:44,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 154 flow [2023-08-29 20:12:44,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:12:44,191 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 78 flow [2023-08-29 20:12:44,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-29 20:12:44,192 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:12:44,192 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 78 flow [2023-08-29 20:12:44,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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) [2023-08-29 20:12:44,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:44,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:44,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:12:44,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:44,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:44,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash -581434441, now seen corresponding path program 1 times [2023-08-29 20:12:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:12:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926680326] [2023-08-29 20:12:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:44,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:12:44,407 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:12:44,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:12:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:44,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:12:44,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:12:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:44,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:12:44,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:12:44,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926680326] [2023-08-29 20:12:44,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926680326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:44,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:44,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:12:44,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320823912] [2023-08-29 20:12:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:44,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:12:44,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:12:44,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:12:44,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:12:44,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-08-29 20:12:44,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-08-29 20:12:44,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:44,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-08-29 20:12:44,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:44,712 INFO L130 PetriNetUnfolder]: 157/309 cut-off events. [2023-08-29 20:12:44,712 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-29 20:12:44,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 309 events. 157/309 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1159 event pairs, 44 based on Foata normal form. 26/322 useless extension candidates. Maximal degree in co-relation 766. Up to 129 conditions per place. [2023-08-29 20:12:44,714 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 37 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-29 20:12:44,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 220 flow [2023-08-29 20:12:44,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:12:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:12:44,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-08-29 20:12:44,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49264705882352944 [2023-08-29 20:12:44,716 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-08-29 20:12:44,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-08-29 20:12:44,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:44,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-08-29 20:12:44,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 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) [2023-08-29 20:12:44,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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) [2023-08-29 20:12:44,720 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 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) [2023-08-29 20:12:44,721 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 78 flow. Second operand 4 states and 469 transitions. [2023-08-29 20:12:44,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 220 flow [2023-08-29 20:12:44,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:12:44,723 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 114 flow [2023-08-29 20:12:44,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-08-29 20:12:44,724 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2023-08-29 20:12:44,725 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 114 flow [2023-08-29 20:12:44,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-08-29 20:12:44,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:44,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:44,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:12:44,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:44,935 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:44,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash 789009269, now seen corresponding path program 1 times [2023-08-29 20:12:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:12:44,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611858990] [2023-08-29 20:12:44,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:44,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:44,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:12:44,938 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:12:44,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:12:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:45,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:12:45,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:12:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:45,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:12:45,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:12:45,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611858990] [2023-08-29 20:12:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611858990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:45,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:45,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:12:45,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266535871] [2023-08-29 20:12:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:45,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:12:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:12:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:12:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:12:45,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2023-08-29 20:12:45,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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) [2023-08-29 20:12:45,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:45,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2023-08-29 20:12:45,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:45,277 INFO L130 PetriNetUnfolder]: 112/219 cut-off events. [2023-08-29 20:12:45,277 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-29 20:12:45,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 219 events. 112/219 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 761 event pairs, 39 based on Foata normal form. 9/224 useless extension candidates. Maximal degree in co-relation 611. Up to 90 conditions per place. [2023-08-29 20:12:45,279 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 34 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-08-29 20:12:45,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 244 flow [2023-08-29 20:12:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-08-29 20:12:45,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831932773109244 [2023-08-29 20:12:45,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-08-29 20:12:45,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-08-29 20:12:45,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:45,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-08-29 20:12:45,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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) [2023-08-29 20:12:45,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-08-29 20:12:45,287 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-08-29 20:12:45,287 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 114 flow. Second operand 5 states and 575 transitions. [2023-08-29 20:12:45,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 244 flow [2023-08-29 20:12:45,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 230 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 20:12:45,290 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 128 flow [2023-08-29 20:12:45,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-29 20:12:45,292 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-08-29 20:12:45,292 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 128 flow [2023-08-29 20:12:45,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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) [2023-08-29 20:12:45,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:45,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:45,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:12:45,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:45,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:45,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1521027025, now seen corresponding path program 1 times [2023-08-29 20:12:45,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:12:45,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933293327] [2023-08-29 20:12:45,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:45,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:45,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:12:45,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:12:45,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:12:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:45,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:12:45,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:12:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:45,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:12:45,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:12:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933293327] [2023-08-29 20:12:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933293327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:45,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:45,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:12:45,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281398437] [2023-08-29 20:12:45,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:45,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:12:45,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:12:45,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:12:45,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:12:45,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2023-08-29 20:12:45,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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) [2023-08-29 20:12:45,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:45,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2023-08-29 20:12:45,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:45,859 INFO L130 PetriNetUnfolder]: 151/307 cut-off events. [2023-08-29 20:12:45,860 INFO L131 PetriNetUnfolder]: For 389/389 co-relation queries the response was YES. [2023-08-29 20:12:45,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 307 events. 151/307 cut-off events. For 389/389 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1257 event pairs, 28 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 892. Up to 173 conditions per place. [2023-08-29 20:12:45,862 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 54 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-29 20:12:45,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 388 flow [2023-08-29 20:12:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2023-08-29 20:12:45,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781512605042017 [2023-08-29 20:12:45,865 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2023-08-29 20:12:45,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2023-08-29 20:12:45,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:45,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2023-08-29 20:12:45,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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) [2023-08-29 20:12:45,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-08-29 20:12:45,870 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-08-29 20:12:45,870 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 128 flow. Second operand 5 states and 569 transitions. [2023-08-29 20:12:45,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 388 flow [2023-08-29 20:12:45,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 332 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-29 20:12:45,874 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 123 flow [2023-08-29 20:12:45,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-29 20:12:45,874 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-29 20:12:45,874 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 123 flow [2023-08-29 20:12:45,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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) [2023-08-29 20:12:45,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:45,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:45,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:12:46,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:46,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:46,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:46,086 INFO L85 PathProgramCache]: Analyzing trace with hash -826515337, now seen corresponding path program 2 times [2023-08-29 20:12:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:12:46,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695098655] [2023-08-29 20:12:46,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:12:46,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:46,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:12:46,088 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:12:46,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:12:46,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:12:46,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:12:46,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:12:46,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:12:46,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:46,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:12:46,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:12:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695098655] [2023-08-29 20:12:46,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695098655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:46,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:46,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:12:46,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514333813] [2023-08-29 20:12:46,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:46,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:12:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:12:46,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:12:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:12:46,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2023-08-29 20:12:46,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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) [2023-08-29 20:12:46,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:46,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2023-08-29 20:12:46,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:46,449 INFO L130 PetriNetUnfolder]: 260/521 cut-off events. [2023-08-29 20:12:46,449 INFO L131 PetriNetUnfolder]: For 366/366 co-relation queries the response was YES. [2023-08-29 20:12:46,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 521 events. 260/521 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2427 event pairs, 47 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 1456. Up to 264 conditions per place. [2023-08-29 20:12:46,452 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 55 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-08-29 20:12:46,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 368 flow [2023-08-29 20:12:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2023-08-29 20:12:46,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781512605042017 [2023-08-29 20:12:46,455 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2023-08-29 20:12:46,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2023-08-29 20:12:46,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:46,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2023-08-29 20:12:46,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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) [2023-08-29 20:12:46,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-08-29 20:12:46,459 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-08-29 20:12:46,459 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 123 flow. Second operand 5 states and 569 transitions. [2023-08-29 20:12:46,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 368 flow [2023-08-29 20:12:46,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:12:46,463 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 157 flow [2023-08-29 20:12:46,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-08-29 20:12:46,463 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-08-29 20:12:46,464 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 157 flow [2023-08-29 20:12:46,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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) [2023-08-29 20:12:46,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:46,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:46,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:12:46,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:46,674 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:46,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:46,674 INFO L85 PathProgramCache]: Analyzing trace with hash -19377050, now seen corresponding path program 1 times [2023-08-29 20:12:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:12:46,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182485453] [2023-08-29 20:12:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:12:46,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:46,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:12:46,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:12:46,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:12:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:12:46,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:12:46,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:12:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:12:47,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:12:47,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:12:47,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182485453] [2023-08-29 20:12:47,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182485453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:12:47,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:12:47,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:12:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85318563] [2023-08-29 20:12:47,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:12:47,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:12:47,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:12:47,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:12:47,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:12:47,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 238 [2023-08-29 20:12:47,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 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) [2023-08-29 20:12:47,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:12:47,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 238 [2023-08-29 20:12:47,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:12:47,607 INFO L130 PetriNetUnfolder]: 206/423 cut-off events. [2023-08-29 20:12:47,607 INFO L131 PetriNetUnfolder]: For 491/491 co-relation queries the response was YES. [2023-08-29 20:12:47,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 423 events. 206/423 cut-off events. For 491/491 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2040 event pairs, 30 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 1291. Up to 357 conditions per place. [2023-08-29 20:12:47,609 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 22 selfloop transitions, 3 changer transitions 14/42 dead transitions. [2023-08-29 20:12:47,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 274 flow [2023-08-29 20:12:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:12:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:12:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2023-08-29 20:12:47,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176470588235294 [2023-08-29 20:12:47,611 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2023-08-29 20:12:47,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2023-08-29 20:12:47,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:12:47,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2023-08-29 20:12:47,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 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) [2023-08-29 20:12:47,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-08-29 20:12:47,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 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) [2023-08-29 20:12:47,615 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 157 flow. Second operand 5 states and 497 transitions. [2023-08-29 20:12:47,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 274 flow [2023-08-29 20:12:47,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 42 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:12:47,618 INFO L231 Difference]: Finished difference. Result has 52 places, 28 transitions, 122 flow [2023-08-29 20:12:47,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=52, PETRI_TRANSITIONS=28} [2023-08-29 20:12:47,618 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-08-29 20:12:47,619 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 28 transitions, 122 flow [2023-08-29 20:12:47,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 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) [2023-08-29 20:12:47,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:12:47,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:47,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:12:47,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:47,829 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:12:47,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:12:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash 2093676771, now seen corresponding path program 3 times [2023-08-29 20:12:47,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:12:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768265456] [2023-08-29 20:12:47,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:12:47,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:47,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:12:47,832 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:12:47,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:12:47,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:12:47,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:12:47,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:12:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:12:48,083 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:12:48,083 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:12:48,084 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:12:48,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:12:48,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:12:48,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:12:48,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:12:48,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:12:48,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:12:48,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:12:48,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:12:48,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:12:48,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:12:48,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:12:48,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:12:48,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:12:48,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:12:48,298 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-29 20:12:48,302 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:12:48,302 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:12:48,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:12:48 BasicIcfg [2023-08-29 20:12:48,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:12:48,365 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:12:48,366 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:12:48,366 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:12:48,366 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:12:36" (3/4) ... [2023-08-29 20:12:48,368 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:12:48,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:12:48,368 INFO L158 Benchmark]: Toolchain (without parser) took 13555.61ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 36.4MB in the beginning and 58.4MB in the end (delta: -22.0MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2023-08-29 20:12:48,369 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 71.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:12:48,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.01ms. Allocated memory is still 71.3MB. Free memory was 36.1MB in the beginning and 33.3MB in the end (delta: 2.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2023-08-29 20:12:48,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.44ms. Allocated memory is still 71.3MB. Free memory was 33.3MB in the beginning and 30.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:12:48,369 INFO L158 Benchmark]: Boogie Preprocessor took 68.13ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 30.5MB in the beginning and 70.7MB in the end (delta: -40.2MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2023-08-29 20:12:48,370 INFO L158 Benchmark]: RCFGBuilder took 894.80ms. Allocated memory is still 92.3MB. Free memory was 70.7MB in the beginning and 54.4MB in the end (delta: 16.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-08-29 20:12:48,370 INFO L158 Benchmark]: TraceAbstraction took 11967.56ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 53.8MB in the beginning and 58.4MB in the end (delta: -4.6MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2023-08-29 20:12:48,370 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 134.2MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:12:48,375 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.17ms. Allocated memory is still 71.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 540.01ms. Allocated memory is still 71.3MB. Free memory was 36.1MB in the beginning and 33.3MB in the end (delta: 2.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.44ms. Allocated memory is still 71.3MB. Free memory was 33.3MB in the beginning and 30.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.13ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 30.5MB in the beginning and 70.7MB in the end (delta: -40.2MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * RCFGBuilder took 894.80ms. Allocated memory is still 92.3MB. Free memory was 70.7MB in the beginning and 54.4MB in the end (delta: 16.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11967.56ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 53.8MB in the beginning and 58.4MB in the end (delta: -4.6MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 134.2MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 127 PlacesBefore, 42 PlacesAfterwards, 119 TransitionsBefore, 33 TransitionsAfterwards, 2068 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 6015 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2857, independent: 2665, independent conditional: 0, independent unconditional: 2665, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1132, independent: 1102, independent conditional: 0, independent unconditional: 1102, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2857, independent: 1563, independent conditional: 0, independent unconditional: 1563, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1132, unknown conditional: 0, unknown unconditional: 1132] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 105, Positive conditional cache size: 0, Positive unconditional cache size: 105, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t65, ((void *)0), P0, ((void *)0))=0, t65={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t66, ((void *)0), P1, ((void *)0))=1, t65={3:0}, t66={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t67, ((void *)0), P2, ((void *)0))=2, t65={3:0}, t66={7:0}, t67={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L749] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t65={3:0}, t66={7:0}, t67={11:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 835 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 6 mSDtfsCounter, 835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=7, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 106 ConstructedInterpolants, 17 QuantifiedInterpolants, 939 SizeOfPredicates, 6 NumberOfNonLiveVariables, 977 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 [2023-08-29 20:12:48,405 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