./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/mix019.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 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:13:20,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:13:20,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:13:20,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:13:20,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:13:20,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:13:20,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:13:20,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:13:20,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:13:20,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:13:20,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:13:20,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:13:20,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:13:20,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:13:20,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:13:20,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:13:20,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:13:20,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:13:20,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:13:20,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:13:20,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:13:20,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:13:20,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:13:20,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:13:20,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:13:20,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:13:20,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:13:20,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:13:20,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:13:20,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:13:20,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:13:20,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:13:20,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:13:20,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:13:20,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:13:20,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:13:20,108 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:13:20,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:13:20,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:13:20,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:13:20,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:13:20,111 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:13:20,142 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:13:20,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:13:20,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:13:20,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:13:20,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:13:20,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:13:20,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:13:20,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:13:20,145 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:13:20,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:13:20,146 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:13:20,147 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:13:20,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:13:20,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:13:20,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:13:20,147 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:13:20,147 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:13:20,148 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:13:20,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:13:20,148 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:13:20,148 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:13:20,148 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:13:20,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:13:20,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:13:20,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:13:20,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:20,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:13:20,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:13:20,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:13:20,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:13:20,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:13:20,150 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:13:20,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:13:20,150 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:13:20,151 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 -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 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 -> BEFORE [2023-08-31 23:13:20,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:13:20,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:13:20,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:13:20,456 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:13:20,457 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:13:20,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2023-08-31 23:13:21,646 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:13:21,822 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:13:21,822 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2023-08-31 23:13:21,846 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1cedbfd/f516e3eec02b49e4938a0d9534c9b2e5/FLAG8d4d7e0fd [2023-08-31 23:13:21,873 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1cedbfd/f516e3eec02b49e4938a0d9534c9b2e5 [2023-08-31 23:13:21,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:13:21,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:13:21,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:21,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:13:21,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:13:21,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:21" (1/1) ... [2023-08-31 23:13:21,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39736cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:21, skipping insertion in model container [2023-08-31 23:13:21,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:21" (1/1) ... [2023-08-31 23:13:21,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:13:21,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:13:22,123 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/mix019.opt.i[944,957] [2023-08-31 23:13:22,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:22,349 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:13:22,362 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/mix019.opt.i[944,957] [2023-08-31 23:13:22,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:22,436 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:22,436 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:22,442 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:13:22,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22 WrapperNode [2023-08-31 23:13:22,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:22,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:22,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:13:22,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:13:22,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,488 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2023-08-31 23:13:22,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:22,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:13:22,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:13:22,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:13:22,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,519 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:13:22,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:13:22,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:13:22,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:13:22,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (1/1) ... [2023-08-31 23:13:22,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:13:22,578 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-31 23:13:22,601 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-31 23:13:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:13:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:13:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:13:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:13:22,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:13:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:13:22,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:13:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:13:22,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:13:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:13:22,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:13:22,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:13:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:13:22,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:13:22,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:13:22,619 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:13:22,803 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:13:22,805 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:13:23,180 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:13:23,311 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:13:23,312 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:13:23,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:23 BoogieIcfgContainer [2023-08-31 23:13:23,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:13:23,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:13:23,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:13:23,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:13:23,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:13:21" (1/3) ... [2023-08-31 23:13:23,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994b37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:23, skipping insertion in model container [2023-08-31 23:13:23,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:22" (2/3) ... [2023-08-31 23:13:23,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3994b37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:23, skipping insertion in model container [2023-08-31 23:13:23,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:23" (3/3) ... [2023-08-31 23:13:23,320 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2023-08-31 23:13:23,334 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:13:23,335 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:13:23,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:13:23,372 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:13:23,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:13:23,439 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:13:23,439 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:23,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:13:23,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:13:23,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-31 23:13:23,449 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:13:23,456 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:13:23,459 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:13:23,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-31 23:13:23,480 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:13:23,480 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:23,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:13:23,483 INFO L119 LiptonReduction]: Number of co-enabled transitions 1956 [2023-08-31 23:13:27,172 INFO L134 LiptonReduction]: Checked pairs total: 4967 [2023-08-31 23:13:27,173 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-31 23:13:27,185 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:13:27,190 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;@1da6e77e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:13:27,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:13:27,193 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:13:27,193 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:27,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:27,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:13:27,194 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:27,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash 534, now seen corresponding path program 1 times [2023-08-31 23:13:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:27,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636988662] [2023-08-31 23:13:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:27,293 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-31 23:13:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:27,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636988662] [2023-08-31 23:13:27,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636988662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:27,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:27,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:13:27,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646611816] [2023-08-31 23:13:27,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:27,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:13:27,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:13:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:13:27,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 233 [2023-08-31 23:13:27,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:27,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:27,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 233 [2023-08-31 23:13:27,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:27,598 INFO L130 PetriNetUnfolder]: 1263/1908 cut-off events. [2023-08-31 23:13:27,598 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2023-08-31 23:13:27,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3815 conditions, 1908 events. 1263/1908 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9036 event pairs, 1263 based on Foata normal form. 72/1655 useless extension candidates. Maximal degree in co-relation 3804. Up to 1871 conditions per place. [2023-08-31 23:13:27,617 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-31 23:13:27,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-31 23:13:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:13:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:13:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2023-08-31 23:13:27,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51931330472103 [2023-08-31 23:13:27,647 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 242 transitions. [2023-08-31 23:13:27,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 242 transitions. [2023-08-31 23:13:27,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:27,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 242 transitions. [2023-08-31 23:13:27,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 121.0) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:27,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 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-31 23:13:27,659 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 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-31 23:13:27,660 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 242 transitions. [2023-08-31 23:13:27,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-31 23:13:27,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:27,663 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-31 23:13:27,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-31 23:13:27,668 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-31 23:13:27,668 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-31 23:13:27,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:27,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:27,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:27,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:13:27,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:27,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:27,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1043774850, now seen corresponding path program 1 times [2023-08-31 23:13:27,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:27,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166163059] [2023-08-31 23:13:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:27,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:28,055 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-31 23:13:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:28,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166163059] [2023-08-31 23:13:28,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166163059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:28,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:28,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:13:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821842221] [2023-08-31 23:13:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:28,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:13:28,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:13:28,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:13:28,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-31 23:13:28,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:28,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:28,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-31 23:13:28,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:28,290 INFO L130 PetriNetUnfolder]: 1043/1652 cut-off events. [2023-08-31 23:13:28,290 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:28,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3241 conditions, 1652 events. 1043/1652 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8341 event pairs, 163 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 3238. Up to 1265 conditions per place. [2023-08-31 23:13:28,298 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2023-08-31 23:13:28,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 146 flow [2023-08-31 23:13:28,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:13:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:13:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-31 23:13:28,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007153075822603 [2023-08-31 23:13:28,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-31 23:13:28,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-31 23:13:28,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:28,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-31 23:13:28,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:28,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:28,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:28,311 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 350 transitions. [2023-08-31 23:13:28,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 146 flow [2023-08-31 23:13:28,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:13:28,313 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-31 23:13:28,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-31 23:13:28,314 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-31 23:13:28,314 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-31 23:13:28,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:28,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:28,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:28,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:13:28,315 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:28,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:28,317 INFO L85 PathProgramCache]: Analyzing trace with hash -464732739, now seen corresponding path program 1 times [2023-08-31 23:13:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:28,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665547317] [2023-08-31 23:13:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:28,639 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-31 23:13:28,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:28,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665547317] [2023-08-31 23:13:28,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665547317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:28,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:28,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:13:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944123551] [2023-08-31 23:13:28,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:28,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:13:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:28,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:13:28,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:13:28,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 233 [2023-08-31 23:13:28,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:28,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:28,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 233 [2023-08-31 23:13:28,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:29,099 INFO L130 PetriNetUnfolder]: 2083/3100 cut-off events. [2023-08-31 23:13:29,099 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2023-08-31 23:13:29,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 3100 events. 2083/3100 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14632 event pairs, 509 based on Foata normal form. 0/2968 useless extension candidates. Maximal degree in co-relation 6401. Up to 1523 conditions per place. [2023-08-31 23:13:29,112 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 50 selfloop transitions, 14 changer transitions 0/64 dead transitions. [2023-08-31 23:13:29,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 274 flow [2023-08-31 23:13:29,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:29,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-31 23:13:29,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46437768240343347 [2023-08-31 23:13:29,115 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-31 23:13:29,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-31 23:13:29,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:29,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-31 23:13:29,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,120 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,120 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 5 states and 541 transitions. [2023-08-31 23:13:29,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 274 flow [2023-08-31 23:13:29,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:29,123 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 162 flow [2023-08-31 23:13:29,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2023-08-31 23:13:29,124 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-31 23:13:29,124 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 35 transitions, 162 flow [2023-08-31 23:13:29,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:29,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:29,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:13:29,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:29,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash -464732657, now seen corresponding path program 1 times [2023-08-31 23:13:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:29,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516850676] [2023-08-31 23:13:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:29,459 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-31 23:13:29,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:29,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516850676] [2023-08-31 23:13:29,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516850676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:29,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238209093] [2023-08-31 23:13:29,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:29,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:29,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:29,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:29,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 233 [2023-08-31 23:13:29,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:29,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 233 [2023-08-31 23:13:29,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:30,022 INFO L130 PetriNetUnfolder]: 1333/2130 cut-off events. [2023-08-31 23:13:30,024 INFO L131 PetriNetUnfolder]: For 2061/2078 co-relation queries the response was YES. [2023-08-31 23:13:30,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5976 conditions, 2130 events. 1333/2130 cut-off events. For 2061/2078 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10980 event pairs, 194 based on Foata normal form. 275/2391 useless extension candidates. Maximal degree in co-relation 5969. Up to 1308 conditions per place. [2023-08-31 23:13:30,035 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 35 selfloop transitions, 5 changer transitions 9/53 dead transitions. [2023-08-31 23:13:30,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 322 flow [2023-08-31 23:13:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:13:30,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:13:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 589 transitions. [2023-08-31 23:13:30,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42131616595135907 [2023-08-31 23:13:30,038 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 589 transitions. [2023-08-31 23:13:30,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 589 transitions. [2023-08-31 23:13:30,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:30,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 589 transitions. [2023-08-31 23:13:30,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,048 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,048 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 162 flow. Second operand 6 states and 589 transitions. [2023-08-31 23:13:30,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 322 flow [2023-08-31 23:13:30,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:13:30,051 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 118 flow [2023-08-31 23:13:30,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-31 23:13:30,053 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-31 23:13:30,053 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 118 flow [2023-08-31 23:13:30,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:30,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:30,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:13:30,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:30,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:30,055 INFO L85 PathProgramCache]: Analyzing trace with hash -542016572, now seen corresponding path program 1 times [2023-08-31 23:13:30,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:30,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082371168] [2023-08-31 23:13:30,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:30,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:30,240 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-31 23:13:30,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082371168] [2023-08-31 23:13:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082371168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:30,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:13:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810803880] [2023-08-31 23:13:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:30,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:13:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:30,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:13:30,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:13:30,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 233 [2023-08-31 23:13:30,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 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-31 23:13:30,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:30,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 233 [2023-08-31 23:13:30,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:30,502 INFO L130 PetriNetUnfolder]: 1131/1826 cut-off events. [2023-08-31 23:13:30,502 INFO L131 PetriNetUnfolder]: For 1629/1645 co-relation queries the response was YES. [2023-08-31 23:13:30,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5105 conditions, 1826 events. 1131/1826 cut-off events. For 1629/1645 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9059 event pairs, 373 based on Foata normal form. 106/1918 useless extension candidates. Maximal degree in co-relation 5097. Up to 1083 conditions per place. [2023-08-31 23:13:30,513 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 27 selfloop transitions, 3 changer transitions 16/50 dead transitions. [2023-08-31 23:13:30,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 300 flow [2023-08-31 23:13:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2023-08-31 23:13:30,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46866952789699573 [2023-08-31 23:13:30,515 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2023-08-31 23:13:30,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2023-08-31 23:13:30,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:30,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2023-08-31 23:13:30,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,521 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,521 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 118 flow. Second operand 5 states and 546 transitions. [2023-08-31 23:13:30,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 300 flow [2023-08-31 23:13:30,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 266 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-08-31 23:13:30,530 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 111 flow [2023-08-31 23:13:30,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-31 23:13:30,533 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-31 23:13:30,533 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 111 flow [2023-08-31 23:13:30,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 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-31 23:13:30,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:30,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:30,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:13:30,534 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:30,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1299857840, now seen corresponding path program 1 times [2023-08-31 23:13:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:30,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917844335] [2023-08-31 23:13:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:30,771 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-31 23:13:30,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917844335] [2023-08-31 23:13:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917844335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:30,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:30,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:30,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101796391] [2023-08-31 23:13:30,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:30,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:30,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:30,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:30,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:30,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 233 [2023-08-31 23:13:30,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:30,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 233 [2023-08-31 23:13:30,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:31,098 INFO L130 PetriNetUnfolder]: 1300/2027 cut-off events. [2023-08-31 23:13:31,099 INFO L131 PetriNetUnfolder]: For 1606/1606 co-relation queries the response was YES. [2023-08-31 23:13:31,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 2027 events. 1300/2027 cut-off events. For 1606/1606 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9579 event pairs, 285 based on Foata normal form. 94/2121 useless extension candidates. Maximal degree in co-relation 5674. Up to 1227 conditions per place. [2023-08-31 23:13:31,112 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 41 selfloop transitions, 10 changer transitions 23/74 dead transitions. [2023-08-31 23:13:31,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 74 transitions, 419 flow [2023-08-31 23:13:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:13:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:13:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2023-08-31 23:13:31,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537093807480074 [2023-08-31 23:13:31,115 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2023-08-31 23:13:31,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2023-08-31 23:13:31,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:31,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2023-08-31 23:13:31,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,120 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,120 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 111 flow. Second operand 7 states and 740 transitions. [2023-08-31 23:13:31,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 74 transitions, 419 flow [2023-08-31 23:13:31,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 74 transitions, 401 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-31 23:13:31,131 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 165 flow [2023-08-31 23:13:31,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=165, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-08-31 23:13:31,133 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-31 23:13:31,134 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 165 flow [2023-08-31 23:13:31,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:31,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:31,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:13:31,135 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:31,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1639538209, now seen corresponding path program 1 times [2023-08-31 23:13:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696358252] [2023-08-31 23:13:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:31,406 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-31 23:13:31,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:31,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696358252] [2023-08-31 23:13:31,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696358252] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:31,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:31,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:13:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464670843] [2023-08-31 23:13:31,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:31,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:13:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:13:31,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:13:31,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 233 [2023-08-31 23:13:31,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:31,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 233 [2023-08-31 23:13:31,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:31,576 INFO L130 PetriNetUnfolder]: 555/947 cut-off events. [2023-08-31 23:13:31,577 INFO L131 PetriNetUnfolder]: For 1236/1267 co-relation queries the response was YES. [2023-08-31 23:13:31,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 947 events. 555/947 cut-off events. For 1236/1267 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4380 event pairs, 141 based on Foata normal form. 48/977 useless extension candidates. Maximal degree in co-relation 2974. Up to 782 conditions per place. [2023-08-31 23:13:31,583 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 38 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-31 23:13:31,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 329 flow [2023-08-31 23:13:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:13:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:13:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-31 23:13:31,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48497854077253216 [2023-08-31 23:13:31,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-31 23:13:31,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-31 23:13:31,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:31,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-31 23:13:31,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,589 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 165 flow. Second operand 3 states and 339 transitions. [2023-08-31 23:13:31,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 329 flow [2023-08-31 23:13:31,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 319 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:31,595 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 183 flow [2023-08-31 23:13:31,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-31 23:13:31,595 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-31 23:13:31,596 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 183 flow [2023-08-31 23:13:31,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:31,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:31,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:13:31,597 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:31,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:31,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2096350418, now seen corresponding path program 1 times [2023-08-31 23:13:31,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:31,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696781440] [2023-08-31 23:13:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:31,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:31,776 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-31 23:13:31,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:31,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696781440] [2023-08-31 23:13:31,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696781440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:31,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:31,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:31,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648463489] [2023-08-31 23:13:31,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:31,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:13:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:31,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:13:31,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:13:31,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 233 [2023-08-31 23:13:31,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 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-31 23:13:31,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:31,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 233 [2023-08-31 23:13:31,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:32,007 INFO L130 PetriNetUnfolder]: 764/1331 cut-off events. [2023-08-31 23:13:32,007 INFO L131 PetriNetUnfolder]: For 1425/1429 co-relation queries the response was YES. [2023-08-31 23:13:32,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4489 conditions, 1331 events. 764/1331 cut-off events. For 1425/1429 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6595 event pairs, 316 based on Foata normal form. 38/1350 useless extension candidates. Maximal degree in co-relation 4478. Up to 607 conditions per place. [2023-08-31 23:13:32,015 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 40 selfloop transitions, 5 changer transitions 15/62 dead transitions. [2023-08-31 23:13:32,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 426 flow [2023-08-31 23:13:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:32,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2023-08-31 23:13:32,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4669527896995708 [2023-08-31 23:13:32,018 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2023-08-31 23:13:32,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2023-08-31 23:13:32,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:32,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2023-08-31 23:13:32,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.8) internal successors, (544), 5 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-31 23:13:32,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,022 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,022 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 183 flow. Second operand 5 states and 544 transitions. [2023-08-31 23:13:32,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 426 flow [2023-08-31 23:13:32,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:13:32,028 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 200 flow [2023-08-31 23:13:32,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-31 23:13:32,030 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-31 23:13:32,030 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 200 flow [2023-08-31 23:13:32,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 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-31 23:13:32,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:32,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:32,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:13:32,031 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:32,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1996612995, now seen corresponding path program 1 times [2023-08-31 23:13:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263186632] [2023-08-31 23:13:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:32,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:32,298 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-31 23:13:32,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263186632] [2023-08-31 23:13:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263186632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:32,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:32,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207488182] [2023-08-31 23:13:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:32,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:13:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:13:32,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:13:32,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 233 [2023-08-31 23:13:32,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:32,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 233 [2023-08-31 23:13:32,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:32,439 INFO L130 PetriNetUnfolder]: 300/585 cut-off events. [2023-08-31 23:13:32,439 INFO L131 PetriNetUnfolder]: For 750/768 co-relation queries the response was YES. [2023-08-31 23:13:32,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 585 events. 300/585 cut-off events. For 750/768 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2709 event pairs, 63 based on Foata normal form. 70/648 useless extension candidates. Maximal degree in co-relation 2033. Up to 243 conditions per place. [2023-08-31 23:13:32,442 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 45 selfloop transitions, 7 changer transitions 4/61 dead transitions. [2023-08-31 23:13:32,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 465 flow [2023-08-31 23:13:32,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:13:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:13:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-08-31 23:13:32,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48497854077253216 [2023-08-31 23:13:32,445 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-08-31 23:13:32,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-08-31 23:13:32,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:32,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-08-31 23:13:32,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,459 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,459 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 200 flow. Second operand 4 states and 452 transitions. [2023-08-31 23:13:32,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 465 flow [2023-08-31 23:13:32,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 446 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:32,462 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 222 flow [2023-08-31 23:13:32,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-08-31 23:13:32,463 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-31 23:13:32,463 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 222 flow [2023-08-31 23:13:32,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:32,463 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-31 23:13:32,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:13:32,464 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:32,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:32,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1293923193, now seen corresponding path program 1 times [2023-08-31 23:13:32,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:32,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131994145] [2023-08-31 23:13:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:32,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:32,738 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-31 23:13:32,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:32,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131994145] [2023-08-31 23:13:32,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131994145] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:32,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:32,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722317784] [2023-08-31 23:13:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:32,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:32,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:32,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 233 [2023-08-31 23:13:32,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 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-31 23:13:32,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:32,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 233 [2023-08-31 23:13:32,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:32,855 INFO L130 PetriNetUnfolder]: 200/396 cut-off events. [2023-08-31 23:13:32,855 INFO L131 PetriNetUnfolder]: For 761/781 co-relation queries the response was YES. [2023-08-31 23:13:32,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 396 events. 200/396 cut-off events. For 761/781 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1718 event pairs, 49 based on Foata normal form. 36/427 useless extension candidates. Maximal degree in co-relation 1546. Up to 160 conditions per place. [2023-08-31 23:13:32,858 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 38 selfloop transitions, 10 changer transitions 6/58 dead transitions. [2023-08-31 23:13:32,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 447 flow [2023-08-31 23:13:32,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2023-08-31 23:13:32,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4755364806866953 [2023-08-31 23:13:32,860 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2023-08-31 23:13:32,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2023-08-31 23:13:32,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:32,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2023-08-31 23:13:32,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 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-31 23:13:32,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,864 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,865 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 222 flow. Second operand 5 states and 554 transitions. [2023-08-31 23:13:32,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 447 flow [2023-08-31 23:13:32,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 413 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-31 23:13:32,869 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 198 flow [2023-08-31 23:13:32,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-08-31 23:13:32,870 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-31 23:13:32,871 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 198 flow [2023-08-31 23:13:32,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 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-31 23:13:32,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:32,871 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-31 23:13:32,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:13:32,872 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:32,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 307836728, now seen corresponding path program 1 times [2023-08-31 23:13:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:32,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122144976] [2023-08-31 23:13:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:33,138 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-31 23:13:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122144976] [2023-08-31 23:13:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122144976] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:33,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:33,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804081834] [2023-08-31 23:13:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:33,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:33,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:33,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 233 [2023-08-31 23:13:33,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:33,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:33,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 233 [2023-08-31 23:13:33,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:33,272 INFO L130 PetriNetUnfolder]: 118/247 cut-off events. [2023-08-31 23:13:33,272 INFO L131 PetriNetUnfolder]: For 611/613 co-relation queries the response was YES. [2023-08-31 23:13:33,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 247 events. 118/247 cut-off events. For 611/613 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 853 event pairs, 22 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 1013. Up to 152 conditions per place. [2023-08-31 23:13:33,274 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 27 selfloop transitions, 1 changer transitions 28/57 dead transitions. [2023-08-31 23:13:33,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 458 flow [2023-08-31 23:13:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2023-08-31 23:13:33,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45407725321888415 [2023-08-31 23:13:33,276 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 529 transitions. [2023-08-31 23:13:33,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 529 transitions. [2023-08-31 23:13:33,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:33,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 529 transitions. [2023-08-31 23:13:33,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:33,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:33,280 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:33,280 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 198 flow. Second operand 5 states and 529 transitions. [2023-08-31 23:13:33,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 458 flow [2023-08-31 23:13:33,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 370 flow, removed 23 selfloop flow, removed 7 redundant places. [2023-08-31 23:13:33,283 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 128 flow [2023-08-31 23:13:33,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-31 23:13:33,284 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-31 23:13:33,284 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 128 flow [2023-08-31 23:13:33,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:33,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:33,285 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-31 23:13:33,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:13:33,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:33,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:33,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1571715636, now seen corresponding path program 2 times [2023-08-31 23:13:33,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:33,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350096647] [2023-08-31 23:13:33,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:33,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:34,617 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-31 23:13:34,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:34,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350096647] [2023-08-31 23:13:34,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350096647] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:34,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:34,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:13:34,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208562223] [2023-08-31 23:13:34,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:34,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:13:34,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:34,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:13:34,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:13:34,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 233 [2023-08-31 23:13:34,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 128 flow. Second operand has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:34,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:34,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 233 [2023-08-31 23:13:34,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:34,939 INFO L130 PetriNetUnfolder]: 40/108 cut-off events. [2023-08-31 23:13:34,939 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2023-08-31 23:13:34,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 108 events. 40/108 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 254 event pairs, 6 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 377. Up to 33 conditions per place. [2023-08-31 23:13:34,940 INFO L137 encePairwiseOnDemand]: 223/233 looper letters, 23 selfloop transitions, 6 changer transitions 24/53 dead transitions. [2023-08-31 23:13:34,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 369 flow [2023-08-31 23:13:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:13:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:13:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 910 transitions. [2023-08-31 23:13:34,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3905579399141631 [2023-08-31 23:13:34,945 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 910 transitions. [2023-08-31 23:13:34,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 910 transitions. [2023-08-31 23:13:34,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:34,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 910 transitions. [2023-08-31 23:13:34,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:34,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:34,951 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:34,951 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 128 flow. Second operand 10 states and 910 transitions. [2023-08-31 23:13:34,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 369 flow [2023-08-31 23:13:34,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 336 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-31 23:13:34,953 INFO L231 Difference]: Finished difference. Result has 53 places, 27 transitions, 137 flow [2023-08-31 23:13:34,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=137, PETRI_PLACES=53, PETRI_TRANSITIONS=27} [2023-08-31 23:13:34,954 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-31 23:13:34,954 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 27 transitions, 137 flow [2023-08-31 23:13:34,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:34,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:34,955 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-31 23:13:34,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:13:34,955 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:34,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash 550911094, now seen corresponding path program 3 times [2023-08-31 23:13:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:34,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354087089] [2023-08-31 23:13:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:34,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:13:35,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:13:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:13:35,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:13:35,077 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:13:35,078 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:13:35,079 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:13:35,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:13:35,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:13:35,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:13:35,080 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:13:35,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:13:35,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:13:35,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:13:35,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:13:35,081 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:13:35,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:13:35,082 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:13:35,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:13:35,082 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:35,087 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:13:35,087 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:13:35,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:13:35 BasicIcfg [2023-08-31 23:13:35,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:13:35,136 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:13:35,136 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:13:35,136 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:13:35,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:23" (3/4) ... [2023-08-31 23:13:35,139 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:13:35,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:13:35,140 INFO L158 Benchmark]: Toolchain (without parser) took 13262.27ms. Allocated memory was 73.4MB in the beginning and 478.2MB in the end (delta: 404.8MB). Free memory was 43.0MB in the beginning and 396.7MB in the end (delta: -353.7MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2023-08-31 23:13:35,140 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 73.4MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:13:35,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.42ms. Allocated memory is still 73.4MB. Free memory was 42.7MB in the beginning and 40.2MB in the end (delta: 2.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-31 23:13:35,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.88ms. Allocated memory is still 73.4MB. Free memory was 40.2MB in the beginning and 37.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:13:35,141 INFO L158 Benchmark]: Boogie Preprocessor took 34.79ms. Allocated memory is still 73.4MB. Free memory was 37.3MB in the beginning and 35.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:13:35,141 INFO L158 Benchmark]: RCFGBuilder took 789.15ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 35.5MB in the beginning and 60.8MB in the end (delta: -25.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2023-08-31 23:13:35,141 INFO L158 Benchmark]: TraceAbstraction took 11820.07ms. Allocated memory was 88.1MB in the beginning and 478.2MB in the end (delta: 390.1MB). Free memory was 59.7MB in the beginning and 397.7MB in the end (delta: -338.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2023-08-31 23:13:35,141 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 478.2MB. Free memory was 397.7MB in the beginning and 396.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:13:35,143 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 73.4MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.42ms. Allocated memory is still 73.4MB. Free memory was 42.7MB in the beginning and 40.2MB in the end (delta: 2.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.88ms. Allocated memory is still 73.4MB. Free memory was 40.2MB in the beginning and 37.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.79ms. Allocated memory is still 73.4MB. Free memory was 37.3MB in the beginning and 35.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 789.15ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 35.5MB in the beginning and 60.8MB in the end (delta: -25.3MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11820.07ms. Allocated memory was 88.1MB in the beginning and 478.2MB in the end (delta: 390.1MB). Free memory was 59.7MB in the beginning and 397.7MB in the end (delta: -338.1MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 478.2MB. Free memory was 397.7MB in the beginning and 396.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 123 PlacesBefore, 41 PlacesAfterwards, 115 TransitionsBefore, 32 TransitionsAfterwards, 1956 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 4967 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2594, independent: 2442, independent conditional: 0, independent unconditional: 2442, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1082, independent: 1051, independent conditional: 0, independent unconditional: 1051, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2594, independent: 1391, independent conditional: 0, independent unconditional: 1391, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 1082, unknown conditional: 0, unknown unconditional: 1082] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500, ((void *)0), P0, ((void *)0))=-3, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501, ((void *)0), P1, ((void *)0))=-2, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502, ((void *)0), P2, ((void *)0))=-1, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 842]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 494 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1385 IncrementalHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 86 mSDtfsCounter, 1385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=9, InterpolantAutomatonStates: 60, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1386 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-31 23:13:35,164 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/mix019.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 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:13:37,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:13:37,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:13:37,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:13:37,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:13:37,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:13:37,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:13:37,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:13:37,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:13:37,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:13:37,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:13:37,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:13:37,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:13:37,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:13:37,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:13:37,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:13:37,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:13:37,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:13:37,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:13:37,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:13:37,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:13:37,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:13:37,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:13:37,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:13:37,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:13:37,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:13:37,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:13:37,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:13:37,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:13:37,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:13:37,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:13:37,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:13:37,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:13:37,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:13:37,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:13:37,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:13:37,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:13:37,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:13:37,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:13:37,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:13:37,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:13:37,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:13:37,192 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:13:37,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:13:37,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:13:37,193 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:13:37,194 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:13:37,195 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:13:37,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:13:37,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:13:37,195 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:13:37,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:13:37,197 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:13:37,197 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:13:37,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:13:37,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:13:37,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:13:37,198 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:13:37,198 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:13:37,198 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:13:37,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:13:37,199 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:13:37,199 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:13:37,199 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:13:37,199 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:13:37,199 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:13:37,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:13:37,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:13:37,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:13:37,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:37,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:13:37,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:13:37,201 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:13:37,201 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:13:37,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:13:37,202 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:13:37,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:13:37,202 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:13:37,203 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:13:37,203 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 -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 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 -> BEFORE [2023-08-31 23:13:37,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:13:37,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:13:37,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:13:37,536 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:13:37,540 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:13:37,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2023-08-31 23:13:38,655 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:13:38,899 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:13:38,900 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019.opt.i [2023-08-31 23:13:38,915 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c105522a/10a7e11e093541c5aed6c39691eeca8c/FLAG2bd5cb5c5 [2023-08-31 23:13:38,929 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c105522a/10a7e11e093541c5aed6c39691eeca8c [2023-08-31 23:13:38,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:13:38,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:13:38,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:38,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:13:38,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:13:38,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:38" (1/1) ... [2023-08-31 23:13:38,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc87647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:38, skipping insertion in model container [2023-08-31 23:13:38,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:38" (1/1) ... [2023-08-31 23:13:38,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:13:39,002 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:13:39,191 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/mix019.opt.i[944,957] [2023-08-31 23:13:39,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:39,436 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:13:39,450 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/mix019.opt.i[944,957] [2023-08-31 23:13:39,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:39,545 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:39,545 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:39,551 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:13:39,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39 WrapperNode [2023-08-31 23:13:39,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:39,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:39,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:13:39,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:13:39,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,636 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2023-08-31 23:13:39,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:39,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:13:39,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:13:39,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:13:39,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:13:39,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:13:39,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:13:39,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:13:39,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (1/1) ... [2023-08-31 23:13:39,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:39,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:13:39,729 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-31 23:13:39,756 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-31 23:13:39,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:13:39,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:13:39,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:13:39,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:13:39,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:13:39,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:13:39,774 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:13:39,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:13:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:13:39,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:13:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:13:39,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:13:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:13:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:13:39,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:13:39,777 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:13:39,955 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:13:39,957 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:13:40,293 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:13:40,411 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:13:40,411 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:13:40,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:40 BoogieIcfgContainer [2023-08-31 23:13:40,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:13:40,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:13:40,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:13:40,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:13:40,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:13:38" (1/3) ... [2023-08-31 23:13:40,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9e012c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:40, skipping insertion in model container [2023-08-31 23:13:40,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:39" (2/3) ... [2023-08-31 23:13:40,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9e012c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:40, skipping insertion in model container [2023-08-31 23:13:40,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:40" (3/3) ... [2023-08-31 23:13:40,423 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2023-08-31 23:13:40,438 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:13:40,438 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:13:40,438 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:13:40,505 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:13:40,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:13:40,606 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:13:40,606 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:40,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:13:40,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:13:40,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-08-31 23:13:40,618 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:13:40,632 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:13:40,636 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:13:40,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-08-31 23:13:40,669 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:13:40,670 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:40,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:13:40,674 INFO L119 LiptonReduction]: Number of co-enabled transitions 1956 [2023-08-31 23:13:46,520 INFO L134 LiptonReduction]: Checked pairs total: 5436 [2023-08-31 23:13:46,520 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-31 23:13:46,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:13:46,537 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;@1527a94a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:13:46,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:13:46,540 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:13:46,540 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:46,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:46,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:13:46,541 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:46,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:46,546 INFO L85 PathProgramCache]: Analyzing trace with hash 540, now seen corresponding path program 1 times [2023-08-31 23:13:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [870553283] [2023-08-31 23:13:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:46,556 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-31 23:13:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:46,563 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-31 23:13:46,565 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-31 23:13:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:46,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:13:46,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:46,641 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-31 23:13:46,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:46,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [870553283] [2023-08-31 23:13:46,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [870553283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:46,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:46,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:13:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674221236] [2023-08-31 23:13:46,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:46,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:13:46,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:46,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:13:46,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:13:46,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 237 [2023-08-31 23:13:46,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:46,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:46,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 237 [2023-08-31 23:13:46,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:47,043 INFO L130 PetriNetUnfolder]: 1263/1907 cut-off events. [2023-08-31 23:13:47,044 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 23:13:47,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 1907 events. 1263/1907 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9040 event pairs, 1263 based on Foata normal form. 72/1654 useless extension candidates. Maximal degree in co-relation 3803. Up to 1871 conditions per place. [2023-08-31 23:13:47,075 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-31 23:13:47,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-08-31 23:13:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:13:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:13:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 244 transitions. [2023-08-31 23:13:47,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147679324894515 [2023-08-31 23:13:47,091 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 244 transitions. [2023-08-31 23:13:47,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 244 transitions. [2023-08-31 23:13:47,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:47,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 244 transitions. [2023-08-31 23:13:47,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:47,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:47,107 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:47,109 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 244 transitions. [2023-08-31 23:13:47,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-08-31 23:13:47,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:47,117 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-31 23:13:47,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-31 23:13:47,123 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-31 23:13:47,123 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-31 23:13:47,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:47,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:47,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:47,143 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 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:13:47,343 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-31 23:13:47,344 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:47,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2145000404, now seen corresponding path program 1 times [2023-08-31 23:13:47,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146942874] [2023-08-31 23:13:47,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:47,346 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-31 23:13:47,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:47,347 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-31 23:13:47,350 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-31 23:13:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:47,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:13:47,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:47,455 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-31 23:13:47,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:47,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:47,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146942874] [2023-08-31 23:13:47,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146942874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:47,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:47,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:13:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062386221] [2023-08-31 23:13:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:47,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:13:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:47,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:13:47,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:13:47,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-31 23:13:47,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:47,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:47,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-31 23:13:47,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:47,672 INFO L130 PetriNetUnfolder]: 1043/1651 cut-off events. [2023-08-31 23:13:47,672 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:47,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1651 events. 1043/1651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8328 event pairs, 163 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 3237. Up to 1265 conditions per place. [2023-08-31 23:13:47,686 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2023-08-31 23:13:47,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 146 flow [2023-08-31 23:13:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:13:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:13:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-31 23:13:47,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4964838255977497 [2023-08-31 23:13:47,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-31 23:13:47,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-31 23:13:47,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:47,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-31 23:13:47,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:47,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:47,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:47,698 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 353 transitions. [2023-08-31 23:13:47,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 146 flow [2023-08-31 23:13:47,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:13:47,700 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-08-31 23:13:47,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-31 23:13:47,701 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-31 23:13:47,701 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-08-31 23:13:47,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:47,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:47,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:47,715 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-31 23:13:47,911 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-31 23:13:47,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:47,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1185628994, now seen corresponding path program 1 times [2023-08-31 23:13:47,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:47,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851707780] [2023-08-31 23:13:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:47,914 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-31 23:13:47,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:47,915 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-31 23:13:47,919 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-31 23:13:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:48,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:13:48,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:48,056 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-31 23:13:48,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:48,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851707780] [2023-08-31 23:13:48,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851707780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:48,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:13:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541464548] [2023-08-31 23:13:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:48,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:13:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:13:48,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:13:48,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-31 23:13:48,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:48,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-31 23:13:48,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:48,210 INFO L130 PetriNetUnfolder]: 417/695 cut-off events. [2023-08-31 23:13:48,210 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-08-31 23:13:48,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 695 events. 417/695 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2909 event pairs, 95 based on Foata normal form. 24/682 useless extension candidates. Maximal degree in co-relation 1458. Up to 609 conditions per place. [2023-08-31 23:13:48,213 INFO L137 encePairwiseOnDemand]: 232/237 looper letters, 29 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-08-31 23:13:48,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 152 flow [2023-08-31 23:13:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:13:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:13:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-31 23:13:48,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48241912798874825 [2023-08-31 23:13:48,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-31 23:13:48,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-31 23:13:48,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:48,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-31 23:13:48,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,219 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 3 states and 343 transitions. [2023-08-31 23:13:48,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 152 flow [2023-08-31 23:13:48,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:48,220 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 76 flow [2023-08-31 23:13:48,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-31 23:13:48,221 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-31 23:13:48,221 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 76 flow [2023-08-31 23:13:48,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:48,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:48,234 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-31 23:13:48,431 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-31 23:13:48,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:48,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1081505319, now seen corresponding path program 1 times [2023-08-31 23:13:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:48,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205674841] [2023-08-31 23:13:48,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:48,434 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-31 23:13:48,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:48,435 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-31 23:13:48,438 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-31 23:13:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:48,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:13:48,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:48,588 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-31 23:13:48,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:48,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:48,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205674841] [2023-08-31 23:13:48,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205674841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:48,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:48,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220941145] [2023-08-31 23:13:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:48,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:13:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:48,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:13:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:13:48,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-31 23:13:48,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 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-31 23:13:48,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:48,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-31 23:13:48,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:48,740 INFO L130 PetriNetUnfolder]: 157/305 cut-off events. [2023-08-31 23:13:48,741 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2023-08-31 23:13:48,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 305 events. 157/305 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1084 event pairs, 44 based on Foata normal form. 26/320 useless extension candidates. Maximal degree in co-relation 762. Up to 129 conditions per place. [2023-08-31 23:13:48,742 INFO L137 encePairwiseOnDemand]: 232/237 looper letters, 37 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2023-08-31 23:13:48,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 218 flow [2023-08-31 23:13:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:13:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:13:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2023-08-31 23:13:48,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820675105485232 [2023-08-31 23:13:48,745 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2023-08-31 23:13:48,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2023-08-31 23:13:48,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:48,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2023-08-31 23:13:48,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,749 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,749 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 76 flow. Second operand 4 states and 457 transitions. [2023-08-31 23:13:48,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 218 flow [2023-08-31 23:13:48,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:13:48,752 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 112 flow [2023-08-31 23:13:48,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-31 23:13:48,753 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2023-08-31 23:13:48,754 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 112 flow [2023-08-31 23:13:48,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 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-31 23:13:48,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:48,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:48,767 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-31 23:13:48,963 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-31 23:13:48,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:48,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:48,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2082015881, now seen corresponding path program 1 times [2023-08-31 23:13:48,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:48,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [631056012] [2023-08-31 23:13:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:48,965 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-31 23:13:48,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:48,967 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-31 23:13:48,970 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-31 23:13:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:49,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:13:49,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:49,100 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-31 23:13:49,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:49,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [631056012] [2023-08-31 23:13:49,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [631056012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:49,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:49,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:49,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669148146] [2023-08-31 23:13:49,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:49,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:49,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:49,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:49,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:49,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-31 23:13:49,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:49,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:49,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-31 23:13:49,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:49,271 INFO L130 PetriNetUnfolder]: 112/215 cut-off events. [2023-08-31 23:13:49,271 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-31 23:13:49,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 215 events. 112/215 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 702 event pairs, 39 based on Foata normal form. 9/222 useless extension candidates. Maximal degree in co-relation 607. Up to 90 conditions per place. [2023-08-31 23:13:49,273 INFO L137 encePairwiseOnDemand]: 232/237 looper letters, 34 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2023-08-31 23:13:49,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 242 flow [2023-08-31 23:13:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2023-08-31 23:13:49,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257383966244726 [2023-08-31 23:13:49,275 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 560 transitions. [2023-08-31 23:13:49,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 560 transitions. [2023-08-31 23:13:49,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:49,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 560 transitions. [2023-08-31 23:13:49,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:49,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:49,279 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:49,279 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 112 flow. Second operand 5 states and 560 transitions. [2023-08-31 23:13:49,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 242 flow [2023-08-31 23:13:49,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 228 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:49,281 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 126 flow [2023-08-31 23:13:49,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-31 23:13:49,282 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-31 23:13:49,282 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 126 flow [2023-08-31 23:13:49,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:49,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:49,282 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-31 23:13:49,294 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 (6)] Ended with exit code 0 [2023-08-31 23:13:49,491 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-31 23:13:49,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:49,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1446704970, now seen corresponding path program 1 times [2023-08-31 23:13:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:49,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829978922] [2023-08-31 23:13:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:49,493 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-31 23:13:49,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:49,495 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-31 23:13:49,497 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-31 23:13:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:49,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:13:49,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:49,951 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-31 23:13:49,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:49,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:49,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829978922] [2023-08-31 23:13:49,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829978922] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:49,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:49,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:49,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460069093] [2023-08-31 23:13:49,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:49,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:49,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:49,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:49,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:50,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 237 [2023-08-31 23:13:50,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:50,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 237 [2023-08-31 23:13:50,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:50,397 INFO L130 PetriNetUnfolder]: 112/220 cut-off events. [2023-08-31 23:13:50,397 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2023-08-31 23:13:50,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 220 events. 112/220 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 772 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 634. Up to 178 conditions per place. [2023-08-31 23:13:50,399 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 31 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-08-31 23:13:50,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 238 flow [2023-08-31 23:13:50,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:50,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 482 transitions. [2023-08-31 23:13:50,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40675105485232066 [2023-08-31 23:13:50,401 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 482 transitions. [2023-08-31 23:13:50,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 482 transitions. [2023-08-31 23:13:50,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:50,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 482 transitions. [2023-08-31 23:13:50,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,405 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,405 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 126 flow. Second operand 5 states and 482 transitions. [2023-08-31 23:13:50,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 238 flow [2023-08-31 23:13:50,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 204 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:50,408 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 104 flow [2023-08-31 23:13:50,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-31 23:13:50,410 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-31 23:13:50,411 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 104 flow [2023-08-31 23:13:50,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.8) internal successors, (474), 5 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:50,411 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-31 23:13:50,424 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-31 23:13:50,622 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-31 23:13:50,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:50,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:50,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1789615016, now seen corresponding path program 1 times [2023-08-31 23:13:50,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:50,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465137466] [2023-08-31 23:13:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:50,623 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-31 23:13:50,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:50,624 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-31 23:13:50,625 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-31 23:13:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:50,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:13:50,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:50,777 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-31 23:13:50,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:50,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:50,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465137466] [2023-08-31 23:13:50,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465137466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:50,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:50,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:50,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644110375] [2023-08-31 23:13:50,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:50,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:50,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:50,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:50,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 237 [2023-08-31 23:13:50,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:50,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 237 [2023-08-31 23:13:50,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:50,966 INFO L130 PetriNetUnfolder]: 151/318 cut-off events. [2023-08-31 23:13:50,966 INFO L131 PetriNetUnfolder]: For 231/231 co-relation queries the response was YES. [2023-08-31 23:13:50,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 318 events. 151/318 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1306 event pairs, 20 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 844. Up to 172 conditions per place. [2023-08-31 23:13:50,968 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 32 selfloop transitions, 1 changer transitions 22/56 dead transitions. [2023-08-31 23:13:50,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 332 flow [2023-08-31 23:13:50,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2023-08-31 23:13:50,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46582278481012657 [2023-08-31 23:13:50,971 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2023-08-31 23:13:50,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2023-08-31 23:13:50,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:50,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2023-08-31 23:13:50,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,974 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,974 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 104 flow. Second operand 5 states and 552 transitions. [2023-08-31 23:13:50,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 332 flow [2023-08-31 23:13:50,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 324 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:50,979 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 108 flow [2023-08-31 23:13:50,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-31 23:13:50,980 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-31 23:13:50,980 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 108 flow [2023-08-31 23:13:50,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:50,981 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-31 23:13:50,993 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-31 23:13:51,191 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-31 23:13:51,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:51,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash 426503308, now seen corresponding path program 2 times [2023-08-31 23:13:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:51,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567149112] [2023-08-31 23:13:51,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:13:51,193 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-31 23:13:51,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:51,194 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-31 23:13:51,197 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-31 23:13:51,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:13:51,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:13:51,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:13:51,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:13:51,317 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-31 23:13:51,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:13:51,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:13:51,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567149112] [2023-08-31 23:13:51,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567149112] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:51,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:51,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438722676] [2023-08-31 23:13:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:51,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:13:51,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:13:51,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:13:51,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:13:51,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 237 [2023-08-31 23:13:51,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:51,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 237 [2023-08-31 23:13:51,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:51,470 INFO L130 PetriNetUnfolder]: 212/404 cut-off events. [2023-08-31 23:13:51,471 INFO L131 PetriNetUnfolder]: For 319/319 co-relation queries the response was YES. [2023-08-31 23:13:51,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 404 events. 212/404 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1643 event pairs, 98 based on Foata normal form. 1/405 useless extension candidates. Maximal degree in co-relation 1176. Up to 246 conditions per place. [2023-08-31 23:13:51,472 INFO L137 encePairwiseOnDemand]: 233/237 looper letters, 29 selfloop transitions, 2 changer transitions 16/48 dead transitions. [2023-08-31 23:13:51,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 287 flow [2023-08-31 23:13:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:13:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:13:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2023-08-31 23:13:51,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257383966244726 [2023-08-31 23:13:51,474 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 448 transitions. [2023-08-31 23:13:51,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 448 transitions. [2023-08-31 23:13:51,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:51,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 448 transitions. [2023-08-31 23:13:51,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,478 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,478 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 108 flow. Second operand 4 states and 448 transitions. [2023-08-31 23:13:51,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 287 flow [2023-08-31 23:13:51,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 280 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:51,481 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 113 flow [2023-08-31 23:13:51,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-31 23:13:51,481 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-31 23:13:51,481 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 113 flow [2023-08-31 23:13:51,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:51,482 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-31 23:13:51,493 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-31 23:13:51,691 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-31 23:13:51,692 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:13:51,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1939537606, now seen corresponding path program 3 times [2023-08-31 23:13:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:13:51,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830402678] [2023-08-31 23:13:51,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:13:51,693 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-31 23:13:51,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:13:51,694 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-31 23:13:51,697 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-31 23:13:51,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:13:51,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:13:51,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:13:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:13:51,933 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:13:51,933 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:13:51,934 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:13:51,935 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:13:51,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:13:51,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:13:51,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:13:51,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:13:51,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:13:51,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:13:51,936 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:13:51,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:13:51,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:13:51,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:13:51,937 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:13:51,953 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-31 23:13:52,153 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-31 23:13:52,153 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:52,158 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:13:52,158 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:13:52,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:13:52 BasicIcfg [2023-08-31 23:13:52,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:13:52,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:13:52,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:13:52,224 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:13:52,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:40" (3/4) ... [2023-08-31 23:13:52,236 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:13:52,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:13:52,237 INFO L158 Benchmark]: Toolchain (without parser) took 13298.28ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 57.0MB in the beginning and 36.4MB in the end (delta: 20.6MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2023-08-31 23:13:52,237 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 43.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:13:52,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.88ms. Allocated memory is still 81.8MB. Free memory was 57.0MB in the beginning and 54.1MB in the end (delta: 2.9MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-08-31 23:13:52,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.71ms. Allocated memory is still 81.8MB. Free memory was 54.1MB in the beginning and 51.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:13:52,238 INFO L158 Benchmark]: Boogie Preprocessor took 57.33ms. Allocated memory is still 81.8MB. Free memory was 51.4MB in the beginning and 49.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:13:52,243 INFO L158 Benchmark]: RCFGBuilder took 717.54ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 49.3MB in the beginning and 73.7MB in the end (delta: -24.4MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-08-31 23:13:52,243 INFO L158 Benchmark]: TraceAbstraction took 11807.18ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 73.0MB in the beginning and 36.4MB in the end (delta: 36.6MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2023-08-31 23:13:52,244 INFO L158 Benchmark]: Witness Printer took 12.47ms. Allocated memory is still 119.5MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:13:52,245 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 43.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 608.88ms. Allocated memory is still 81.8MB. Free memory was 57.0MB in the beginning and 54.1MB in the end (delta: 2.9MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.71ms. Allocated memory is still 81.8MB. Free memory was 54.1MB in the beginning and 51.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.33ms. Allocated memory is still 81.8MB. Free memory was 51.4MB in the beginning and 49.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 717.54ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 49.3MB in the beginning and 73.7MB in the end (delta: -24.4MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11807.18ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 73.0MB in the beginning and 36.4MB in the end (delta: 36.6MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * Witness Printer took 12.47ms. Allocated memory is still 119.5MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 124 PlacesBefore, 41 PlacesAfterwards, 116 TransitionsBefore, 32 TransitionsAfterwards, 1956 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 5436 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2590, independent: 2413, independent conditional: 0, independent unconditional: 2413, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1068, independent: 1040, independent conditional: 0, independent unconditional: 1040, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2590, independent: 1373, independent conditional: 0, independent unconditional: 1373, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1068, unknown conditional: 0, unknown unconditional: 1068] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500, ((void *)0), P0, ((void *)0))=0, t500={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501, ((void *)0), P1, ((void *)0))=1, t500={3:0}, t501={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502, ((void *)0), P2, ((void *)0))=2, t500={3:0}, t501={7:0}, t502={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L760] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={3:0}, t501={7:0}, t502={15:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 842]: 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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 828 IncrementalHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 37 mSDtfsCounter, 828 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 14 QuantifiedInterpolants, 835 SizeOfPredicates, 5 NumberOfNonLiveVariables, 963 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:13:52,268 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