./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix046.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/mix046.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 f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --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:28:03,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:28:03,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:28:03,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:28:03,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:28:03,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:28:03,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:28:03,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:28:03,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:28:03,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:28:03,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:28:03,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:28:03,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:28:03,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:28:03,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:28:03,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:28:03,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:28:03,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:28:03,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:28:03,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:28:03,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:28:03,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:28:03,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:28:03,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:28:03,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:28:03,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:28:03,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:28:03,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:28:03,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:28:03,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:28:03,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:28:03,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:28:03,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:28:03,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:28:03,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:28:03,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:28:03,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:28:03,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:28:03,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:28:03,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:28:03,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:28:03,732 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:28:03,765 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:28:03,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:28:03,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:28:03,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:28:03,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:28:03,768 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:28:03,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:28:03,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:28:03,769 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:28:03,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:28:03,770 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:28:03,770 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:28:03,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:28:03,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:28:03,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:28:03,771 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:28:03,771 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:28:03,771 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:28:03,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:28:03,772 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:28:03,772 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:28:03,772 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:28:03,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:28:03,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:28:03,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:28:03,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:28:03,773 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:28:03,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:28:03,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:28:03,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:28:03,774 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:28:03,774 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:28:03,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:28:03,775 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:28:03,775 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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 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:28:04,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:28:04,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:28:04,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:28:04,109 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:28:04,109 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:28:04,111 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2023-08-29 20:28:05,329 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:28:05,594 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:28:05,594 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2023-08-29 20:28:05,606 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629791b40/d02b2bce56244f8f83d9a4a55e39d59a/FLAG5df65e5f4 [2023-08-29 20:28:05,620 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/629791b40/d02b2bce56244f8f83d9a4a55e39d59a [2023-08-29 20:28:05,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:28:05,623 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:28:05,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:28:05,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:28:05,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:28:05,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:28:05" (1/1) ... [2023-08-29 20:28:05,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e318ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:05, skipping insertion in model container [2023-08-29 20:28:05,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:28:05" (1/1) ... [2023-08-29 20:28:05,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:28:05,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:28:05,869 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/mix046.opt.i[944,957] [2023-08-29 20:28:06,090 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:28:06,101 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:28:06,112 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/mix046.opt.i[944,957] [2023-08-29 20:28:06,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:28:06,199 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:28:06,199 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:28:06,205 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:28:06,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06 WrapperNode [2023-08-29 20:28:06,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:28:06,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:28:06,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:28:06,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:28:06,214 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:28:06" (1/1) ... [2023-08-29 20:28:06,240 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:28:06" (1/1) ... [2023-08-29 20:28:06,273 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-29 20:28:06,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:28:06,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:28:06,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:28:06,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:28:06,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (1/1) ... [2023-08-29 20:28:06,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (1/1) ... [2023-08-29 20:28:06,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (1/1) ... [2023-08-29 20:28:06,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (1/1) ... [2023-08-29 20:28:06,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (1/1) ... [2023-08-29 20:28:06,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (1/1) ... [2023-08-29 20:28:06,337 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (1/1) ... [2023-08-29 20:28:06,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (1/1) ... [2023-08-29 20:28:06,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:28:06,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:28:06,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:28:06,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:28:06,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (1/1) ... [2023-08-29 20:28:06,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:28:06,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:28:06,372 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:28:06,388 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:28:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:28:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:28:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:28:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:28:06,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:28:06,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:28:06,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:28:06,407 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:28:06,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:28:06,407 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:28:06,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:28:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:28:06,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:28:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:28:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:28:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:28:06,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:28:06,409 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:28:06,618 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:28:06,620 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:28:06,943 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:28:07,068 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:28:07,069 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:28:07,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:28:07 BoogieIcfgContainer [2023-08-29 20:28:07,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:28:07,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:28:07,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:28:07,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:28:07,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:28:05" (1/3) ... [2023-08-29 20:28:07,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8c77ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:28:07, skipping insertion in model container [2023-08-29 20:28:07,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:28:06" (2/3) ... [2023-08-29 20:28:07,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8c77ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:28:07, skipping insertion in model container [2023-08-29 20:28:07,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:28:07" (3/3) ... [2023-08-29 20:28:07,079 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2023-08-29 20:28:07,093 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:28:07,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:28:07,095 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:28:07,171 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:28:07,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-29 20:28:07,273 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-29 20:28:07,273 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:28:07,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:28:07,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-29 20:28:07,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-29 20:28:07,289 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:28:07,299 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-29 20:28:07,301 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-29 20:28:07,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-29 20:28:07,329 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-29 20:28:07,330 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:28:07,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:28:07,333 INFO L119 LiptonReduction]: Number of co-enabled transitions 3258 [2023-08-29 20:28:11,865 INFO L134 LiptonReduction]: Checked pairs total: 8840 [2023-08-29 20:28:11,866 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-29 20:28:11,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:28:11,884 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;@17996667, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:28:11,884 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:28:11,886 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:28:11,886 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:28:11,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:11,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:28:11,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:11,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2023-08-29 20:28:11,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689876929] [2023-08-29 20:28:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:11,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:12,084 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:28:12,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:12,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689876929] [2023-08-29 20:28:12,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689876929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:12,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:12,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:28:12,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678948586] [2023-08-29 20:28:12,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:12,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:28:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:28:12,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:28:12,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 277 [2023-08-29 20:28:12,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 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:28:12,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:12,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 277 [2023-08-29 20:28:12,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:12,827 INFO L130 PetriNetUnfolder]: 4151/5767 cut-off events. [2023-08-29 20:28:12,828 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-29 20:28:12,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11559 conditions, 5767 events. 4151/5767 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 29860 event pairs, 4151 based on Foata normal form. 180/4998 useless extension candidates. Maximal degree in co-relation 11547. Up to 5689 conditions per place. [2023-08-29 20:28:12,873 INFO L137 encePairwiseOnDemand]: 268/277 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-29 20:28:12,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-08-29 20:28:12,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:28:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:28:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-29 20:28:12,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5288808664259927 [2023-08-29 20:28:12,895 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-29 20:28:12,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-29 20:28:12,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:12,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-29 20:28:12,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 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:28:12,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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:28:12,911 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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:28:12,913 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 293 transitions. [2023-08-29 20:28:12,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-08-29 20:28:12,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:28:12,920 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-29 20:28:12,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-29 20:28:12,928 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-29 20:28:12,928 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-29 20:28:12,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 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:28:12,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:12,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:28:12,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:28:12,934 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:12,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1727386017, now seen corresponding path program 1 times [2023-08-29 20:28:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:12,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281033869] [2023-08-29 20:28:12,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:13,391 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:28:13,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:13,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281033869] [2023-08-29 20:28:13,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281033869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:13,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:13,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:28:13,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888725154] [2023-08-29 20:28:13,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:13,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:28:13,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:13,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:28:13,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:28:13,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 277 [2023-08-29 20:28:13,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:28:13,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:13,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 277 [2023-08-29 20:28:13,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:13,937 INFO L130 PetriNetUnfolder]: 3299/5149 cut-off events. [2023-08-29 20:28:13,938 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:28:13,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9798 conditions, 5149 events. 3299/5149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31712 event pairs, 743 based on Foata normal form. 0/4704 useless extension candidates. Maximal degree in co-relation 9795. Up to 3421 conditions per place. [2023-08-29 20:28:13,965 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 33 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-29 20:28:13,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 174 flow [2023-08-29 20:28:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:28:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:28:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-29 20:28:13,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102286401925391 [2023-08-29 20:28:13,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-29 20:28:13,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-29 20:28:13,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:13,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-29 20:28:13,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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:28:13,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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:28:13,975 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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:28:13,975 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 424 transitions. [2023-08-29 20:28:13,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 174 flow [2023-08-29 20:28:13,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:28:13,977 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-29 20:28:13,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-29 20:28:13,978 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-29 20:28:13,978 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-29 20:28:13,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:28:13,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:13,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:28:13,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:28:13,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:13,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1738133616, now seen corresponding path program 1 times [2023-08-29 20:28:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832393417] [2023-08-29 20:28:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:14,831 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:28:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832393417] [2023-08-29 20:28:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832393417] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:14,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:28:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696998879] [2023-08-29 20:28:14,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:14,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:28:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:14,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:28:14,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:28:15,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 277 [2023-08-29 20:28:15,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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:28:15,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:15,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 277 [2023-08-29 20:28:15,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:15,600 INFO L130 PetriNetUnfolder]: 2594/3784 cut-off events. [2023-08-29 20:28:15,600 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2023-08-29 20:28:15,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7658 conditions, 3784 events. 2594/3784 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 19685 event pairs, 324 based on Foata normal form. 0/3784 useless extension candidates. Maximal degree in co-relation 7654. Up to 2097 conditions per place. [2023-08-29 20:28:15,625 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 42 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-29 20:28:15,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 208 flow [2023-08-29 20:28:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:28:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:28:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2023-08-29 20:28:15,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4259927797833935 [2023-08-29 20:28:15,628 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2023-08-29 20:28:15,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2023-08-29 20:28:15,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:15,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2023-08-29 20:28:15,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 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:28:15,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:28:15,635 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:28:15,635 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 7 states and 826 transitions. [2023-08-29 20:28:15,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 208 flow [2023-08-29 20:28:15,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:28:15,638 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 72 flow [2023-08-29 20:28:15,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-29 20:28:15,639 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-08-29 20:28:15,640 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 72 flow [2023-08-29 20:28:15,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 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:28:15,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:15,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:28:15,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:28:15,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:15,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:15,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1738133677, now seen corresponding path program 1 times [2023-08-29 20:28:15,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:15,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974951439] [2023-08-29 20:28:15,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:15,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:16,077 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:28:16,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:16,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974951439] [2023-08-29 20:28:16,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974951439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:16,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:16,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:28:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137484026] [2023-08-29 20:28:16,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:16,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:28:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:16,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:28:16,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:28:16,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-29 20:28:16,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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:28:16,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:16,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-29 20:28:16,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:17,551 INFO L130 PetriNetUnfolder]: 9093/12994 cut-off events. [2023-08-29 20:28:17,552 INFO L131 PetriNetUnfolder]: For 617/617 co-relation queries the response was YES. [2023-08-29 20:28:17,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26471 conditions, 12994 events. 9093/12994 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 73324 event pairs, 699 based on Foata normal form. 572/13566 useless extension candidates. Maximal degree in co-relation 26467. Up to 7909 conditions per place. [2023-08-29 20:28:17,625 INFO L137 encePairwiseOnDemand]: 265/277 looper letters, 50 selfloop transitions, 12 changer transitions 39/102 dead transitions. [2023-08-29 20:28:17,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 102 transitions, 450 flow [2023-08-29 20:28:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:28:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:28:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions. [2023-08-29 20:28:17,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4687983496647757 [2023-08-29 20:28:17,628 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions. [2023-08-29 20:28:17,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions. [2023-08-29 20:28:17,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:17,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions. [2023-08-29 20:28:17,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 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:28:17,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:28:17,635 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:28:17,635 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 72 flow. Second operand 7 states and 909 transitions. [2023-08-29 20:28:17,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 102 transitions, 450 flow [2023-08-29 20:28:17,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 102 transitions, 428 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 20:28:17,640 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 159 flow [2023-08-29 20:28:17,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-29 20:28:17,641 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-29 20:28:17,641 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 159 flow [2023-08-29 20:28:17,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 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:28:17,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:17,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:28:17,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:28:17,643 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:17,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1952401652, now seen corresponding path program 1 times [2023-08-29 20:28:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369414282] [2023-08-29 20:28:17,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:17,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:18,094 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:28:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:18,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369414282] [2023-08-29 20:28:18,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369414282] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:18,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:28:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688723698] [2023-08-29 20:28:18,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:18,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:28:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:18,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:28:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:28:18,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-29 20:28:18,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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:28:18,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:18,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-29 20:28:18,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:19,304 INFO L130 PetriNetUnfolder]: 7807/10920 cut-off events. [2023-08-29 20:28:19,304 INFO L131 PetriNetUnfolder]: For 8044/8044 co-relation queries the response was YES. [2023-08-29 20:28:19,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33012 conditions, 10920 events. 7807/10920 cut-off events. For 8044/8044 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 56068 event pairs, 1795 based on Foata normal form. 480/11392 useless extension candidates. Maximal degree in co-relation 33003. Up to 5393 conditions per place. [2023-08-29 20:28:19,378 INFO L137 encePairwiseOnDemand]: 266/277 looper letters, 49 selfloop transitions, 11 changer transitions 37/98 dead transitions. [2023-08-29 20:28:19,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 587 flow [2023-08-29 20:28:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:28:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:28:19,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-29 20:28:19,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595152140278494 [2023-08-29 20:28:19,381 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-29 20:28:19,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-29 20:28:19,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:19,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-29 20:28:19,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 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:28:19,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:28:19,387 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:28:19,387 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 159 flow. Second operand 7 states and 891 transitions. [2023-08-29 20:28:19,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 587 flow [2023-08-29 20:28:19,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 98 transitions, 579 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:28:19,557 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 256 flow [2023-08-29 20:28:19,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2023-08-29 20:28:19,560 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-29 20:28:19,560 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 256 flow [2023-08-29 20:28:19,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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:28:19,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:19,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:28:19,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:28:19,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:19,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash -785095588, now seen corresponding path program 1 times [2023-08-29 20:28:19,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:19,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056994302] [2023-08-29 20:28:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:19,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:20,331 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:28:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056994302] [2023-08-29 20:28:20,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056994302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:20,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:20,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:28:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38132657] [2023-08-29 20:28:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:20,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:28:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:20,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:28:20,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:28:20,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 277 [2023-08-29 20:28:20,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 256 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 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:28:20,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:20,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 277 [2023-08-29 20:28:20,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:21,712 INFO L130 PetriNetUnfolder]: 10031/13884 cut-off events. [2023-08-29 20:28:21,712 INFO L131 PetriNetUnfolder]: For 21919/21919 co-relation queries the response was YES. [2023-08-29 20:28:21,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46896 conditions, 13884 events. 10031/13884 cut-off events. For 21919/21919 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 69232 event pairs, 1673 based on Foata normal form. 452/14336 useless extension candidates. Maximal degree in co-relation 46883. Up to 9277 conditions per place. [2023-08-29 20:28:21,918 INFO L137 encePairwiseOnDemand]: 266/277 looper letters, 90 selfloop transitions, 22 changer transitions 45/157 dead transitions. [2023-08-29 20:28:21,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 157 transitions, 1223 flow [2023-08-29 20:28:21,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:28:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:28:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1009 transitions. [2023-08-29 20:28:21,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4553249097472924 [2023-08-29 20:28:21,922 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1009 transitions. [2023-08-29 20:28:21,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1009 transitions. [2023-08-29 20:28:21,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:21,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1009 transitions. [2023-08-29 20:28:21,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 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:28:21,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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:28:21,929 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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:28:21,929 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 256 flow. Second operand 8 states and 1009 transitions. [2023-08-29 20:28:21,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 157 transitions, 1223 flow [2023-08-29 20:28:22,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 157 transitions, 1210 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 20:28:22,334 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 522 flow [2023-08-29 20:28:22,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=522, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2023-08-29 20:28:22,335 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-29 20:28:22,335 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 522 flow [2023-08-29 20:28:22,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 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:28:22,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:22,336 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:28:22,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:28:22,336 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:22,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1468646514, now seen corresponding path program 1 times [2023-08-29 20:28:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:22,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644885287] [2023-08-29 20:28:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:22,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:23,471 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:28:23,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:23,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644885287] [2023-08-29 20:28:23,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644885287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:23,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:23,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:28:23,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143215645] [2023-08-29 20:28:23,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:23,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:28:23,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:23,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:28:23,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:28:23,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 277 [2023-08-29 20:28:23,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 522 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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:28:23,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:23,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 277 [2023-08-29 20:28:23,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:25,334 INFO L130 PetriNetUnfolder]: 10737/14810 cut-off events. [2023-08-29 20:28:25,334 INFO L131 PetriNetUnfolder]: For 34206/34206 co-relation queries the response was YES. [2023-08-29 20:28:25,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61676 conditions, 14810 events. 10737/14810 cut-off events. For 34206/34206 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 74249 event pairs, 637 based on Foata normal form. 288/15098 useless extension candidates. Maximal degree in co-relation 61657. Up to 8617 conditions per place. [2023-08-29 20:28:25,459 INFO L137 encePairwiseOnDemand]: 264/277 looper letters, 99 selfloop transitions, 76 changer transitions 34/209 dead transitions. [2023-08-29 20:28:25,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 209 transitions, 1889 flow [2023-08-29 20:28:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:28:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:28:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1363 transitions. [2023-08-29 20:28:25,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44732523793895634 [2023-08-29 20:28:25,467 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1363 transitions. [2023-08-29 20:28:25,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1363 transitions. [2023-08-29 20:28:25,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:25,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1363 transitions. [2023-08-29 20:28:25,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.9090909090909) internal successors, (1363), 11 states have internal predecessors, (1363), 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:28:25,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 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:28:25,478 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 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:28:25,478 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 522 flow. Second operand 11 states and 1363 transitions. [2023-08-29 20:28:25,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 209 transitions, 1889 flow [2023-08-29 20:28:25,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 209 transitions, 1849 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-08-29 20:28:25,895 INFO L231 Difference]: Finished difference. Result has 75 places, 119 transitions, 1345 flow [2023-08-29 20:28:25,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1345, PETRI_PLACES=75, PETRI_TRANSITIONS=119} [2023-08-29 20:28:25,896 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-29 20:28:25,896 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 119 transitions, 1345 flow [2023-08-29 20:28:25,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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:28:25,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:25,897 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:28:25,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:28:25,897 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:25,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1976800616, now seen corresponding path program 2 times [2023-08-29 20:28:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:25,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161649636] [2023-08-29 20:28:25,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:26,411 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:28:26,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:26,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161649636] [2023-08-29 20:28:26,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161649636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:26,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:26,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:28:26,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840430780] [2023-08-29 20:28:26,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:26,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:28:26,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:26,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:28:26,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:28:26,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:28:26,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 119 transitions, 1345 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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:28:26,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:26,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:28:26,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:27,698 INFO L130 PetriNetUnfolder]: 8560/12459 cut-off events. [2023-08-29 20:28:27,698 INFO L131 PetriNetUnfolder]: For 57006/57571 co-relation queries the response was YES. [2023-08-29 20:28:27,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61390 conditions, 12459 events. 8560/12459 cut-off events. For 57006/57571 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 70837 event pairs, 1246 based on Foata normal form. 529/12903 useless extension candidates. Maximal degree in co-relation 61367. Up to 7493 conditions per place. [2023-08-29 20:28:27,795 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 78 selfloop transitions, 30 changer transitions 19/163 dead transitions. [2023-08-29 20:28:27,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 163 transitions, 1867 flow [2023-08-29 20:28:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:28:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:28:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 936 transitions. [2023-08-29 20:28:27,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48272305312016506 [2023-08-29 20:28:27,803 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 936 transitions. [2023-08-29 20:28:27,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 936 transitions. [2023-08-29 20:28:27,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:27,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 936 transitions. [2023-08-29 20:28:27,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 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:28:27,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:28:27,818 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:28:27,818 INFO L175 Difference]: Start difference. First operand has 75 places, 119 transitions, 1345 flow. Second operand 7 states and 936 transitions. [2023-08-29 20:28:27,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 163 transitions, 1867 flow [2023-08-29 20:28:28,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 163 transitions, 1803 flow, removed 32 selfloop flow, removed 2 redundant places. [2023-08-29 20:28:28,191 INFO L231 Difference]: Finished difference. Result has 79 places, 124 transitions, 1452 flow [2023-08-29 20:28:28,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1452, PETRI_PLACES=79, PETRI_TRANSITIONS=124} [2023-08-29 20:28:28,193 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-08-29 20:28:28,193 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 124 transitions, 1452 flow [2023-08-29 20:28:28,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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:28:28,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:28,193 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:28:28,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:28:28,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:28,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash 138280026, now seen corresponding path program 3 times [2023-08-29 20:28:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:28,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436733389] [2023-08-29 20:28:28,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:28,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:28,662 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:28:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436733389] [2023-08-29 20:28:28,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436733389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:28,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:28,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:28:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444140761] [2023-08-29 20:28:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:28,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:28:28,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:28,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:28:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:28:28,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:28:28,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 124 transitions, 1452 flow. Second operand has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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:28:28,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:28,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:28:28,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:30,023 INFO L130 PetriNetUnfolder]: 8680/12647 cut-off events. [2023-08-29 20:28:30,023 INFO L131 PetriNetUnfolder]: For 68296/68751 co-relation queries the response was YES. [2023-08-29 20:28:30,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65649 conditions, 12647 events. 8680/12647 cut-off events. For 68296/68751 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 72299 event pairs, 1228 based on Foata normal form. 473/13035 useless extension candidates. Maximal degree in co-relation 65624. Up to 7675 conditions per place. [2023-08-29 20:28:30,117 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 79 selfloop transitions, 36 changer transitions 11/162 dead transitions. [2023-08-29 20:28:30,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 162 transitions, 1967 flow [2023-08-29 20:28:30,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:28:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:28:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 804 transitions. [2023-08-29 20:28:30,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48375451263537905 [2023-08-29 20:28:30,119 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 804 transitions. [2023-08-29 20:28:30,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 804 transitions. [2023-08-29 20:28:30,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:30,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 804 transitions. [2023-08-29 20:28:30,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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:28:30,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:28:30,124 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:28:30,124 INFO L175 Difference]: Start difference. First operand has 79 places, 124 transitions, 1452 flow. Second operand 6 states and 804 transitions. [2023-08-29 20:28:30,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 162 transitions, 1967 flow [2023-08-29 20:28:30,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 162 transitions, 1903 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-29 20:28:30,449 INFO L231 Difference]: Finished difference. Result has 79 places, 131 transitions, 1612 flow [2023-08-29 20:28:30,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1612, PETRI_PLACES=79, PETRI_TRANSITIONS=131} [2023-08-29 20:28:30,450 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 27 predicate places. [2023-08-29 20:28:30,450 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 131 transitions, 1612 flow [2023-08-29 20:28:30,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 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:28:30,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:30,451 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:28:30,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:28:30,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:30,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:30,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1401616764, now seen corresponding path program 4 times [2023-08-29 20:28:30,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:30,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056148712] [2023-08-29 20:28:30,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:30,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:30,861 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:28:30,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:30,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056148712] [2023-08-29 20:28:30,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056148712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:30,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:30,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:28:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094826609] [2023-08-29 20:28:30,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:30,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:28:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:28:30,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:28:30,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-29 20:28:30,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 131 transitions, 1612 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 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:28:30,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:30,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-29 20:28:30,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:32,704 INFO L130 PetriNetUnfolder]: 8997/13128 cut-off events. [2023-08-29 20:28:32,704 INFO L131 PetriNetUnfolder]: For 83293/83757 co-relation queries the response was YES. [2023-08-29 20:28:32,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69418 conditions, 13128 events. 8997/13128 cut-off events. For 83293/83757 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 75796 event pairs, 1120 based on Foata normal form. 642/13726 useless extension candidates. Maximal degree in co-relation 69393. Up to 6568 conditions per place. [2023-08-29 20:28:32,804 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 75 selfloop transitions, 49 changer transitions 20/180 dead transitions. [2023-08-29 20:28:32,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 180 transitions, 2267 flow [2023-08-29 20:28:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:28:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:28:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1070 transitions. [2023-08-29 20:28:32,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48285198555956677 [2023-08-29 20:28:32,807 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1070 transitions. [2023-08-29 20:28:32,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1070 transitions. [2023-08-29 20:28:32,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:32,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1070 transitions. [2023-08-29 20:28:32,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.75) internal successors, (1070), 8 states have internal predecessors, (1070), 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:28:32,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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:28:32,814 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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:28:32,814 INFO L175 Difference]: Start difference. First operand has 79 places, 131 transitions, 1612 flow. Second operand 8 states and 1070 transitions. [2023-08-29 20:28:32,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 180 transitions, 2267 flow [2023-08-29 20:28:33,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 180 transitions, 2227 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:28:33,291 INFO L231 Difference]: Finished difference. Result has 86 places, 135 transitions, 1805 flow [2023-08-29 20:28:33,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1805, PETRI_PLACES=86, PETRI_TRANSITIONS=135} [2023-08-29 20:28:33,292 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2023-08-29 20:28:33,292 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 135 transitions, 1805 flow [2023-08-29 20:28:33,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 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:28:33,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:33,293 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:28:33,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:28:33,293 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:33,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:33,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1218359641, now seen corresponding path program 1 times [2023-08-29 20:28:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:33,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432049268] [2023-08-29 20:28:33,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:34,464 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:28:34,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:34,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432049268] [2023-08-29 20:28:34,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432049268] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:34,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:34,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:28:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261741930] [2023-08-29 20:28:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:34,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:28:34,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:34,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:28:34,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:28:34,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 277 [2023-08-29 20:28:34,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 135 transitions, 1805 flow. Second operand has 9 states, 9 states have (on average 112.88888888888889) internal successors, (1016), 9 states have internal predecessors, (1016), 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:28:34,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:34,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 277 [2023-08-29 20:28:34,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:36,189 INFO L130 PetriNetUnfolder]: 12409/17146 cut-off events. [2023-08-29 20:28:36,189 INFO L131 PetriNetUnfolder]: For 112837/112837 co-relation queries the response was YES. [2023-08-29 20:28:36,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93424 conditions, 17146 events. 12409/17146 cut-off events. For 112837/112837 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 88875 event pairs, 617 based on Foata normal form. 192/17338 useless extension candidates. Maximal degree in co-relation 93397. Up to 9385 conditions per place. [2023-08-29 20:28:36,336 INFO L137 encePairwiseOnDemand]: 264/277 looper letters, 125 selfloop transitions, 93 changer transitions 27/245 dead transitions. [2023-08-29 20:28:36,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 245 transitions, 3147 flow [2023-08-29 20:28:36,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:28:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:28:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1234 transitions. [2023-08-29 20:28:36,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44548736462093863 [2023-08-29 20:28:36,339 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1234 transitions. [2023-08-29 20:28:36,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1234 transitions. [2023-08-29 20:28:36,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:36,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1234 transitions. [2023-08-29 20:28:36,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.4) internal successors, (1234), 10 states have internal predecessors, (1234), 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:28:36,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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:28:36,347 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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:28:36,347 INFO L175 Difference]: Start difference. First operand has 86 places, 135 transitions, 1805 flow. Second operand 10 states and 1234 transitions. [2023-08-29 20:28:36,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 245 transitions, 3147 flow [2023-08-29 20:28:37,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 245 transitions, 3053 flow, removed 32 selfloop flow, removed 5 redundant places. [2023-08-29 20:28:37,095 INFO L231 Difference]: Finished difference. Result has 96 places, 165 transitions, 2543 flow [2023-08-29 20:28:37,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2543, PETRI_PLACES=96, PETRI_TRANSITIONS=165} [2023-08-29 20:28:37,096 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 44 predicate places. [2023-08-29 20:28:37,096 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 165 transitions, 2543 flow [2023-08-29 20:28:37,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.88888888888889) internal successors, (1016), 9 states have internal predecessors, (1016), 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:28:37,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:37,097 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:28:37,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:28:37,097 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:37,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1145886285, now seen corresponding path program 2 times [2023-08-29 20:28:37,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:37,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072789834] [2023-08-29 20:28:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:37,598 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:28:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:37,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072789834] [2023-08-29 20:28:37,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072789834] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:37,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:37,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:28:37,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048342019] [2023-08-29 20:28:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:37,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:28:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:37,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:28:37,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:28:37,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:28:37,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 165 transitions, 2543 flow. Second operand has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 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:28:37,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:37,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:28:37,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:39,462 INFO L130 PetriNetUnfolder]: 10043/14825 cut-off events. [2023-08-29 20:28:39,462 INFO L131 PetriNetUnfolder]: For 142320/143117 co-relation queries the response was YES. [2023-08-29 20:28:39,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90720 conditions, 14825 events. 10043/14825 cut-off events. For 142320/143117 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 90464 event pairs, 1157 based on Foata normal form. 709/15320 useless extension candidates. Maximal degree in co-relation 90688. Up to 7005 conditions per place. [2023-08-29 20:28:39,602 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 82 selfloop transitions, 82 changer transitions 14/231 dead transitions. [2023-08-29 20:28:39,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 231 transitions, 3484 flow [2023-08-29 20:28:39,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:28:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:28:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1071 transitions. [2023-08-29 20:28:39,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4833032490974729 [2023-08-29 20:28:39,605 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1071 transitions. [2023-08-29 20:28:39,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1071 transitions. [2023-08-29 20:28:39,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:39,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1071 transitions. [2023-08-29 20:28:39,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.875) internal successors, (1071), 8 states have internal predecessors, (1071), 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:28:39,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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:28:39,611 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 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:28:39,611 INFO L175 Difference]: Start difference. First operand has 96 places, 165 transitions, 2543 flow. Second operand 8 states and 1071 transitions. [2023-08-29 20:28:39,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 231 transitions, 3484 flow [2023-08-29 20:28:40,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 231 transitions, 3406 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-08-29 20:28:40,401 INFO L231 Difference]: Finished difference. Result has 101 places, 183 transitions, 3106 flow [2023-08-29 20:28:40,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=2485, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3106, PETRI_PLACES=101, PETRI_TRANSITIONS=183} [2023-08-29 20:28:40,402 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 49 predicate places. [2023-08-29 20:28:40,402 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 183 transitions, 3106 flow [2023-08-29 20:28:40,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 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:28:40,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:40,403 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:28:40,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:28:40,403 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:40,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1716280813, now seen corresponding path program 3 times [2023-08-29 20:28:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867397520] [2023-08-29 20:28:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:41,443 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:28:41,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867397520] [2023-08-29 20:28:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867397520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:41,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:41,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:28:41,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238931874] [2023-08-29 20:28:41,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:41,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:28:41,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:41,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:28:41,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:28:41,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 277 [2023-08-29 20:28:41,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 183 transitions, 3106 flow. Second operand has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 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:28:41,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:41,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 277 [2023-08-29 20:28:41,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:44,075 INFO L130 PetriNetUnfolder]: 14431/20060 cut-off events. [2023-08-29 20:28:44,075 INFO L131 PetriNetUnfolder]: For 202235/202235 co-relation queries the response was YES. [2023-08-29 20:28:44,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125257 conditions, 20060 events. 14431/20060 cut-off events. For 202235/202235 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 109521 event pairs, 2659 based on Foata normal form. 192/20252 useless extension candidates. Maximal degree in co-relation 125222. Up to 11076 conditions per place. [2023-08-29 20:28:44,307 INFO L137 encePairwiseOnDemand]: 264/277 looper letters, 134 selfloop transitions, 116 changer transitions 27/277 dead transitions. [2023-08-29 20:28:44,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 277 transitions, 4536 flow [2023-08-29 20:28:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:28:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:28:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1233 transitions. [2023-08-29 20:28:44,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451263537906137 [2023-08-29 20:28:44,311 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1233 transitions. [2023-08-29 20:28:44,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1233 transitions. [2023-08-29 20:28:44,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:44,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1233 transitions. [2023-08-29 20:28:44,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.3) internal successors, (1233), 10 states have internal predecessors, (1233), 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:28:44,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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:28:44,318 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 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:28:44,318 INFO L175 Difference]: Start difference. First operand has 101 places, 183 transitions, 3106 flow. Second operand 10 states and 1233 transitions. [2023-08-29 20:28:44,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 277 transitions, 4536 flow [2023-08-29 20:28:46,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 277 transitions, 4446 flow, removed 34 selfloop flow, removed 5 redundant places. [2023-08-29 20:28:46,060 INFO L231 Difference]: Finished difference. Result has 109 places, 204 transitions, 3791 flow [2023-08-29 20:28:46,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=3045, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3791, PETRI_PLACES=109, PETRI_TRANSITIONS=204} [2023-08-29 20:28:46,061 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2023-08-29 20:28:46,062 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 204 transitions, 3791 flow [2023-08-29 20:28:46,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 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:28:46,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:46,069 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:28:46,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:28:46,069 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:46,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:46,069 INFO L85 PathProgramCache]: Analyzing trace with hash -541245315, now seen corresponding path program 4 times [2023-08-29 20:28:46,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:46,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441393470] [2023-08-29 20:28:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:46,587 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:28:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441393470] [2023-08-29 20:28:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441393470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:46,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:46,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:28:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355020785] [2023-08-29 20:28:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:46,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:28:46,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:46,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:28:46,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:28:46,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:28:46,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 204 transitions, 3791 flow. Second operand has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 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:28:46,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:46,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:28:46,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:48,925 INFO L130 PetriNetUnfolder]: 11215/16713 cut-off events. [2023-08-29 20:28:48,925 INFO L131 PetriNetUnfolder]: For 204892/205574 co-relation queries the response was YES. [2023-08-29 20:28:49,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112918 conditions, 16713 events. 11215/16713 cut-off events. For 204892/205574 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 105928 event pairs, 1739 based on Foata normal form. 436/16856 useless extension candidates. Maximal degree in co-relation 112881. Up to 10060 conditions per place. [2023-08-29 20:28:49,126 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 128 selfloop transitions, 38 changer transitions 9/239 dead transitions. [2023-08-29 20:28:49,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 239 transitions, 4391 flow [2023-08-29 20:28:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:28:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:28:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 804 transitions. [2023-08-29 20:28:49,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48375451263537905 [2023-08-29 20:28:49,128 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 804 transitions. [2023-08-29 20:28:49,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 804 transitions. [2023-08-29 20:28:49,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:49,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 804 transitions. [2023-08-29 20:28:49,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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:28:49,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:28:49,133 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:28:49,133 INFO L175 Difference]: Start difference. First operand has 109 places, 204 transitions, 3791 flow. Second operand 6 states and 804 transitions. [2023-08-29 20:28:49,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 239 transitions, 4391 flow [2023-08-29 20:28:50,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 239 transitions, 4290 flow, removed 50 selfloop flow, removed 4 redundant places. [2023-08-29 20:28:50,230 INFO L231 Difference]: Finished difference. Result has 109 places, 209 transitions, 3911 flow [2023-08-29 20:28:50,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=3698, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3911, PETRI_PLACES=109, PETRI_TRANSITIONS=209} [2023-08-29 20:28:50,230 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2023-08-29 20:28:50,230 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 209 transitions, 3911 flow [2023-08-29 20:28:50,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 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:28:50,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:50,231 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:28:50,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:28:50,231 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:50,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash -492490023, now seen corresponding path program 5 times [2023-08-29 20:28:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658418160] [2023-08-29 20:28:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:50,897 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:28:50,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:50,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658418160] [2023-08-29 20:28:50,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658418160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:50,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:50,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:28:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776050378] [2023-08-29 20:28:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:50,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:28:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:50,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:28:50,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:28:50,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-29 20:28:50,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 209 transitions, 3911 flow. Second operand has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 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:28:50,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:50,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-29 20:28:50,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:53,046 INFO L130 PetriNetUnfolder]: 11665/17515 cut-off events. [2023-08-29 20:28:53,046 INFO L131 PetriNetUnfolder]: For 199194/199600 co-relation queries the response was YES. [2023-08-29 20:28:53,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114974 conditions, 17515 events. 11665/17515 cut-off events. For 199194/199600 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 113354 event pairs, 2756 based on Foata normal form. 418/17464 useless extension candidates. Maximal degree in co-relation 114938. Up to 8169 conditions per place. [2023-08-29 20:28:53,270 INFO L137 encePairwiseOnDemand]: 272/277 looper letters, 120 selfloop transitions, 34 changer transitions 19/237 dead transitions. [2023-08-29 20:28:53,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 237 transitions, 4439 flow [2023-08-29 20:28:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:28:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:28:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2023-08-29 20:28:53,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831528279181709 [2023-08-29 20:28:53,273 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2023-08-29 20:28:53,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2023-08-29 20:28:53,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:53,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2023-08-29 20:28:53,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 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:28:53,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:28:53,277 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:28:53,277 INFO L175 Difference]: Start difference. First operand has 109 places, 209 transitions, 3911 flow. Second operand 6 states and 803 transitions. [2023-08-29 20:28:53,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 237 transitions, 4439 flow [2023-08-29 20:28:54,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 237 transitions, 4378 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-29 20:28:54,459 INFO L231 Difference]: Finished difference. Result has 113 places, 205 transitions, 3877 flow [2023-08-29 20:28:54,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=3856, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3877, PETRI_PLACES=113, PETRI_TRANSITIONS=205} [2023-08-29 20:28:54,460 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 61 predicate places. [2023-08-29 20:28:54,460 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 205 transitions, 3877 flow [2023-08-29 20:28:54,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 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:28:54,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:54,461 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:28:54,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:28:54,461 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:54,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash -492182503, now seen corresponding path program 1 times [2023-08-29 20:28:54,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:54,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103627708] [2023-08-29 20:28:54,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:54,614 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:28:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:54,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103627708] [2023-08-29 20:28:54,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103627708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:54,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:54,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:28:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025919254] [2023-08-29 20:28:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:54,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:28:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:28:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:28:54,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:28:54,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 205 transitions, 3877 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:28:54,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:54,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:28:54,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:55,351 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([342] L858-->L864: Formula: (let ((.cse4 (not (= (mod v_~z$r_buff1_thd0~0_56 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_60 256) 0))) (.cse3 (not (= (mod v_~z$w_buff0_used~0_103 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse4 (not (= (mod v_~z$w_buff1_used~0_93 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_104 256) 0))))) (and (= v_~z$r_buff0_thd0~0_59 (ite .cse0 0 v_~z$r_buff0_thd0~0_60)) (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_93) v_~z$w_buff1_used~0_92) (= v_~z~0_59 (ite .cse2 v_~z$w_buff0~0_48 (ite .cse1 v_~z$w_buff1~0_51 v_~z~0_60))) (= v_~z$r_buff1_thd0~0_55 (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_59 256) 0))) (and .cse4 (not (= (mod v_~z$w_buff1_used~0_92 256) 0)))) 0 v_~z$r_buff1_thd0~0_56)) (= (ite .cse2 0 v_~z$w_buff0_used~0_104) v_~z$w_buff0_used~0_103)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_56, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_93, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_60} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_48, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_55, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_92, ~z$w_buff1~0=v_~z$w_buff1~0_51, ~z~0=v_~z~0_59} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0][96], [Black: 253#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 382#(and (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))))), Black: 257#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 384#(and (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 386#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 319#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), 91#P0EXITtrue, 186#true, Black: 325#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), 290#true, 275#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff1_thd0~0 0)), 95#L822true, Black: 267#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), 156#true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, Black: 214#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 138#L783true, P2Thread1of1ForFork3InUse, Black: 207#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 222#true, 121#L771true, Black: 276#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff1_thd0~0 0)), 336#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 337#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$r_buff0_thd3~0 0)), 205#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 347#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 343#(and (= ~z$r_buff0_thd3~0 0) (or (not (= 2 ~y~0)) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$r_buff0_thd0~0 0)), 320#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), 125#L864true, 171#true, Black: 231#(and (or (not (= 2 ~y~0)) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 297#(or (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))))), Black: 366#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff1_thd3~0 0)), Black: 224#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 292#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), 391#true, Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))))), Black: 228#(or (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))))), Black: 300#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(= ~y~0 0), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))))), Black: 296#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), 380#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 169#(and (not (= |ULTIMATE.start_main_~#t1223~0#1.base| |ULTIMATE.start_main_~#t1222~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1221~0#1.base| 0) |ULTIMATE.start_main_~#t1222~0#1.base| 0) |ULTIMATE.start_main_~#t1224~0#1.base| 0) |ULTIMATE.start_main_~#t1223~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t1224~0#1.base| |ULTIMATE.start_main_~#t1223~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1222~0#1.base| |ULTIMATE.start_main_~#t1221~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1224~0#1.base| |ULTIMATE.start_main_~#t1221~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1224~0#1.base| |ULTIMATE.start_main_~#t1222~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1223~0#1.base| |ULTIMATE.start_main_~#t1221~0#1.base|)))]) [2023-08-29 20:28:55,354 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:28:55,354 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:28:55,354 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:28:55,354 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:28:55,355 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([411] L822-->L829: Formula: (let ((.cse0 (not (= (mod v_~z$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~z$w_buff0_used~0_107 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_29 256) 0)))) (let ((.cse3 (and .cse1 .cse5)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_97 256) 0)) .cse0)) (.cse4 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_108 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~z$w_buff1_used~0_96 256) 0))) (and .cse1 (not (= (mod v_~z$r_buff0_thd4~0_28 256) 0)))) 0 v_~z$r_buff1_thd4~0_24) v_~z$r_buff1_thd4~0_23) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_97) v_~z$w_buff1_used~0_96) (= v_~z$r_buff0_thd4~0_28 (ite .cse3 0 v_~z$r_buff0_thd4~0_29)) (= v_~z~0_63 (ite .cse4 v_~z$w_buff0~0_50 (ite .cse2 v_~z$w_buff1~0_53 v_~z~0_64))) (= v_~z$w_buff0_used~0_107 (ite .cse4 0 v_~z$w_buff0_used~0_108))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_24, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_64} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_50, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_28, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_96, ~z$w_buff1~0=v_~z$w_buff1~0_53, ~z~0=v_~z~0_63} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][99], [60#L829true, Black: 253#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 382#(and (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 257#(and (= ~z~0 1) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~z$r_buff1_thd0~0 0)), Black: 384#(and (= ~z~0 1) (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 386#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 91#P0EXITtrue, 186#true, Black: 267#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$w_buff1~0 0)), P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, P0Thread1of1ForFork2InUse, 138#L783true, P2Thread1of1ForFork3InUse, 222#true, 121#L771true, Black: 276#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff1_thd0~0 0)), 171#true, Black: 297#(or (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))))), Black: 292#(and (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 179#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))))), 391#true, Black: 300#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0_used~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 173#(= ~y~0 0), Black: 296#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (= ~z$w_buff0~0 2) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))), Black: 174#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))))), 380#(and (<= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$r_buff0_thd3~0 0) (<= 0 ~z$r_buff1_thd0~0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), 169#(and (not (= |ULTIMATE.start_main_~#t1223~0#1.base| |ULTIMATE.start_main_~#t1222~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1221~0#1.base| 0) |ULTIMATE.start_main_~#t1222~0#1.base| 0) |ULTIMATE.start_main_~#t1224~0#1.base| 0) |ULTIMATE.start_main_~#t1223~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t1224~0#1.base| |ULTIMATE.start_main_~#t1223~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1222~0#1.base| |ULTIMATE.start_main_~#t1221~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1224~0#1.base| |ULTIMATE.start_main_~#t1221~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1224~0#1.base| |ULTIMATE.start_main_~#t1222~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1223~0#1.base| |ULTIMATE.start_main_~#t1221~0#1.base|))), Black: 189#(and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (and (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))))), 314#true, Black: 319#(and (= ~z~0 1) (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 188#(= ~__unbuffered_p3_EAX~0 0), Black: 320#(and (= ~z$w_buff1~0 0) (or (= ~z~0 1) (= ~z~0 0)) (= ~z$r_buff0_thd0~0 0)), Black: 325#(and (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), 290#true, 275#(and (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff1_thd0~0 0)), 156#true, Black: 214#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 207#(and (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (or (not (= 2 ~y~0)) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~z$w_buff1~0 2)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (not (= ~__unbuffered_p0_EAX~0 0)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 202#true, 336#(and (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff0_thd0~0 0)), Black: 337#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$r_buff0_thd3~0 0)), Black: 347#(and (<= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 343#(and (= ~z$r_buff0_thd3~0 0) (or (not (= 2 ~y~0)) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$r_buff0_thd0~0 0)), Black: 231#(and (or (not (= 2 ~y~0)) (and (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 366#(and (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd0~0 256) 1)) (<= ~z$r_buff0_thd0~0 (* 256 (div ~z$r_buff0_thd0~0 256))) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$r_buff1_thd3~0 0)), Black: 224#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0)), Black: 228#(or (and (or (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (or (and (not (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256)))) (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)))) (not (= 2 ~z~0))) (or (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0) (not (= ~z$w_buff1~0 2)) (= ~z$r_buff1_thd0~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))) (and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~z$w_buff0~0 2)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (and (not (= (* 256 (div ~z$w_buff0_used~0 256)) ~z$w_buff0_used~0)) (not (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))))), 93#L858true]) [2023-08-29 20:28:55,355 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:28:55,355 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:28:55,355 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:28:55,356 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:28:56,195 INFO L130 PetriNetUnfolder]: 6503/10012 cut-off events. [2023-08-29 20:28:56,196 INFO L131 PetriNetUnfolder]: For 143863/146137 co-relation queries the response was YES. [2023-08-29 20:28:56,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68005 conditions, 10012 events. 6503/10012 cut-off events. For 143863/146137 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 64609 event pairs, 1422 based on Foata normal form. 700/10097 useless extension candidates. Maximal degree in co-relation 67967. Up to 7834 conditions per place. [2023-08-29 20:28:56,293 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 182 selfloop transitions, 5 changer transitions 2/258 dead transitions. [2023-08-29 20:28:56,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 258 transitions, 5278 flow [2023-08-29 20:28:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:28:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:28:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-29 20:28:56,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49458483754512633 [2023-08-29 20:28:56,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-29 20:28:56,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-29 20:28:56,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:56,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-29 20:28:56,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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:28:56,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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:28:56,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 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:28:56,296 INFO L175 Difference]: Start difference. First operand has 113 places, 205 transitions, 3877 flow. Second operand 3 states and 411 transitions. [2023-08-29 20:28:56,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 258 transitions, 5278 flow [2023-08-29 20:28:56,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 258 transitions, 5207 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-29 20:28:56,605 INFO L231 Difference]: Finished difference. Result has 109 places, 204 transitions, 3794 flow [2023-08-29 20:28:56,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=3761, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3794, PETRI_PLACES=109, PETRI_TRANSITIONS=204} [2023-08-29 20:28:56,605 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 57 predicate places. [2023-08-29 20:28:56,606 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 204 transitions, 3794 flow [2023-08-29 20:28:56,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:28:56,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:56,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:28:56,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:28:56,606 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:56,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash -388937638, now seen corresponding path program 1 times [2023-08-29 20:28:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029758876] [2023-08-29 20:28:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:56,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:56,821 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:28:56,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:56,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029758876] [2023-08-29 20:28:56,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029758876] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:28:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243546780] [2023-08-29 20:28:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:56,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:28:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:28:56,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:28:56,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:28:56,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 204 transitions, 3794 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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:28:56,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:56,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:28:56,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:57,838 INFO L130 PetriNetUnfolder]: 3220/5250 cut-off events. [2023-08-29 20:28:57,838 INFO L131 PetriNetUnfolder]: For 70467/71772 co-relation queries the response was YES. [2023-08-29 20:28:57,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36080 conditions, 5250 events. 3220/5250 cut-off events. For 70467/71772 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 32321 event pairs, 410 based on Foata normal form. 676/5718 useless extension candidates. Maximal degree in co-relation 36044. Up to 2707 conditions per place. [2023-08-29 20:28:57,878 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 219 selfloop transitions, 9 changer transitions 4/298 dead transitions. [2023-08-29 20:28:57,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 298 transitions, 5994 flow [2023-08-29 20:28:57,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:28:57,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:28:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-29 20:28:57,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4954873646209386 [2023-08-29 20:28:57,879 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-29 20:28:57,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-29 20:28:57,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:57,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-29 20:28:57,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 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:28:57,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 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:28:57,882 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 277.0) internal successors, (1385), 5 states have internal predecessors, (1385), 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:28:57,882 INFO L175 Difference]: Start difference. First operand has 109 places, 204 transitions, 3794 flow. Second operand 4 states and 549 transitions. [2023-08-29 20:28:57,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 298 transitions, 5994 flow [2023-08-29 20:28:57,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 298 transitions, 5959 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-29 20:28:57,987 INFO L231 Difference]: Finished difference. Result has 112 places, 192 transitions, 3433 flow [2023-08-29 20:28:57,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=3381, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3433, PETRI_PLACES=112, PETRI_TRANSITIONS=192} [2023-08-29 20:28:57,988 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 60 predicate places. [2023-08-29 20:28:57,988 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 192 transitions, 3433 flow [2023-08-29 20:28:57,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 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:28:57,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:57,988 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] [2023-08-29 20:28:57,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:28:57,989 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:57,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:57,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1397891050, now seen corresponding path program 1 times [2023-08-29 20:28:57,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:57,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113309302] [2023-08-29 20:28:57,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:28:58,344 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:28:58,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:28:58,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113309302] [2023-08-29 20:28:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113309302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:28:58,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:28:58,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:28:58,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105896873] [2023-08-29 20:28:58,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:28:58,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:28:58,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:28:58,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:28:58,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:28:58,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-29 20:28:58,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 192 transitions, 3433 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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:28:58,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:28:58,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-29 20:28:58,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:28:59,511 INFO L130 PetriNetUnfolder]: 5716/8972 cut-off events. [2023-08-29 20:28:59,512 INFO L131 PetriNetUnfolder]: For 108619/108703 co-relation queries the response was YES. [2023-08-29 20:28:59,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63697 conditions, 8972 events. 5716/8972 cut-off events. For 108619/108703 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 53893 event pairs, 953 based on Foata normal form. 151/9102 useless extension candidates. Maximal degree in co-relation 63660. Up to 4572 conditions per place. [2023-08-29 20:28:59,577 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 125 selfloop transitions, 18 changer transitions 140/287 dead transitions. [2023-08-29 20:28:59,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 287 transitions, 5242 flow [2023-08-29 20:28:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:28:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:28:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2023-08-29 20:28:59,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602888086642599 [2023-08-29 20:28:59,578 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2023-08-29 20:28:59,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2023-08-29 20:28:59,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:28:59,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2023-08-29 20:28:59,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 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:28:59,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:28:59,582 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:28:59,582 INFO L175 Difference]: Start difference. First operand has 112 places, 192 transitions, 3433 flow. Second operand 6 states and 765 transitions. [2023-08-29 20:28:59,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 287 transitions, 5242 flow [2023-08-29 20:28:59,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 287 transitions, 5208 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 20:28:59,915 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 1796 flow [2023-08-29 20:28:59,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=3415, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1796, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2023-08-29 20:28:59,916 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 66 predicate places. [2023-08-29 20:28:59,916 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 1796 flow [2023-08-29 20:28:59,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 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:28:59,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:28:59,916 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] [2023-08-29 20:28:59,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:28:59,917 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:28:59,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:28:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1913344937, now seen corresponding path program 1 times [2023-08-29 20:28:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:28:59,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459087468] [2023-08-29 20:28:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:28:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:28:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:00,253 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:29:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459087468] [2023-08-29 20:29:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459087468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:00,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:29:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306685242] [2023-08-29 20:29:00,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:00,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:29:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:29:00,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:29:00,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 277 [2023-08-29 20:29:00,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 1796 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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:29:00,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:00,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 277 [2023-08-29 20:29:00,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:01,469 INFO L130 PetriNetUnfolder]: 5430/8809 cut-off events. [2023-08-29 20:29:01,469 INFO L131 PetriNetUnfolder]: For 108876/109010 co-relation queries the response was YES. [2023-08-29 20:29:01,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59353 conditions, 8809 events. 5430/8809 cut-off events. For 108876/109010 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 56553 event pairs, 781 based on Foata normal form. 193/8969 useless extension candidates. Maximal degree in co-relation 59313. Up to 4167 conditions per place. [2023-08-29 20:29:01,525 INFO L137 encePairwiseOnDemand]: 264/277 looper letters, 122 selfloop transitions, 25 changer transitions 135/286 dead transitions. [2023-08-29 20:29:01,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 286 transitions, 4691 flow [2023-08-29 20:29:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:29:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:29:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2023-08-29 20:29:01,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46364105208870554 [2023-08-29 20:29:01,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 899 transitions. [2023-08-29 20:29:01,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 899 transitions. [2023-08-29 20:29:01,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:01,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 899 transitions. [2023-08-29 20:29:01,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 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:29:01,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:29:01,529 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:29:01,529 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 1796 flow. Second operand 7 states and 899 transitions. [2023-08-29 20:29:01,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 286 transitions, 4691 flow [2023-08-29 20:29:01,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 286 transitions, 4455 flow, removed 43 selfloop flow, removed 6 redundant places. [2023-08-29 20:29:01,731 INFO L231 Difference]: Finished difference. Result has 118 places, 96 transitions, 1481 flow [2023-08-29 20:29:01,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1481, PETRI_PLACES=118, PETRI_TRANSITIONS=96} [2023-08-29 20:29:01,731 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 66 predicate places. [2023-08-29 20:29:01,731 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 96 transitions, 1481 flow [2023-08-29 20:29:01,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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:29:01,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:01,732 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] [2023-08-29 20:29:01,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:29:01,732 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:01,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:01,733 INFO L85 PathProgramCache]: Analyzing trace with hash 521033331, now seen corresponding path program 2 times [2023-08-29 20:29:01,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264965520] [2023-08-29 20:29:01,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:01,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:01,891 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:29:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:01,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264965520] [2023-08-29 20:29:01,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264965520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:01,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:01,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:29:01,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758309125] [2023-08-29 20:29:01,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:01,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:29:01,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:01,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:29:01,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:29:01,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:29:01,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 96 transitions, 1481 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 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:29:01,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:01,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:29:01,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:02,374 INFO L130 PetriNetUnfolder]: 1721/3035 cut-off events. [2023-08-29 20:29:02,375 INFO L131 PetriNetUnfolder]: For 35259/35684 co-relation queries the response was YES. [2023-08-29 20:29:02,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19002 conditions, 3035 events. 1721/3035 cut-off events. For 35259/35684 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 18984 event pairs, 238 based on Foata normal form. 490/3450 useless extension candidates. Maximal degree in co-relation 18963. Up to 1048 conditions per place. [2023-08-29 20:29:02,395 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 115 selfloop transitions, 13 changer transitions 25/172 dead transitions. [2023-08-29 20:29:02,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 172 transitions, 3008 flow [2023-08-29 20:29:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:29:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:29:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 681 transitions. [2023-08-29 20:29:02,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49169675090252707 [2023-08-29 20:29:02,397 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 681 transitions. [2023-08-29 20:29:02,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 681 transitions. [2023-08-29 20:29:02,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:02,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 681 transitions. [2023-08-29 20:29:02,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 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:29:02,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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:29:02,400 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 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:29:02,400 INFO L175 Difference]: Start difference. First operand has 118 places, 96 transitions, 1481 flow. Second operand 5 states and 681 transitions. [2023-08-29 20:29:02,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 172 transitions, 3008 flow [2023-08-29 20:29:02,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 172 transitions, 2800 flow, removed 15 selfloop flow, removed 13 redundant places. [2023-08-29 20:29:02,438 INFO L231 Difference]: Finished difference. Result has 108 places, 85 transitions, 1163 flow [2023-08-29 20:29:02,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1163, PETRI_PLACES=108, PETRI_TRANSITIONS=85} [2023-08-29 20:29:02,438 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 56 predicate places. [2023-08-29 20:29:02,438 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 1163 flow [2023-08-29 20:29:02,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 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:29:02,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:02,439 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, 1, 1] [2023-08-29 20:29:02,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:29:02,439 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:02,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2110745554, now seen corresponding path program 1 times [2023-08-29 20:29:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:02,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239934047] [2023-08-29 20:29:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:02,822 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:29:02,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:02,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239934047] [2023-08-29 20:29:02,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239934047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:02,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:02,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:29:02,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347282129] [2023-08-29 20:29:02,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:02,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:29:02,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:02,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:29:02,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:29:02,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 277 [2023-08-29 20:29:02,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 1163 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:29:02,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:02,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 277 [2023-08-29 20:29:02,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:03,589 INFO L130 PetriNetUnfolder]: 2604/4470 cut-off events. [2023-08-29 20:29:03,589 INFO L131 PetriNetUnfolder]: For 48852/48971 co-relation queries the response was YES. [2023-08-29 20:29:03,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29262 conditions, 4470 events. 2604/4470 cut-off events. For 48852/48971 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 27933 event pairs, 405 based on Foata normal form. 75/4510 useless extension candidates. Maximal degree in co-relation 29229. Up to 1783 conditions per place. [2023-08-29 20:29:03,615 INFO L137 encePairwiseOnDemand]: 265/277 looper letters, 116 selfloop transitions, 20 changer transitions 71/210 dead transitions. [2023-08-29 20:29:03,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 210 transitions, 3103 flow [2023-08-29 20:29:03,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:29:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:29:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-08-29 20:29:03,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548736462093863 [2023-08-29 20:29:03,617 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-08-29 20:29:03,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-08-29 20:29:03,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:03,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-08-29 20:29:03,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 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:29:03,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:29:03,620 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 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:29:03,620 INFO L175 Difference]: Start difference. First operand has 108 places, 85 transitions, 1163 flow. Second operand 7 states and 882 transitions. [2023-08-29 20:29:03,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 210 transitions, 3103 flow [2023-08-29 20:29:03,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 210 transitions, 2920 flow, removed 39 selfloop flow, removed 6 redundant places. [2023-08-29 20:29:03,703 INFO L231 Difference]: Finished difference. Result has 110 places, 81 transitions, 1066 flow [2023-08-29 20:29:03,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1066, PETRI_PLACES=110, PETRI_TRANSITIONS=81} [2023-08-29 20:29:03,703 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2023-08-29 20:29:03,703 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 81 transitions, 1066 flow [2023-08-29 20:29:03,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:29:03,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:03,704 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, 1, 1] [2023-08-29 20:29:03,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:29:03,704 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:03,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:03,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1075323873, now seen corresponding path program 1 times [2023-08-29 20:29:03,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:03,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440507465] [2023-08-29 20:29:03,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:03,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:03,944 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:29:03,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:29:03,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440507465] [2023-08-29 20:29:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440507465] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:03,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:03,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:29:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223067514] [2023-08-29 20:29:03,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:03,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:29:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:29:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:29:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:29:03,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:29:03,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 81 transitions, 1066 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 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:29:03,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:03,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:29:03,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:04,365 INFO L130 PetriNetUnfolder]: 1537/2746 cut-off events. [2023-08-29 20:29:04,365 INFO L131 PetriNetUnfolder]: For 27050/27404 co-relation queries the response was YES. [2023-08-29 20:29:04,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16733 conditions, 2746 events. 1537/2746 cut-off events. For 27050/27404 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 17620 event pairs, 200 based on Foata normal form. 254/2917 useless extension candidates. Maximal degree in co-relation 16697. Up to 959 conditions per place. [2023-08-29 20:29:04,380 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 32 selfloop transitions, 17 changer transitions 99/153 dead transitions. [2023-08-29 20:29:04,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 153 transitions, 2439 flow [2023-08-29 20:29:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:29:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:29:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 805 transitions. [2023-08-29 20:29:04,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4843561973525872 [2023-08-29 20:29:04,381 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 805 transitions. [2023-08-29 20:29:04,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 805 transitions. [2023-08-29 20:29:04,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:04,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 805 transitions. [2023-08-29 20:29:04,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.16666666666666) internal successors, (805), 6 states have internal predecessors, (805), 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:29:04,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:29:04,384 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 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:29:04,384 INFO L175 Difference]: Start difference. First operand has 110 places, 81 transitions, 1066 flow. Second operand 6 states and 805 transitions. [2023-08-29 20:29:04,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 153 transitions, 2439 flow [2023-08-29 20:29:04,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 153 transitions, 2246 flow, removed 41 selfloop flow, removed 9 redundant places. [2023-08-29 20:29:04,443 INFO L231 Difference]: Finished difference. Result has 106 places, 41 transitions, 393 flow [2023-08-29 20:29:04,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=106, PETRI_TRANSITIONS=41} [2023-08-29 20:29:04,443 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 54 predicate places. [2023-08-29 20:29:04,443 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 41 transitions, 393 flow [2023-08-29 20:29:04,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 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:29:04,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:04,444 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, 1, 1, 1, 1, 1] [2023-08-29 20:29:04,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:29:04,444 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:04,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1636793620, now seen corresponding path program 1 times [2023-08-29 20:29:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:29:04,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754117397] [2023-08-29 20:29:04,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:29:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:29:04,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:29:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:29:04,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:29:04,535 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:29:04,536 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:29:04,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:29:04,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:29:04,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:29:04,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:29:04,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:29:04,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:29:04,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:29:04,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:29:04,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:29:04,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:29:04,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:29:04,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:29:04,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:29:04,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:29:04,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:29:04,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:29:04,542 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:04,547 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:29:04,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:29:04,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:29:04 BasicIcfg [2023-08-29 20:29:04,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:29:04,616 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:29:04,616 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:29:04,617 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:29:04,617 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:28:07" (3/4) ... [2023-08-29 20:29:04,619 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:29:04,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:29:04,620 INFO L158 Benchmark]: Toolchain (without parser) took 58997.35ms. Allocated memory was 71.3MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 37.7MB in the beginning and 3.3GB in the end (delta: -3.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-29 20:29:04,621 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 52.4MB. Free memory was 30.1MB in the beginning and 30.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:29:04,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.02ms. Allocated memory is still 71.3MB. Free memory was 37.5MB in the beginning and 29.6MB in the end (delta: 7.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2023-08-29 20:29:04,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.21ms. Allocated memory is still 71.3MB. Free memory was 29.6MB in the beginning and 26.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:29:04,621 INFO L158 Benchmark]: Boogie Preprocessor took 62.21ms. Allocated memory is still 71.3MB. Free memory was 26.7MB in the beginning and 50.0MB in the end (delta: -23.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:29:04,622 INFO L158 Benchmark]: RCFGBuilder took 728.53ms. Allocated memory is still 71.3MB. Free memory was 50.0MB in the beginning and 37.1MB in the end (delta: 12.9MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2023-08-29 20:29:04,622 INFO L158 Benchmark]: TraceAbstraction took 57542.76ms. Allocated memory was 71.3MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 36.7MB in the beginning and 3.3GB in the end (delta: -3.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-29 20:29:04,622 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 4.8GB. Free memory is still 3.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:29:04,624 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.21ms. Allocated memory is still 52.4MB. Free memory was 30.1MB in the beginning and 30.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.02ms. Allocated memory is still 71.3MB. Free memory was 37.5MB in the beginning and 29.6MB in the end (delta: 7.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.21ms. Allocated memory is still 71.3MB. Free memory was 29.6MB in the beginning and 26.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.21ms. Allocated memory is still 71.3MB. Free memory was 26.7MB in the beginning and 50.0MB in the end (delta: -23.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 728.53ms. Allocated memory is still 71.3MB. Free memory was 50.0MB in the beginning and 37.1MB in the end (delta: 12.9MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * TraceAbstraction took 57542.76ms. Allocated memory was 71.3MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 36.7MB in the beginning and 3.3GB in the end (delta: -3.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 4.8GB. Free memory is still 3.3GB. 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: 4.6s, 149 PlacesBefore, 52 PlacesAfterwards, 138 TransitionsBefore, 40 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 8840 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4683, independent: 4464, independent conditional: 0, independent unconditional: 4464, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1745, independent: 1709, independent conditional: 0, independent unconditional: 1709, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4683, independent: 2755, independent conditional: 0, independent unconditional: 2755, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 1745, unknown conditional: 0, unknown unconditional: 1745] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 203, Positive conditional cache size: 0, Positive unconditional cache size: 203, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: -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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 847]: 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 9 procedures, 178 locations, 16 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: 57.3s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 41.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1681 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1415 mSDsluCounter, 1192 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1029 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4506 IncrementalHoareTripleChecker+Invalid, 4817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 163 mSDtfsCounter, 4506 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3911occurred in iteration=14, InterpolantAutomatonStates: 144, 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.6s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 383 NumberOfCodeBlocks, 383 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 334 ConstructedInterpolants, 0 QuantifiedInterpolants, 3981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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:29:04,648 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/mix046.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 f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --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:29:06,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:29:06,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:29:06,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:29:06,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:29:06,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:29:06,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:29:06,989 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:29:06,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:29:06,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:29:06,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:29:06,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:29:06,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:29:07,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:29:07,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:29:07,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:29:07,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:29:07,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:29:07,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:29:07,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:29:07,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:29:07,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:29:07,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:29:07,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:29:07,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:29:07,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:29:07,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:29:07,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:29:07,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:29:07,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:29:07,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:29:07,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:29:07,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:29:07,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:29:07,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:29:07,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:29:07,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:29:07,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:29:07,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:29:07,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:29:07,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:29:07,055 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:29:07,091 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:29:07,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:29:07,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:29:07,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:29:07,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:29:07,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:29:07,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:29:07,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:29:07,095 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:29:07,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:29:07,097 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:29:07,097 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:29:07,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:29:07,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:29:07,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:29:07,098 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:29:07,098 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:29:07,098 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:29:07,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:29:07,098 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:29:07,099 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:29:07,099 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:29:07,099 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:29:07,099 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:29:07,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:29:07,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:29:07,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:29:07,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:29:07,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:29:07,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:29:07,101 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:29:07,101 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:29:07,101 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:29:07,101 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:29:07,102 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:29:07,102 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:29:07,102 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:29:07,102 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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 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:29:07,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:29:07,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:29:07,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:29:07,442 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:29:07,442 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:29:07,443 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2023-08-29 20:29:08,548 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:29:08,856 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:29:08,856 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2023-08-29 20:29:08,868 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feefeb314/d809aee6f6a74c6fb67c0f4b406e44ff/FLAG1641feeaf [2023-08-29 20:29:08,887 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/feefeb314/d809aee6f6a74c6fb67c0f4b406e44ff [2023-08-29 20:29:08,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:29:08,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:29:08,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:29:08,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:29:08,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:29:08,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:29:08" (1/1) ... [2023-08-29 20:29:08,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b20a82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:08, skipping insertion in model container [2023-08-29 20:29:08,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:29:08" (1/1) ... [2023-08-29 20:29:08,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:29:08,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:29:09,069 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/mix046.opt.i[944,957] [2023-08-29 20:29:09,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:29:09,354 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:29:09,375 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/mix046.opt.i[944,957] [2023-08-29 20:29:09,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:29:09,471 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:29:09,471 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:29:09,478 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:29:09,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09 WrapperNode [2023-08-29 20:29:09,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:29:09,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:29:09,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:29:09,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:29:09,487 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:29:09" (1/1) ... [2023-08-29 20:29:09,519 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:29:09" (1/1) ... [2023-08-29 20:29:09,561 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2023-08-29 20:29:09,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:29:09,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:29:09,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:29:09,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:29:09,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (1/1) ... [2023-08-29 20:29:09,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (1/1) ... [2023-08-29 20:29:09,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (1/1) ... [2023-08-29 20:29:09,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (1/1) ... [2023-08-29 20:29:09,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (1/1) ... [2023-08-29 20:29:09,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (1/1) ... [2023-08-29 20:29:09,612 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (1/1) ... [2023-08-29 20:29:09,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (1/1) ... [2023-08-29 20:29:09,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:29:09,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:29:09,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:29:09,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:29:09,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (1/1) ... [2023-08-29 20:29:09,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:29:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:29:09,660 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:29:09,667 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:29:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:29:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:29:09,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:29:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:29:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:29:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:29:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:29:09,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:29:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:29:09,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:29:09,704 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:29:09,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:29:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:29:09,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:29:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:29:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:29:09,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:29:09,707 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:29:09,940 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:29:09,942 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:29:10,231 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:29:10,361 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:29:10,361 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:29:10,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:29:10 BoogieIcfgContainer [2023-08-29 20:29:10,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:29:10,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:29:10,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:29:10,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:29:10,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:29:08" (1/3) ... [2023-08-29 20:29:10,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ec0830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:29:10, skipping insertion in model container [2023-08-29 20:29:10,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:29:09" (2/3) ... [2023-08-29 20:29:10,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ec0830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:29:10, skipping insertion in model container [2023-08-29 20:29:10,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:29:10" (3/3) ... [2023-08-29 20:29:10,371 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2023-08-29 20:29:10,387 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:29:10,387 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:29:10,388 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:29:10,451 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:29:10,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-29 20:29:10,558 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-29 20:29:10,558 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:10,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:29:10,564 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-29 20:29:10,570 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-29 20:29:10,574 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:29:10,584 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-29 20:29:10,586 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-29 20:29:10,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-29 20:29:10,611 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-29 20:29:10,613 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:10,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:29:10,618 INFO L119 LiptonReduction]: Number of co-enabled transitions 3258 [2023-08-29 20:29:17,333 INFO L134 LiptonReduction]: Checked pairs total: 8882 [2023-08-29 20:29:17,334 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-29 20:29:17,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:29:17,351 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;@546bf25c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:29:17,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:29:17,353 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:29:17,353 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:17,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:17,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:29:17,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:17,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash 586, now seen corresponding path program 1 times [2023-08-29 20:29:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:17,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116060328] [2023-08-29 20:29:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:17,370 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:29:17,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:17,381 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:29:17,384 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:29:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:17,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:29:17,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:17,474 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:29:17,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:17,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116060328] [2023-08-29 20:29:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116060328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:17,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:17,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:29:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113654227] [2023-08-29 20:29:17,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:17,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:29:17,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:17,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:29:17,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:29:17,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 275 [2023-08-29 20:29:17,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 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:29:17,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:17,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 275 [2023-08-29 20:29:17,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:18,313 INFO L130 PetriNetUnfolder]: 4151/5767 cut-off events. [2023-08-29 20:29:18,313 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2023-08-29 20:29:18,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11559 conditions, 5767 events. 4151/5767 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 29862 event pairs, 4151 based on Foata normal form. 180/4998 useless extension candidates. Maximal degree in co-relation 11547. Up to 5689 conditions per place. [2023-08-29 20:29:18,354 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-29 20:29:18,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-08-29 20:29:18,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:29:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:29:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-29 20:29:18,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363636363636364 [2023-08-29 20:29:18,372 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-29 20:29:18,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-29 20:29:18,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:18,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-29 20:29:18,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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:29:18,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 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:29:18,390 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 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:29:18,392 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 295 transitions. [2023-08-29 20:29:18,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-08-29 20:29:18,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:29:18,402 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-29 20:29:18,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-29 20:29:18,407 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-29 20:29:18,408 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-29 20:29:18,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 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:29:18,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:18,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:18,421 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:29:18,618 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:29:18,618 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:18,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:18,619 INFO L85 PathProgramCache]: Analyzing trace with hash 945682723, now seen corresponding path program 1 times [2023-08-29 20:29:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:18,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105636618] [2023-08-29 20:29:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:18,620 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:29:18,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:18,626 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:29:18,628 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:29:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:18,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:29:18,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:18,773 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:29:18,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:18,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:18,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105636618] [2023-08-29 20:29:18,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105636618] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:18,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:29:18,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633859810] [2023-08-29 20:29:18,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:18,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:29:18,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:18,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:29:18,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:29:18,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 275 [2023-08-29 20:29:18,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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:29:18,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:18,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 275 [2023-08-29 20:29:18,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:19,405 INFO L130 PetriNetUnfolder]: 3299/5149 cut-off events. [2023-08-29 20:29:19,405 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:29:19,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9798 conditions, 5149 events. 3299/5149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31759 event pairs, 743 based on Foata normal form. 0/4704 useless extension candidates. Maximal degree in co-relation 9795. Up to 3421 conditions per place. [2023-08-29 20:29:19,430 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 33 selfloop transitions, 2 changer transitions 4/44 dead transitions. [2023-08-29 20:29:19,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 174 flow [2023-08-29 20:29:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:29:19,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:29:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-29 20:29:19,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5175757575757576 [2023-08-29 20:29:19,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-29 20:29:19,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-29 20:29:19,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:19,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-29 20:29:19,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:29:19,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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:29:19,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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:29:19,438 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 427 transitions. [2023-08-29 20:29:19,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 174 flow [2023-08-29 20:29:19,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:29:19,439 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-29 20:29:19,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-29 20:29:19,440 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-29 20:29:19,440 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-29 20:29:19,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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:29:19,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:19,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:19,454 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:29:19,654 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:29:19,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:19,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2146652179, now seen corresponding path program 1 times [2023-08-29 20:29:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:19,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834826659] [2023-08-29 20:29:19,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:19,656 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:29:19,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:19,661 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:29:19,662 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:29:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:19,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:29:19,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:19,787 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:29:19,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:19,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:19,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834826659] [2023-08-29 20:29:19,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834826659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:19,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:19,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:29:19,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97656012] [2023-08-29 20:29:19,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:19,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:29:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:29:19,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:29:19,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-29 20:29:19,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:29:19,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:19,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-29 20:29:19,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:20,142 INFO L130 PetriNetUnfolder]: 1763/2581 cut-off events. [2023-08-29 20:29:20,142 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-08-29 20:29:20,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5384 conditions, 2581 events. 1763/2581 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12840 event pairs, 413 based on Foata normal form. 36/2496 useless extension candidates. Maximal degree in co-relation 5380. Up to 2373 conditions per place. [2023-08-29 20:29:20,157 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 34 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-08-29 20:29:20,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 186 flow [2023-08-29 20:29:20,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:29:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:29:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-29 20:29:20,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2023-08-29 20:29:20,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-29 20:29:20,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-29 20:29:20,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:20,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-29 20:29:20,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:29:20,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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:29:20,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 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:29:20,163 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 3 states and 415 transitions. [2023-08-29 20:29:20,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 186 flow [2023-08-29 20:29:20,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:29:20,166 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 97 flow [2023-08-29 20:29:20,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-29 20:29:20,166 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-29 20:29:20,167 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 97 flow [2023-08-29 20:29:20,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:29:20,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:20,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:20,181 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:29:20,381 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:29:20,381 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:20,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash -160210939, now seen corresponding path program 1 times [2023-08-29 20:29:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:20,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422813194] [2023-08-29 20:29:20,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:20,383 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:29:20,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:20,383 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:29:20,384 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:29:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:20,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:29:20,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:20,526 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:29:20,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:20,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:20,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422813194] [2023-08-29 20:29:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422813194] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:20,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:29:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995071890] [2023-08-29 20:29:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:20,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:29:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:20,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:29:20,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:29:20,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-29 20:29:20,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 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:29:20,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:20,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-29 20:29:20,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:20,779 INFO L130 PetriNetUnfolder]: 863/1381 cut-off events. [2023-08-29 20:29:20,779 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2023-08-29 20:29:20,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3397 conditions, 1381 events. 863/1381 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6502 event pairs, 160 based on Foata normal form. 60/1380 useless extension candidates. Maximal degree in co-relation 3392. Up to 883 conditions per place. [2023-08-29 20:29:20,788 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 44 selfloop transitions, 9 changer transitions 0/58 dead transitions. [2023-08-29 20:29:20,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 273 flow [2023-08-29 20:29:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:29:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:29:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-29 20:29:20,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036363636363637 [2023-08-29 20:29:20,790 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-29 20:29:20,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-29 20:29:20,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:20,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-29 20:29:20,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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:29:20,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 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:29:20,794 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 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:29:20,795 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 97 flow. Second operand 4 states and 554 transitions. [2023-08-29 20:29:20,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 273 flow [2023-08-29 20:29:20,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:29:20,797 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 144 flow [2023-08-29 20:29:20,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-08-29 20:29:20,799 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-08-29 20:29:20,799 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 144 flow [2023-08-29 20:29:20,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 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:29:20,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:20,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:20,810 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:29:21,009 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:29:21,010 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:21,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:21,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1605027561, now seen corresponding path program 1 times [2023-08-29 20:29:21,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:21,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348643059] [2023-08-29 20:29:21,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:21,011 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:29:21,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:21,013 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:29:21,015 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:29:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:21,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:29:21,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:21,147 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:29:21,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:21,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:21,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348643059] [2023-08-29 20:29:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348643059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:21,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:21,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:29:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753600014] [2023-08-29 20:29:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:21,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:29:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:29:21,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:29:21,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-29 20:29:21,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 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:29:21,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:21,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-29 20:29:21,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:21,399 INFO L130 PetriNetUnfolder]: 493/826 cut-off events. [2023-08-29 20:29:21,399 INFO L131 PetriNetUnfolder]: For 600/600 co-relation queries the response was YES. [2023-08-29 20:29:21,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 826 events. 493/826 cut-off events. For 600/600 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3540 event pairs, 104 based on Foata normal form. 37/839 useless extension candidates. Maximal degree in co-relation 2379. Up to 290 conditions per place. [2023-08-29 20:29:21,406 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 52 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2023-08-29 20:29:21,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 370 flow [2023-08-29 20:29:21,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:29:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:29:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-29 20:29:21,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025454545454545 [2023-08-29 20:29:21,411 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-29 20:29:21,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-29 20:29:21,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:21,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-29 20:29:21,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 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:29:21,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 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:29:21,416 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 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:29:21,416 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 144 flow. Second operand 5 states and 691 transitions. [2023-08-29 20:29:21,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 370 flow [2023-08-29 20:29:21,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 352 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:29:21,422 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 194 flow [2023-08-29 20:29:21,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-29 20:29:21,425 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-29 20:29:21,425 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 194 flow [2023-08-29 20:29:21,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 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:29:21,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:21,429 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:29:21,443 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:29:21,639 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:29:21,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:21,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1319908580, now seen corresponding path program 1 times [2023-08-29 20:29:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26649172] [2023-08-29 20:29:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:21,640 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:29:21,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:21,641 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:29:21,643 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:29:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:21,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:29:21,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:21,815 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:29:21,815 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:21,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:21,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26649172] [2023-08-29 20:29:21,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26649172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:21,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:21,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:29:21,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085019413] [2023-08-29 20:29:21,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:21,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:29:21,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:21,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:29:21,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:29:21,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-29 20:29:21,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 194 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 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:29:21,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:21,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-29 20:29:21,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:22,128 INFO L130 PetriNetUnfolder]: 443/726 cut-off events. [2023-08-29 20:29:22,128 INFO L131 PetriNetUnfolder]: For 694/694 co-relation queries the response was YES. [2023-08-29 20:29:22,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 726 events. 443/726 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3092 event pairs, 99 based on Foata normal form. 10/722 useless extension candidates. Maximal degree in co-relation 2192. Up to 290 conditions per place. [2023-08-29 20:29:22,133 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 48 selfloop transitions, 17 changer transitions 0/70 dead transitions. [2023-08-29 20:29:22,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 396 flow [2023-08-29 20:29:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:29:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:29:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2023-08-29 20:29:22,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49454545454545457 [2023-08-29 20:29:22,136 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 816 transitions. [2023-08-29 20:29:22,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 816 transitions. [2023-08-29 20:29:22,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:22,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 816 transitions. [2023-08-29 20:29:22,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 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:29:22,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 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:29:22,142 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 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:29:22,142 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 194 flow. Second operand 6 states and 816 transitions. [2023-08-29 20:29:22,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 396 flow [2023-08-29 20:29:22,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 362 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-29 20:29:22,148 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 204 flow [2023-08-29 20:29:22,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-29 20:29:22,149 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-29 20:29:22,149 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 204 flow [2023-08-29 20:29:22,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 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:29:22,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:22,150 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, 1, 1, 1, 1, 1] [2023-08-29 20:29:22,162 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:29:22,360 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:29:22,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:22,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:22,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2020876120, now seen corresponding path program 1 times [2023-08-29 20:29:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:22,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006630197] [2023-08-29 20:29:22,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:22,361 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:29:22,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:22,362 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:29:22,364 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:29:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:22,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:29:22,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:23,271 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:29:23,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:23,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:23,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006630197] [2023-08-29 20:29:23,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006630197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:23,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:23,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:29:23,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615623947] [2023-08-29 20:29:23,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:23,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:29:23,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:23,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:29:23,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:29:23,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-29 20:29:23,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 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:29:23,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:23,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-29 20:29:23,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:23,516 INFO L130 PetriNetUnfolder]: 632/1041 cut-off events. [2023-08-29 20:29:23,516 INFO L131 PetriNetUnfolder]: For 1448/1448 co-relation queries the response was YES. [2023-08-29 20:29:23,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 1041 events. 632/1041 cut-off events. For 1448/1448 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4857 event pairs, 127 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 3241. Up to 571 conditions per place. [2023-08-29 20:29:23,523 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 78 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2023-08-29 20:29:23,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 625 flow [2023-08-29 20:29:23,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:29:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:29:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-29 20:29:23,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49236363636363634 [2023-08-29 20:29:23,525 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-29 20:29:23,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-29 20:29:23,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:23,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-29 20:29:23,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 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:29:23,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 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:29:23,529 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 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:29:23,529 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 204 flow. Second operand 5 states and 677 transitions. [2023-08-29 20:29:23,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 625 flow [2023-08-29 20:29:23,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 512 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-29 20:29:23,539 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 175 flow [2023-08-29 20:29:23,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-29 20:29:23,540 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-29 20:29:23,540 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 175 flow [2023-08-29 20:29:23,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 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:29:23,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:23,541 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, 1, 1, 1, 1, 1] [2023-08-29 20:29:23,551 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:29:23,750 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:29:23,751 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:23,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1186551923, now seen corresponding path program 1 times [2023-08-29 20:29:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:23,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036163688] [2023-08-29 20:29:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:29:23,752 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:29:23,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:23,753 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:29:23,756 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:29:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:29:23,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:29:23,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:24,517 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:29:24,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:24,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:24,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036163688] [2023-08-29 20:29:24,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036163688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:24,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:29:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34169182] [2023-08-29 20:29:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:24,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:29:24,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:24,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:29:24,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:29:24,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 275 [2023-08-29 20:29:24,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 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:29:24,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:24,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 275 [2023-08-29 20:29:24,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:25,321 INFO L130 PetriNetUnfolder]: 569/941 cut-off events. [2023-08-29 20:29:25,321 INFO L131 PetriNetUnfolder]: For 929/929 co-relation queries the response was YES. [2023-08-29 20:29:25,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 941 events. 569/941 cut-off events. For 929/929 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4433 event pairs, 131 based on Foata normal form. 2/928 useless extension candidates. Maximal degree in co-relation 2755. Up to 760 conditions per place. [2023-08-29 20:29:25,326 INFO L137 encePairwiseOnDemand]: 270/275 looper letters, 39 selfloop transitions, 4 changer transitions 14/62 dead transitions. [2023-08-29 20:29:25,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 392 flow [2023-08-29 20:29:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:29:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:29:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2023-08-29 20:29:25,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4218181818181818 [2023-08-29 20:29:25,329 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2023-08-29 20:29:25,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2023-08-29 20:29:25,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:25,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2023-08-29 20:29:25,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 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:29:25,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 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:29:25,333 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 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:29:25,333 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 175 flow. Second operand 6 states and 696 transitions. [2023-08-29 20:29:25,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 392 flow [2023-08-29 20:29:25,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:29:25,339 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 168 flow [2023-08-29 20:29:25,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2023-08-29 20:29:25,340 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-29 20:29:25,340 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 168 flow [2023-08-29 20:29:25,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 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:29:25,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:25,341 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, 1, 1, 1, 1, 1] [2023-08-29 20:29:25,354 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:29:25,551 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:29:25,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:25,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:25,552 INFO L85 PathProgramCache]: Analyzing trace with hash 779628904, now seen corresponding path program 2 times [2023-08-29 20:29:25,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:25,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742560601] [2023-08-29 20:29:25,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:29:25,553 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:29:25,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:25,554 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:29:25,557 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:29:25,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:29:25,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:29:25,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:29:25,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:25,756 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:29:25,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:25,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742560601] [2023-08-29 20:29:25,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742560601] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:25,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:29:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698303605] [2023-08-29 20:29:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:25,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:29:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:29:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:29:25,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-29 20:29:25,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 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:29:25,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:25,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-29 20:29:25,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:26,047 INFO L130 PetriNetUnfolder]: 840/1462 cut-off events. [2023-08-29 20:29:26,047 INFO L131 PetriNetUnfolder]: For 1216/1216 co-relation queries the response was YES. [2023-08-29 20:29:26,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4153 conditions, 1462 events. 840/1462 cut-off events. For 1216/1216 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7955 event pairs, 136 based on Foata normal form. 1/1451 useless extension candidates. Maximal degree in co-relation 4142. Up to 694 conditions per place. [2023-08-29 20:29:26,056 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 46 selfloop transitions, 1 changer transitions 34/85 dead transitions. [2023-08-29 20:29:26,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 542 flow [2023-08-29 20:29:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:29:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:29:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-08-29 20:29:26,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49236363636363634 [2023-08-29 20:29:26,058 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-08-29 20:29:26,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-08-29 20:29:26,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:26,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-08-29 20:29:26,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 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:29:26,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 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:29:26,062 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 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:29:26,063 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 168 flow. Second operand 5 states and 677 transitions. [2023-08-29 20:29:26,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 542 flow [2023-08-29 20:29:26,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 523 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-29 20:29:26,074 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 166 flow [2023-08-29 20:29:26,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-29 20:29:26,075 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-29 20:29:26,076 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 166 flow [2023-08-29 20:29:26,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 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:29:26,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:26,076 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, 1, 1, 1, 1, 1] [2023-08-29 20:29:26,089 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:29:26,286 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:29:26,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:26,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash -766762316, now seen corresponding path program 3 times [2023-08-29 20:29:26,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:26,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830053] [2023-08-29 20:29:26,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:29:26,287 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:29:26,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:26,289 INFO L229 MonitoredProcess]: Starting monitored process 11 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:29:26,304 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 (11)] Waiting until timeout for monitored process [2023-08-29 20:29:26,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:29:26,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:29:26,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:29:26,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:29:26,458 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:29:26,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:29:26,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:29:26,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830053] [2023-08-29 20:29:26,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:29:26,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:29:26,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:29:26,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171407426] [2023-08-29 20:29:26,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:29:26,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:29:26,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:29:26,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:29:26,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:29:26,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 275 [2023-08-29 20:29:26,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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:29:26,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:29:26,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 275 [2023-08-29 20:29:26,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:29:26,687 INFO L130 PetriNetUnfolder]: 1023/1711 cut-off events. [2023-08-29 20:29:26,688 INFO L131 PetriNetUnfolder]: For 1605/1605 co-relation queries the response was YES. [2023-08-29 20:29:26,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5144 conditions, 1711 events. 1023/1711 cut-off events. For 1605/1605 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9169 event pairs, 468 based on Foata normal form. 1/1652 useless extension candidates. Maximal degree in co-relation 5132. Up to 995 conditions per place. [2023-08-29 20:29:26,694 INFO L137 encePairwiseOnDemand]: 271/275 looper letters, 43 selfloop transitions, 2 changer transitions 18/67 dead transitions. [2023-08-29 20:29:26,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 421 flow [2023-08-29 20:29:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:29:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:29:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-29 20:29:26,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49454545454545457 [2023-08-29 20:29:26,697 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-29 20:29:26,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-29 20:29:26,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:29:26,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-29 20:29:26,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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:29:26,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 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:29:26,701 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 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:29:26,702 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 166 flow. Second operand 4 states and 544 transitions. [2023-08-29 20:29:26,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 421 flow [2023-08-29 20:29:26,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 414 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:29:26,715 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 171 flow [2023-08-29 20:29:26,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-29 20:29:26,717 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-29 20:29:26,717 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 171 flow [2023-08-29 20:29:26,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 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:29:26,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:29:26,718 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, 1, 1, 1, 1, 1] [2023-08-29 20:29:26,727 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 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:29:26,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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:29:26,927 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:29:26,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:29:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 945196820, now seen corresponding path program 4 times [2023-08-29 20:29:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:29:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055001006] [2023-08-29 20:29:26,928 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:29:26,928 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:29:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:29:26,929 INFO L229 MonitoredProcess]: Starting monitored process 12 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:29:26,930 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 (12)] Waiting until timeout for monitored process [2023-08-29 20:29:27,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:29:27,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:29:27,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:29:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:29:27,231 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:29:27,249 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:29:27,250 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:29:27,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:29:27,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:29:27,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:29:27,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:29:27,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:29:27,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:29:27,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:29:27,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:29:27,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:29:27,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:29:27,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:29:27,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:29:27,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:29:27,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:29:27,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:29:27,283 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 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:29:27,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:29:27,466 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:29:27,470 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:29:27,470 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:29:27,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:29:27 BasicIcfg [2023-08-29 20:29:27,545 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:29:27,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:29:27,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:29:27,546 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:29:27,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:29:10" (3/4) ... [2023-08-29 20:29:27,549 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:29:27,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:29:27,550 INFO L158 Benchmark]: Toolchain (without parser) took 18658.24ms. Allocated memory was 71.3MB in the beginning and 629.1MB in the end (delta: 557.8MB). Free memory was 47.3MB in the beginning and 406.8MB in the end (delta: -359.5MB). Peak memory consumption was 199.5MB. Max. memory is 16.1GB. [2023-08-29 20:29:27,550 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:29:27,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.09ms. Allocated memory is still 71.3MB. Free memory was 47.1MB in the beginning and 40.1MB in the end (delta: 7.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-29 20:29:27,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.07ms. Allocated memory is still 71.3MB. Free memory was 40.1MB in the beginning and 37.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:29:27,551 INFO L158 Benchmark]: Boogie Preprocessor took 60.59ms. Allocated memory is still 71.3MB. Free memory was 37.3MB in the beginning and 35.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:29:27,551 INFO L158 Benchmark]: RCFGBuilder took 739.60ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 35.2MB in the beginning and 51.8MB in the end (delta: -16.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2023-08-29 20:29:27,552 INFO L158 Benchmark]: TraceAbstraction took 17179.96ms. Allocated memory was 88.1MB in the beginning and 629.1MB in the end (delta: 541.1MB). Free memory was 51.1MB in the beginning and 406.8MB in the end (delta: -355.7MB). Peak memory consumption was 184.5MB. Max. memory is 16.1GB. [2023-08-29 20:29:27,552 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 629.1MB. Free memory is still 406.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:29:27,553 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.19ms. Allocated memory is still 58.7MB. Free memory is still 36.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.09ms. Allocated memory is still 71.3MB. Free memory was 47.1MB in the beginning and 40.1MB in the end (delta: 7.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.07ms. Allocated memory is still 71.3MB. Free memory was 40.1MB in the beginning and 37.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.59ms. Allocated memory is still 71.3MB. Free memory was 37.3MB in the beginning and 35.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 739.60ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 35.2MB in the beginning and 51.8MB in the end (delta: -16.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17179.96ms. Allocated memory was 88.1MB in the beginning and 629.1MB in the end (delta: 541.1MB). Free memory was 51.1MB in the beginning and 406.8MB in the end (delta: -355.7MB). Peak memory consumption was 184.5MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 629.1MB. Free memory is still 406.8MB. 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: 6.7s, 150 PlacesBefore, 52 PlacesAfterwards, 139 TransitionsBefore, 40 TransitionsAfterwards, 3258 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 8882 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4370, independent: 4151, independent conditional: 0, independent unconditional: 4151, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1706, independent: 1673, independent conditional: 0, independent unconditional: 1673, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4370, independent: 2478, independent conditional: 0, independent unconditional: 2478, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 1706, unknown conditional: 0, unknown unconditional: 1706] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-1, t1221={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=0, t1221={11:0}, t1222={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=1, t1221={11:0}, t1222={15:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=2, t1221={11:0}, t1222={15:0}, t1223={7:0}, t1224={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [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 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={11:0}, t1222={15:0}, t1223={7:0}, t1224={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - 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: -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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 847]: 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 9 procedures, 179 locations, 16 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: 17.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1401 IncrementalHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 6 mSDtfsCounter, 1401 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=6, InterpolantAutomatonStates: 43, 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.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 19 QuantifiedInterpolants, 1599 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1494 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:29:27,579 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