./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix004.oepc.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/mix004.oepc.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 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 --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:06:49,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:06:49,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:06:50,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:06:50,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:06:50,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:06:50,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:06:50,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:06:50,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:06:50,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:06:50,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:06:50,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:06:50,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:06:50,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:06:50,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:06:50,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:06:50,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:06:50,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:06:50,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:06:50,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:06:50,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:06:50,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:06:50,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:06:50,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:06:50,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:06:50,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:06:50,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:06:50,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:06:50,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:06:50,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:06:50,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:06:50,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:06:50,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:06:50,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:06:50,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:06:50,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:06:50,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:06:50,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:06:50,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:06:50,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:06:50,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:06:50,104 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:06:50,141 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:06:50,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:06:50,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:06:50,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:06:50,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:06:50,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:06:50,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:06:50,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:06:50,145 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:06:50,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:06:50,146 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:06:50,146 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:06:50,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:06:50,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:06:50,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:06:50,147 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:06:50,147 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:06:50,148 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:06:50,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:06:50,148 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:06:50,148 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:06:50,148 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:06:50,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:06:50,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:06:50,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:06:50,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:06:50,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:06:50,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:06:50,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:06:50,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:06:50,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:06:50,150 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:06:50,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:06:50,151 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:06:50,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 -> 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 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:06:50,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:06:50,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:06:50,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:06:50,492 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:06:50,493 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:06:50,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2023-08-31 23:06:51,619 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:06:51,840 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:06:51,841 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2023-08-31 23:06:51,854 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c189fb4ac/914918a75b6143ccba54b0b124f5c77f/FLAG25edc5f4c [2023-08-31 23:06:51,867 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c189fb4ac/914918a75b6143ccba54b0b124f5c77f [2023-08-31 23:06:51,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:06:51,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:06:51,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:06:51,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:06:51,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:06:51,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:06:51" (1/1) ... [2023-08-31 23:06:51,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c87fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:51, skipping insertion in model container [2023-08-31 23:06:51,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:06:51" (1/1) ... [2023-08-31 23:06:51,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:06:51,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:06:52,055 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/mix004.oepc.i[945,958] [2023-08-31 23:06:52,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:06:52,243 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:06:52,256 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/mix004.oepc.i[945,958] [2023-08-31 23:06:52,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:06:52,354 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:06:52,355 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:06:52,360 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:06:52,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52 WrapperNode [2023-08-31 23:06:52,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:06:52,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:06:52,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:06:52,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:06:52,368 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:06:52" (1/1) ... [2023-08-31 23:06:52,389 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:06:52" (1/1) ... [2023-08-31 23:06:52,410 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-31 23:06:52,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:06:52,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:06:52,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:06:52,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:06:52,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (1/1) ... [2023-08-31 23:06:52,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (1/1) ... [2023-08-31 23:06:52,422 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (1/1) ... [2023-08-31 23:06:52,422 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (1/1) ... [2023-08-31 23:06:52,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (1/1) ... [2023-08-31 23:06:52,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (1/1) ... [2023-08-31 23:06:52,433 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (1/1) ... [2023-08-31 23:06:52,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (1/1) ... [2023-08-31 23:06:52,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:06:52,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:06:52,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:06:52,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:06:52,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (1/1) ... [2023-08-31 23:06:52,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:06:52,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:06:52,490 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:06:52,506 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:06:52,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:06:52,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:06:52,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:06:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:06:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:06:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:06:52,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:06:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:06:52,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:06:52,533 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:06:52,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:06:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:06:52,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:06:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:06:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:06:52,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:06:52,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:06:52,535 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:06:52,690 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:06:52,691 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:06:53,064 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:06:53,183 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:06:53,183 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:06:53,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:06:53 BoogieIcfgContainer [2023-08-31 23:06:53,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:06:53,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:06:53,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:06:53,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:06:53,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:06:51" (1/3) ... [2023-08-31 23:06:53,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687729e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:06:53, skipping insertion in model container [2023-08-31 23:06:53,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:06:52" (2/3) ... [2023-08-31 23:06:53,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687729e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:06:53, skipping insertion in model container [2023-08-31 23:06:53,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:06:53" (3/3) ... [2023-08-31 23:06:53,192 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2023-08-31 23:06:53,206 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:06:53,206 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:06:53,206 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:06:53,259 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:06:53,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-31 23:06:53,379 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-31 23:06:53,379 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:06:53,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:06:53,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-31 23:06:53,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-31 23:06:53,402 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:06:53,421 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-31 23:06:53,427 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-31 23:06:53,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-31 23:06:53,466 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-31 23:06:53,467 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:06:53,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:06:53,472 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-31 23:06:58,724 INFO L134 LiptonReduction]: Checked pairs total: 12455 [2023-08-31 23:06:58,725 INFO L136 LiptonReduction]: Total number of compositions: 133 [2023-08-31 23:06:58,750 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:06:58,755 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;@bcbd58d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:06:58,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:06:58,756 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:06:58,756 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:06:58,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:06:58,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:06:58,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:06:58,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:06:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash 613, now seen corresponding path program 1 times [2023-08-31 23:06:58,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:06:58,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174533385] [2023-08-31 23:06:58,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:06:58,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:06:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:06:58,876 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:06:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:06:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174533385] [2023-08-31 23:06:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174533385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:06:58,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:06:58,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:06:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232460852] [2023-08-31 23:06:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:06:58,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:06:58,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:06:58,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:06:58,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:06:58,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 279 [2023-08-31 23:06:58,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:06:58,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:06:58,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 279 [2023-08-31 23:06:58,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:00,585 INFO L130 PetriNetUnfolder]: 9959/13469 cut-off events. [2023-08-31 23:07:00,585 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-31 23:07:00,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27057 conditions, 13469 events. 9959/13469 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 72899 event pairs, 9959 based on Foata normal form. 400/11820 useless extension candidates. Maximal degree in co-relation 27045. Up to 13371 conditions per place. [2023-08-31 23:07:00,656 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 29 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2023-08-31 23:07:00,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 138 flow [2023-08-31 23:07:00,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:07:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:07:00,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 300 transitions. [2023-08-31 23:07:00,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2023-08-31 23:07:00,670 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 300 transitions. [2023-08-31 23:07:00,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 300 transitions. [2023-08-31 23:07:00,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:00,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 300 transitions. [2023-08-31 23:07:00,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 150.0) internal successors, (300), 2 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:07:00,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states 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:07:00,679 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states 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:07:00,681 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 2 states and 300 transitions. [2023-08-31 23:07:00,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 138 flow [2023-08-31 23:07:00,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:07:00,687 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-31 23:07:00,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-31 23:07:00,691 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-31 23:07:00,691 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-31 23:07:00,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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:07:00,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:00,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:07:00,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:07:00,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:00,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash 602483, now seen corresponding path program 1 times [2023-08-31 23:07:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:00,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528004195] [2023-08-31 23:07:00,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:00,909 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:07:00,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:00,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528004195] [2023-08-31 23:07:00,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528004195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:00,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:07:00,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754019713] [2023-08-31 23:07:00,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:00,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:07:00,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:00,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:07:00,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:07:00,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 279 [2023-08-31 23:07:00,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:00,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:00,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 279 [2023-08-31 23:07:00,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:02,152 INFO L130 PetriNetUnfolder]: 7831/11262 cut-off events. [2023-08-31 23:07:02,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:07:02,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21995 conditions, 11262 events. 7831/11262 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 71036 event pairs, 1447 based on Foata normal form. 0/10265 useless extension candidates. Maximal degree in co-relation 21992. Up to 8431 conditions per place. [2023-08-31 23:07:02,206 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 45 selfloop transitions, 2 changer transitions 4/56 dead transitions. [2023-08-31 23:07:02,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 228 flow [2023-08-31 23:07:02,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:07:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:07:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-08-31 23:07:02,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280764635603346 [2023-08-31 23:07:02,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-08-31 23:07:02,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-08-31 23:07:02,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:02,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-08-31 23:07:02,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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:07:02,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states 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:07:02,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states 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:07:02,227 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 442 transitions. [2023-08-31 23:07:02,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 228 flow [2023-08-31 23:07:02,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:07:02,228 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 74 flow [2023-08-31 23:07:02,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-08-31 23:07:02,229 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-31 23:07:02,229 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 74 flow [2023-08-31 23:07:02,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:02,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:02,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:02,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:07:02,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:02,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 801735327, now seen corresponding path program 1 times [2023-08-31 23:07:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:02,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010984610] [2023-08-31 23:07:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:02,582 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:07:02,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:02,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010984610] [2023-08-31 23:07:02,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010984610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:02,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:02,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:07:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893385780] [2023-08-31 23:07:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:02,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:07:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:02,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:07:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:07:02,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 279 [2023-08-31 23:07:02,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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:07:02,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:02,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 279 [2023-08-31 23:07:02,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:04,560 INFO L130 PetriNetUnfolder]: 20371/27000 cut-off events. [2023-08-31 23:07:04,560 INFO L131 PetriNetUnfolder]: For 1315/1315 co-relation queries the response was YES. [2023-08-31 23:07:04,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55683 conditions, 27000 events. 20371/27000 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 131554 event pairs, 8903 based on Foata normal form. 0/26116 useless extension candidates. Maximal degree in co-relation 55679. Up to 19129 conditions per place. [2023-08-31 23:07:04,695 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 65 selfloop transitions, 11 changer transitions 0/76 dead transitions. [2023-08-31 23:07:04,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 328 flow [2023-08-31 23:07:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:07:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:07:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-31 23:07:04,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824372759856631 [2023-08-31 23:07:04,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-31 23:07:04,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-31 23:07:04,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:04,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-31 23:07:04,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:07:04,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:04,705 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:04,705 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 74 flow. Second operand 5 states and 673 transitions. [2023-08-31 23:07:04,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 328 flow [2023-08-31 23:07:04,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:07:04,708 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 158 flow [2023-08-31 23:07:04,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-31 23:07:04,710 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -6 predicate places. [2023-08-31 23:07:04,713 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 158 flow [2023-08-31 23:07:04,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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:07:04,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:04,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:04,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:07:04,714 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:04,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:04,715 INFO L85 PathProgramCache]: Analyzing trace with hash 801735379, now seen corresponding path program 1 times [2023-08-31 23:07:04,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:04,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235750885] [2023-08-31 23:07:04,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:04,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:05,349 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:07:05,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:05,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235750885] [2023-08-31 23:07:05,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235750885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:05,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:05,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:07:05,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250194776] [2023-08-31 23:07:05,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:05,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:07:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:05,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:07:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:07:05,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 279 [2023-08-31 23:07:05,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:05,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:05,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 279 [2023-08-31 23:07:05,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:06,880 INFO L130 PetriNetUnfolder]: 10502/14785 cut-off events. [2023-08-31 23:07:06,880 INFO L131 PetriNetUnfolder]: For 6559/6899 co-relation queries the response was YES. [2023-08-31 23:07:06,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34184 conditions, 14785 events. 10502/14785 cut-off events. For 6559/6899 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 85335 event pairs, 1918 based on Foata normal form. 1280/15622 useless extension candidates. Maximal degree in co-relation 34177. Up to 9649 conditions per place. [2023-08-31 23:07:06,972 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 52 selfloop transitions, 6 changer transitions 5/70 dead transitions. [2023-08-31 23:07:06,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 336 flow [2023-08-31 23:07:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:07:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:07:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-08-31 23:07:06,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4352278545826933 [2023-08-31 23:07:06,976 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-08-31 23:07:06,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-08-31 23:07:06,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:06,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-08-31 23:07:06,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states 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:07:06,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:07:06,982 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:07:06,983 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 158 flow. Second operand 7 states and 850 transitions. [2023-08-31 23:07:06,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 336 flow [2023-08-31 23:07:06,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:07:06,991 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 120 flow [2023-08-31 23:07:06,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-08-31 23:07:06,992 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2023-08-31 23:07:06,992 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 120 flow [2023-08-31 23:07:06,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:06,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:06,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:06,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:07:06,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:06,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1987516752, now seen corresponding path program 1 times [2023-08-31 23:07:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100572061] [2023-08-31 23:07:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:07,301 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:07:07,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100572061] [2023-08-31 23:07:07,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100572061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:07,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:07,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:07:07,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907743558] [2023-08-31 23:07:07,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:07,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:07:07,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:07,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:07:07,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:07:07,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 279 [2023-08-31 23:07:07,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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:07:07,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:07,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 279 [2023-08-31 23:07:07,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:08,585 INFO L130 PetriNetUnfolder]: 14747/19860 cut-off events. [2023-08-31 23:07:08,585 INFO L131 PetriNetUnfolder]: For 11681/11681 co-relation queries the response was YES. [2023-08-31 23:07:08,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49681 conditions, 19860 events. 14747/19860 cut-off events. For 11681/11681 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 95482 event pairs, 3781 based on Foata normal form. 852/20712 useless extension candidates. Maximal degree in co-relation 49674. Up to 12401 conditions per place. [2023-08-31 23:07:08,689 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 46 selfloop transitions, 3 changer transitions 32/81 dead transitions. [2023-08-31 23:07:08,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 420 flow [2023-08-31 23:07:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:07:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:07:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-31 23:07:08,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831541218637993 [2023-08-31 23:07:08,693 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-31 23:07:08,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-31 23:07:08,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:08,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-31 23:07:08,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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:07:08,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:08,699 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:08,699 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 120 flow. Second operand 5 states and 674 transitions. [2023-08-31 23:07:08,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 420 flow [2023-08-31 23:07:08,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 407 flow, removed 1 selfloop flow, removed 6 redundant places. [2023-08-31 23:07:08,821 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 123 flow [2023-08-31 23:07:08,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2023-08-31 23:07:08,825 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -4 predicate places. [2023-08-31 23:07:08,825 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 123 flow [2023-08-31 23:07:08,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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:07:08,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:08,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:08,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:07:08,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:08,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:08,827 INFO L85 PathProgramCache]: Analyzing trace with hash -289518585, now seen corresponding path program 1 times [2023-08-31 23:07:08,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:08,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943762443] [2023-08-31 23:07:08,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:08,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:09,060 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:07:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:09,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943762443] [2023-08-31 23:07:09,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943762443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:09,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:09,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:07:09,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144776793] [2023-08-31 23:07:09,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:09,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:07:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:09,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:07:09,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:07:09,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 279 [2023-08-31 23:07:09,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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:07:09,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:09,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 279 [2023-08-31 23:07:09,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:10,175 INFO L130 PetriNetUnfolder]: 12729/17190 cut-off events. [2023-08-31 23:07:10,175 INFO L131 PetriNetUnfolder]: For 12401/12401 co-relation queries the response was YES. [2023-08-31 23:07:10,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44037 conditions, 17190 events. 12729/17190 cut-off events. For 12401/12401 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 83519 event pairs, 3257 based on Foata normal form. 600/17790 useless extension candidates. Maximal degree in co-relation 44028. Up to 11381 conditions per place. [2023-08-31 23:07:10,254 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 48 selfloop transitions, 3 changer transitions 28/79 dead transitions. [2023-08-31 23:07:10,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 413 flow [2023-08-31 23:07:10,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:07:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:07:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-31 23:07:10,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4817204301075269 [2023-08-31 23:07:10,257 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-31 23:07:10,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-31 23:07:10,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:10,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-31 23:07:10,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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:07:10,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:10,261 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:10,261 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 123 flow. Second operand 5 states and 672 transitions. [2023-08-31 23:07:10,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 413 flow [2023-08-31 23:07:10,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 401 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-31 23:07:10,332 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 128 flow [2023-08-31 23:07:10,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2023-08-31 23:07:10,333 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2023-08-31 23:07:10,333 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 128 flow [2023-08-31 23:07:10,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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:07:10,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:10,334 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:07:10,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:07:10,334 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:10,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash -127196586, now seen corresponding path program 1 times [2023-08-31 23:07:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:10,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407072433] [2023-08-31 23:07:10,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:10,531 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:07:10,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:10,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407072433] [2023-08-31 23:07:10,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407072433] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:10,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:10,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:07:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141570881] [2023-08-31 23:07:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:10,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:07:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:07:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:07:10,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:07:10,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:10,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:10,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:07:10,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:11,239 INFO L130 PetriNetUnfolder]: 5263/7757 cut-off events. [2023-08-31 23:07:11,239 INFO L131 PetriNetUnfolder]: For 1960/2134 co-relation queries the response was YES. [2023-08-31 23:07:11,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17466 conditions, 7757 events. 5263/7757 cut-off events. For 1960/2134 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 44662 event pairs, 1097 based on Foata normal form. 541/8129 useless extension candidates. Maximal degree in co-relation 17456. Up to 5036 conditions per place. [2023-08-31 23:07:11,267 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 61 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2023-08-31 23:07:11,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 368 flow [2023-08-31 23:07:11,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:07:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:07:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2023-08-31 23:07:11,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003584229390681 [2023-08-31 23:07:11,270 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2023-08-31 23:07:11,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2023-08-31 23:07:11,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:11,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2023-08-31 23:07:11,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states 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:07:11,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:11,275 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:11,275 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 128 flow. Second operand 5 states and 698 transitions. [2023-08-31 23:07:11,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 368 flow [2023-08-31 23:07:11,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 358 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-31 23:07:11,293 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 193 flow [2023-08-31 23:07:11,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-31 23:07:11,294 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2023-08-31 23:07:11,294 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 193 flow [2023-08-31 23:07:11,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:11,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:11,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:11,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:07:11,295 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:11,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:11,296 INFO L85 PathProgramCache]: Analyzing trace with hash 766317586, now seen corresponding path program 1 times [2023-08-31 23:07:11,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:11,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291899349] [2023-08-31 23:07:11,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:11,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:11,481 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:07:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:11,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291899349] [2023-08-31 23:07:11,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291899349] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:11,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:11,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:07:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830168995] [2023-08-31 23:07:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:11,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:07:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:11,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:07:11,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:07:11,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:07:11,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:11,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:11,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:07:11,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:12,218 INFO L130 PetriNetUnfolder]: 3946/6066 cut-off events. [2023-08-31 23:07:12,218 INFO L131 PetriNetUnfolder]: For 2867/2955 co-relation queries the response was YES. [2023-08-31 23:07:12,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17081 conditions, 6066 events. 3946/6066 cut-off events. For 2867/2955 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 36274 event pairs, 633 based on Foata normal form. 350/6265 useless extension candidates. Maximal degree in co-relation 17070. Up to 1868 conditions per place. [2023-08-31 23:07:12,245 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 83 selfloop transitions, 19 changer transitions 0/111 dead transitions. [2023-08-31 23:07:12,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 111 transitions, 593 flow [2023-08-31 23:07:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:07:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:07:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 979 transitions. [2023-08-31 23:07:12,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012800819252432 [2023-08-31 23:07:12,248 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 979 transitions. [2023-08-31 23:07:12,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 979 transitions. [2023-08-31 23:07:12,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:12,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 979 transitions. [2023-08-31 23:07:12,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.85714285714286) internal successors, (979), 7 states have internal predecessors, (979), 0 states have call successors, (0), 0 states 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:07:12,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:07:12,254 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:07:12,254 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 193 flow. Second operand 7 states and 979 transitions. [2023-08-31 23:07:12,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 111 transitions, 593 flow [2023-08-31 23:07:12,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 588 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:07:12,273 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 322 flow [2023-08-31 23:07:12,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2023-08-31 23:07:12,274 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 6 predicate places. [2023-08-31 23:07:12,274 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 322 flow [2023-08-31 23:07:12,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:12,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:12,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:12,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:07:12,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:12,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:12,276 INFO L85 PathProgramCache]: Analyzing trace with hash 383161602, now seen corresponding path program 1 times [2023-08-31 23:07:12,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:12,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133409198] [2023-08-31 23:07:12,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:12,586 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:07:12,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133409198] [2023-08-31 23:07:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133409198] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:12,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:07:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681035335] [2023-08-31 23:07:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:12,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:07:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:07:12,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:07:12,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:07:12,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:12,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:12,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:07:12,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:13,318 INFO L130 PetriNetUnfolder]: 3516/5432 cut-off events. [2023-08-31 23:07:13,318 INFO L131 PetriNetUnfolder]: For 6355/6423 co-relation queries the response was YES. [2023-08-31 23:07:13,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17855 conditions, 5432 events. 3516/5432 cut-off events. For 6355/6423 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 32496 event pairs, 539 based on Foata normal form. 116/5399 useless extension candidates. Maximal degree in co-relation 17841. Up to 1743 conditions per place. [2023-08-31 23:07:13,344 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 92 selfloop transitions, 28 changer transitions 11/140 dead transitions. [2023-08-31 23:07:13,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 140 transitions, 872 flow [2023-08-31 23:07:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:07:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:07:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1258 transitions. [2023-08-31 23:07:13,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009956192751892 [2023-08-31 23:07:13,348 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1258 transitions. [2023-08-31 23:07:13,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1258 transitions. [2023-08-31 23:07:13,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:13,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1258 transitions. [2023-08-31 23:07:13,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 139.77777777777777) internal successors, (1258), 9 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states 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:07:13,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states 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:07:13,356 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states 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:07:13,356 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 322 flow. Second operand 9 states and 1258 transitions. [2023-08-31 23:07:13,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 140 transitions, 872 flow [2023-08-31 23:07:13,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 140 transitions, 822 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-31 23:07:13,520 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 450 flow [2023-08-31 23:07:13,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=450, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-08-31 23:07:13,521 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2023-08-31 23:07:13,521 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 450 flow [2023-08-31 23:07:13,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:13,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:13,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:13,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:07:13,522 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:13,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash -625131917, now seen corresponding path program 1 times [2023-08-31 23:07:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:13,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644843339] [2023-08-31 23:07:13,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:14,011 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:07:14,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:14,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644843339] [2023-08-31 23:07:14,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644843339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:14,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:14,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:07:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447616857] [2023-08-31 23:07:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:14,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:07:14,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:07:14,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:07:14,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-31 23:07:14,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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:07:14,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:14,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-31 23:07:14,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:15,517 INFO L130 PetriNetUnfolder]: 8090/12943 cut-off events. [2023-08-31 23:07:15,518 INFO L131 PetriNetUnfolder]: For 27495/27876 co-relation queries the response was YES. [2023-08-31 23:07:15,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43032 conditions, 12943 events. 8090/12943 cut-off events. For 27495/27876 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 90761 event pairs, 923 based on Foata normal form. 16/12711 useless extension candidates. Maximal degree in co-relation 43015. Up to 4914 conditions per place. [2023-08-31 23:07:15,591 INFO L137 encePairwiseOnDemand]: 268/279 looper letters, 171 selfloop transitions, 22 changer transitions 31/232 dead transitions. [2023-08-31 23:07:15,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 232 transitions, 2209 flow [2023-08-31 23:07:15,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:07:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:07:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1226 transitions. [2023-08-31 23:07:15,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48825169255276785 [2023-08-31 23:07:15,595 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1226 transitions. [2023-08-31 23:07:15,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1226 transitions. [2023-08-31 23:07:15,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:15,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1226 transitions. [2023-08-31 23:07:15,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 136.22222222222223) internal successors, (1226), 9 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states 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:07:15,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states 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:07:15,602 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states 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:07:15,602 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 450 flow. Second operand 9 states and 1226 transitions. [2023-08-31 23:07:15,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 232 transitions, 2209 flow [2023-08-31 23:07:16,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 232 transitions, 1774 flow, removed 148 selfloop flow, removed 4 redundant places. [2023-08-31 23:07:16,024 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 544 flow [2023-08-31 23:07:16,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=544, PETRI_PLACES=80, PETRI_TRANSITIONS=81} [2023-08-31 23:07:16,024 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 25 predicate places. [2023-08-31 23:07:16,025 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 544 flow [2023-08-31 23:07:16,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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:07:16,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:16,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:16,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:07:16,026 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:16,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1163097079, now seen corresponding path program 2 times [2023-08-31 23:07:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:16,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382928209] [2023-08-31 23:07:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:16,864 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:07:16,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:16,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382928209] [2023-08-31 23:07:16,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382928209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:16,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:16,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:07:16,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992341800] [2023-08-31 23:07:16,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:16,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:07:16,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:16,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:07:16,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:07:16,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:07:16,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 544 flow. Second operand has 8 states, 8 states have (on average 127.75) internal successors, (1022), 8 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states 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:07:16,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:16,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:07:16,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:18,570 INFO L130 PetriNetUnfolder]: 10696/17421 cut-off events. [2023-08-31 23:07:18,570 INFO L131 PetriNetUnfolder]: For 47656/48980 co-relation queries the response was YES. [2023-08-31 23:07:18,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72481 conditions, 17421 events. 10696/17421 cut-off events. For 47656/48980 co-relation queries the response was YES. Maximal size of possible extension queue 1042. Compared 132228 event pairs, 2479 based on Foata normal form. 289/17313 useless extension candidates. Maximal degree in co-relation 72456. Up to 6109 conditions per place. [2023-08-31 23:07:18,670 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 190 selfloop transitions, 22 changer transitions 28/251 dead transitions. [2023-08-31 23:07:18,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 251 transitions, 2181 flow [2023-08-31 23:07:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:07:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:07:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 982 transitions. [2023-08-31 23:07:18,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028161802355351 [2023-08-31 23:07:18,674 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 982 transitions. [2023-08-31 23:07:18,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 982 transitions. [2023-08-31 23:07:18,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:18,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 982 transitions. [2023-08-31 23:07:18,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.28571428571428) internal successors, (982), 7 states have internal predecessors, (982), 0 states have call successors, (0), 0 states 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:07:18,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:07:18,680 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:07:18,680 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 544 flow. Second operand 7 states and 982 transitions. [2023-08-31 23:07:18,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 251 transitions, 2181 flow [2023-08-31 23:07:20,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 251 transitions, 2171 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-31 23:07:20,036 INFO L231 Difference]: Finished difference. Result has 87 places, 87 transitions, 682 flow [2023-08-31 23:07:20,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=682, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2023-08-31 23:07:20,037 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2023-08-31 23:07:20,037 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 682 flow [2023-08-31 23:07:20,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.75) internal successors, (1022), 8 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states 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:07:20,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:20,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:20,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:07:20,038 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:20,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:20,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1579677895, now seen corresponding path program 3 times [2023-08-31 23:07:20,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:20,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029817814] [2023-08-31 23:07:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:20,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:20,289 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:07:20,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:20,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029817814] [2023-08-31 23:07:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029817814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:20,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:07:20,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570755501] [2023-08-31 23:07:20,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:20,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:07:20,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:20,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:07:20,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:07:20,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:07:20,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 682 flow. Second operand has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:07:20,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:20,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:07:20,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:21,949 INFO L130 PetriNetUnfolder]: 10514/16362 cut-off events. [2023-08-31 23:07:21,949 INFO L131 PetriNetUnfolder]: For 73578/74793 co-relation queries the response was YES. [2023-08-31 23:07:22,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75534 conditions, 16362 events. 10514/16362 cut-off events. For 73578/74793 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 118723 event pairs, 683 based on Foata normal form. 264/16251 useless extension candidates. Maximal degree in co-relation 75505. Up to 5624 conditions per place. [2023-08-31 23:07:22,043 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 202 selfloop transitions, 33 changer transitions 29/275 dead transitions. [2023-08-31 23:07:22,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 275 transitions, 2701 flow [2023-08-31 23:07:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 23:07:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 23:07:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1509 transitions. [2023-08-31 23:07:22,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4916911045943304 [2023-08-31 23:07:22,047 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1509 transitions. [2023-08-31 23:07:22,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1509 transitions. [2023-08-31 23:07:22,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:22,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1509 transitions. [2023-08-31 23:07:22,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 137.1818181818182) internal successors, (1509), 11 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states 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:07:22,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states 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:07:22,054 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 279.0) internal successors, (3348), 12 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states 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:07:22,054 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 682 flow. Second operand 11 states and 1509 transitions. [2023-08-31 23:07:22,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 275 transitions, 2701 flow [2023-08-31 23:07:23,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 275 transitions, 2567 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-08-31 23:07:23,873 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 674 flow [2023-08-31 23:07:23,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=674, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2023-08-31 23:07:23,873 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 38 predicate places. [2023-08-31 23:07:23,873 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 674 flow [2023-08-31 23:07:23,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:07:23,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:23,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:23,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:07:23,874 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:23,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1459571354, now seen corresponding path program 1 times [2023-08-31 23:07:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:23,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321400314] [2023-08-31 23:07:23,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:24,184 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:07:24,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:24,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321400314] [2023-08-31 23:07:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321400314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:24,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:24,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:07:24,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863784025] [2023-08-31 23:07:24,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:24,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:07:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:07:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:07:24,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 279 [2023-08-31 23:07:24,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 674 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:07:24,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:24,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 279 [2023-08-31 23:07:24,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:27,179 INFO L130 PetriNetUnfolder]: 25022/36814 cut-off events. [2023-08-31 23:07:27,179 INFO L131 PetriNetUnfolder]: For 157422/157422 co-relation queries the response was YES. [2023-08-31 23:07:27,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177562 conditions, 36814 events. 25022/36814 cut-off events. For 157422/157422 co-relation queries the response was YES. Maximal size of possible extension queue 1470. Compared 251710 event pairs, 5372 based on Foata normal form. 2/36816 useless extension candidates. Maximal degree in co-relation 177534. Up to 18595 conditions per place. [2023-08-31 23:07:27,417 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 92 selfloop transitions, 4 changer transitions 142/238 dead transitions. [2023-08-31 23:07:27,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 238 transitions, 2304 flow [2023-08-31 23:07:27,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:07:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:07:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 917 transitions. [2023-08-31 23:07:27,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46953405017921146 [2023-08-31 23:07:27,420 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 917 transitions. [2023-08-31 23:07:27,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 917 transitions. [2023-08-31 23:07:27,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:27,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 917 transitions. [2023-08-31 23:07:27,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.0) internal successors, (917), 7 states have internal predecessors, (917), 0 states have call successors, (0), 0 states 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:07:27,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:07:27,425 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states 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:07:27,425 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 674 flow. Second operand 7 states and 917 transitions. [2023-08-31 23:07:27,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 238 transitions, 2304 flow [2023-08-31 23:07:30,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 238 transitions, 2013 flow, removed 63 selfloop flow, removed 11 redundant places. [2023-08-31 23:07:30,953 INFO L231 Difference]: Finished difference. Result has 90 places, 57 transitions, 366 flow [2023-08-31 23:07:30,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=90, PETRI_TRANSITIONS=57} [2023-08-31 23:07:30,954 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 35 predicate places. [2023-08-31 23:07:30,954 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 57 transitions, 366 flow [2023-08-31 23:07:30,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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:07:30,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:30,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:30,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:07:30,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:30,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:30,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1957851624, now seen corresponding path program 2 times [2023-08-31 23:07:30,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:30,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350040706] [2023-08-31 23:07:30,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:30,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:31,176 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:07:31,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350040706] [2023-08-31 23:07:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350040706] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:31,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:07:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380679899] [2023-08-31 23:07:31,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:31,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:07:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:31,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:07:31,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:07:31,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 279 [2023-08-31 23:07:31,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 57 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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:07:31,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:31,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 279 [2023-08-31 23:07:31,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:31,706 INFO L130 PetriNetUnfolder]: 2462/4128 cut-off events. [2023-08-31 23:07:31,707 INFO L131 PetriNetUnfolder]: For 11723/11815 co-relation queries the response was YES. [2023-08-31 23:07:31,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17071 conditions, 4128 events. 2462/4128 cut-off events. For 11723/11815 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25823 event pairs, 558 based on Foata normal form. 14/4050 useless extension candidates. Maximal degree in co-relation 17044. Up to 1897 conditions per place. [2023-08-31 23:07:31,729 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 53 selfloop transitions, 1 changer transitions 65/123 dead transitions. [2023-08-31 23:07:31,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 123 transitions, 1060 flow [2023-08-31 23:07:31,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:07:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:07:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-08-31 23:07:31,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4917562724014337 [2023-08-31 23:07:31,732 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-08-31 23:07:31,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-08-31 23:07:31,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:31,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-08-31 23:07:31,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states 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:07:31,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:31,736 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states 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:07:31,736 INFO L175 Difference]: Start difference. First operand has 90 places, 57 transitions, 366 flow. Second operand 5 states and 686 transitions. [2023-08-31 23:07:31,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 123 transitions, 1060 flow [2023-08-31 23:07:31,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 123 transitions, 963 flow, removed 47 selfloop flow, removed 12 redundant places. [2023-08-31 23:07:31,795 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 275 flow [2023-08-31 23:07:31,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2023-08-31 23:07:31,796 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2023-08-31 23:07:31,796 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 275 flow [2023-08-31 23:07:31,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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:07:31,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:31,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:31,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:07:31,797 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:31,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 288915782, now seen corresponding path program 3 times [2023-08-31 23:07:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:31,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109721277] [2023-08-31 23:07:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:32,700 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:07:32,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:32,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109721277] [2023-08-31 23:07:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109721277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:32,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:07:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227538318] [2023-08-31 23:07:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:32,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:07:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:32,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:07:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:07:32,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 279 [2023-08-31 23:07:32,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 128.125) internal successors, (1025), 8 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states 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:07:32,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:32,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 279 [2023-08-31 23:07:32,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:33,047 INFO L130 PetriNetUnfolder]: 749/1281 cut-off events. [2023-08-31 23:07:33,048 INFO L131 PetriNetUnfolder]: For 2614/2669 co-relation queries the response was YES. [2023-08-31 23:07:33,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 1281 events. 749/1281 cut-off events. For 2614/2669 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5928 event pairs, 154 based on Foata normal form. 7/1252 useless extension candidates. Maximal degree in co-relation 4966. Up to 827 conditions per place. [2023-08-31 23:07:33,054 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 60 selfloop transitions, 9 changer transitions 34/108 dead transitions. [2023-08-31 23:07:33,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 108 transitions, 780 flow [2023-08-31 23:07:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:07:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:07:33,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1069 transitions. [2023-08-31 23:07:33,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789426523297491 [2023-08-31 23:07:33,057 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1069 transitions. [2023-08-31 23:07:33,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1069 transitions. [2023-08-31 23:07:33,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:33,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1069 transitions. [2023-08-31 23:07:33,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states 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:07:33,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states 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:07:33,063 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states 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:07:33,063 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 275 flow. Second operand 8 states and 1069 transitions. [2023-08-31 23:07:33,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 108 transitions, 780 flow [2023-08-31 23:07:33,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 758 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-31 23:07:33,074 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 332 flow [2023-08-31 23:07:33,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=332, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2023-08-31 23:07:33,075 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 20 predicate places. [2023-08-31 23:07:33,075 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 332 flow [2023-08-31 23:07:33,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.125) internal successors, (1025), 8 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states 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:07:33,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:33,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:33,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:07:33,076 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:33,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash -584154670, now seen corresponding path program 4 times [2023-08-31 23:07:33,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:33,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358348126] [2023-08-31 23:07:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:33,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:33,804 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:07:33,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:07:33,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358348126] [2023-08-31 23:07:33,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358348126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:33,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:33,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:07:33,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992281084] [2023-08-31 23:07:33,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:33,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:07:33,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:07:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:07:33,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:07:33,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-31 23:07:33,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 332 flow. Second operand has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states 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:07:33,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:33,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-31 23:07:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:34,238 INFO L130 PetriNetUnfolder]: 766/1329 cut-off events. [2023-08-31 23:07:34,238 INFO L131 PetriNetUnfolder]: For 3284/3345 co-relation queries the response was YES. [2023-08-31 23:07:34,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 1329 events. 766/1329 cut-off events. For 3284/3345 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6393 event pairs, 108 based on Foata normal form. 22/1315 useless extension candidates. Maximal degree in co-relation 5561. Up to 645 conditions per place. [2023-08-31 23:07:34,245 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 80 selfloop transitions, 5 changer transitions 32/122 dead transitions. [2023-08-31 23:07:34,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 934 flow [2023-08-31 23:07:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:07:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:07:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1056 transitions. [2023-08-31 23:07:34,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2023-08-31 23:07:34,249 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1056 transitions. [2023-08-31 23:07:34,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1056 transitions. [2023-08-31 23:07:34,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:34,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1056 transitions. [2023-08-31 23:07:34,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states 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:07:34,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states 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:07:34,256 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 279.0) internal successors, (2511), 9 states have internal predecessors, (2511), 0 states have call successors, (0), 0 states 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:07:34,256 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 332 flow. Second operand 8 states and 1056 transitions. [2023-08-31 23:07:34,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 934 flow [2023-08-31 23:07:34,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 122 transitions, 916 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-31 23:07:34,270 INFO L231 Difference]: Finished difference. Result has 79 places, 54 transitions, 338 flow [2023-08-31 23:07:34,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=79, PETRI_TRANSITIONS=54} [2023-08-31 23:07:34,271 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 24 predicate places. [2023-08-31 23:07:34,271 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 54 transitions, 338 flow [2023-08-31 23:07:34,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states 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:07:34,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:34,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:34,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:07:34,272 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:34,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash 814579218, now seen corresponding path program 5 times [2023-08-31 23:07:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:07:34,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147830061] [2023-08-31 23:07:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:34,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:07:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:07:34,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:07:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:07:34,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:07:34,423 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:07:34,424 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:07:34,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:07:34,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:07:34,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:07:34,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:07:34,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:07:34,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:07:34,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:07:34,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:07:34,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:07:34,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:07:34,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:07:34,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:07:34,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:07:34,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:07:34,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:07:34,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:07:34,430 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:34,435 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:07:34,435 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:07:34,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:07:34 BasicIcfg [2023-08-31 23:07:34,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:07:34,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:07:34,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:07:34,520 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:07:34,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:06:53" (3/4) ... [2023-08-31 23:07:34,523 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:07:34,523 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:07:34,523 INFO L158 Benchmark]: Toolchain (without parser) took 42652.64ms. Allocated memory was 77.6MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 44.4MB in the beginning and 3.6GB in the end (delta: -3.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-31 23:07:34,524 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory is still 29.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:07:34,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.67ms. Allocated memory is still 77.6MB. Free memory was 44.2MB in the beginning and 37.6MB in the end (delta: 6.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-08-31 23:07:34,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.58ms. Allocated memory is still 77.6MB. Free memory was 37.6MB in the beginning and 35.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:07:34,525 INFO L158 Benchmark]: Boogie Preprocessor took 26.53ms. Allocated memory is still 77.6MB. Free memory was 35.0MB in the beginning and 32.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:07:34,525 INFO L158 Benchmark]: RCFGBuilder took 747.09ms. Allocated memory is still 77.6MB. Free memory was 32.9MB in the beginning and 42.2MB in the end (delta: -9.3MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2023-08-31 23:07:34,525 INFO L158 Benchmark]: TraceAbstraction took 41332.37ms. Allocated memory was 77.6MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 41.4MB in the beginning and 3.6GB in the end (delta: -3.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-31 23:07:34,525 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 4.9GB. Free memory is still 3.6GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:07:34,527 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.16ms. Allocated memory is still 52.4MB. Free memory is still 29.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.67ms. Allocated memory is still 77.6MB. Free memory was 44.2MB in the beginning and 37.6MB in the end (delta: 6.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.58ms. Allocated memory is still 77.6MB. Free memory was 37.6MB in the beginning and 35.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.53ms. Allocated memory is still 77.6MB. Free memory was 35.0MB in the beginning and 32.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 747.09ms. Allocated memory is still 77.6MB. Free memory was 32.9MB in the beginning and 42.2MB in the end (delta: -9.3MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * TraceAbstraction took 41332.37ms. Allocated memory was 77.6MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 41.4MB in the beginning and 3.6GB in the end (delta: -3.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 4.9GB. Free memory is still 3.6GB. 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.3s, 153 PlacesBefore, 55 PlacesAfterwards, 142 TransitionsBefore, 43 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 133 TotalNumberOfCompositions, 12455 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4180, independent: 3875, independent conditional: 0, independent unconditional: 3875, dependent: 305, dependent conditional: 0, dependent unconditional: 305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1850, independent: 1798, independent conditional: 0, independent unconditional: 1798, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4180, independent: 2077, independent conditional: 0, independent unconditional: 2077, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 1850, unknown conditional: 0, unknown unconditional: 1850] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t89; [L874] FCALL, FORK 0 pthread_create(&t89, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t89, ((void *)0), P0, ((void *)0))=-1, t89={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t90; [L876] FCALL, FORK 0 pthread_create(&t90, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t90, ((void *)0), P1, ((void *)0))=0, t89={5:0}, t90={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t91; [L878] FCALL, FORK 0 pthread_create(&t91, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t91, ((void *)0), P2, ((void *)0))=1, t89={5:0}, t90={6:0}, t91={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t92; [L880] FCALL, FORK 0 pthread_create(&t92, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t92, ((void *)0), P3, ((void *)0))=2, t89={5:0}, t90={6:0}, t91={7:0}, t92={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89={5:0}, t90={6:0}, t91={7:0}, t92={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=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: -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: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 878]: 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: 876]: 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: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1282 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1108 mSDsluCounter, 653 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 577 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3646 IncrementalHoareTripleChecker+Invalid, 3765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 76 mSDtfsCounter, 3646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=682occurred in iteration=11, InterpolantAutomatonStates: 103, 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, 5.5s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 2651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:07:34,545 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/mix004.oepc.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 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 --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:07:36,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:07:36,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:07:36,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:07:36,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:07:36,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:07:36,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:07:36,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:07:36,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:07:36,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:07:36,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:07:36,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:07:36,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:07:36,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:07:36,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:07:36,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:07:36,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:07:36,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:07:36,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:07:36,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:07:36,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:07:36,797 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:07:36,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:07:36,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:07:36,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:07:36,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:07:36,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:07:36,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:07:36,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:07:36,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:07:36,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:07:36,815 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:07:36,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:07:36,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:07:36,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:07:36,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:07:36,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:07:36,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:07:36,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:07:36,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:07:36,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:07:36,822 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:07:36,855 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:07:36,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:07:36,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:07:36,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:07:36,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:07:36,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:07:36,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:07:36,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:07:36,858 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:07:36,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:07:36,859 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:07:36,859 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:07:36,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:07:36,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:07:36,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:07:36,860 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:07:36,860 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:07:36,861 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:07:36,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:07:36,861 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:07:36,861 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:07:36,861 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:07:36,862 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:07:36,862 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:07:36,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:07:36,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:07:36,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:07:36,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:07:36,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:07:36,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:07:36,863 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:07:36,863 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:07:36,864 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:07:36,864 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:07:36,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:07:36,864 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:07:36,864 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:07:36,865 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 -> 81dfcecae183e47a2274a923e55daf761c46d6146ab2c58970ae115599afe231 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:07:37,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:07:37,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:07:37,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:07:37,213 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:07:37,213 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:07:37,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2023-08-31 23:07:38,265 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:07:38,547 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:07:38,547 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2023-08-31 23:07:38,562 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443840477/4db2a65e5e5d4039948bf435ba287dcb/FLAG3c0a65cbc [2023-08-31 23:07:38,581 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443840477/4db2a65e5e5d4039948bf435ba287dcb [2023-08-31 23:07:38,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:07:38,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:07:38,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:07:38,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:07:38,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:07:38,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:07:38" (1/1) ... [2023-08-31 23:07:38,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dbeb116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:38, skipping insertion in model container [2023-08-31 23:07:38,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:07:38" (1/1) ... [2023-08-31 23:07:38,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:07:38,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:07:38,759 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/mix004.oepc.i[945,958] [2023-08-31 23:07:39,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:07:39,029 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:07:39,041 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/mix004.oepc.i[945,958] [2023-08-31 23:07:39,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:07:39,140 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:07:39,140 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:07:39,145 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:07:39,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39 WrapperNode [2023-08-31 23:07:39,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:07:39,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:07:39,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:07:39,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:07:39,153 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:07:39" (1/1) ... [2023-08-31 23:07:39,180 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:07:39" (1/1) ... [2023-08-31 23:07:39,201 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2023-08-31 23:07:39,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:07:39,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:07:39,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:07:39,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:07:39,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (1/1) ... [2023-08-31 23:07:39,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (1/1) ... [2023-08-31 23:07:39,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (1/1) ... [2023-08-31 23:07:39,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (1/1) ... [2023-08-31 23:07:39,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (1/1) ... [2023-08-31 23:07:39,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (1/1) ... [2023-08-31 23:07:39,224 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (1/1) ... [2023-08-31 23:07:39,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (1/1) ... [2023-08-31 23:07:39,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:07:39,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:07:39,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:07:39,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:07:39,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (1/1) ... [2023-08-31 23:07:39,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:07:39,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:07:39,256 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:07:39,272 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:07:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:07:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:07:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:07:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:07:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:07:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:07:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:07:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:07:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:07:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:07:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:07:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:07:39,304 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:07:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:07:39,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:07:39,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:07:39,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:07:39,306 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:07:39,436 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:07:39,437 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:07:39,886 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:07:40,021 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:07:40,021 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:07:40,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:07:40 BoogieIcfgContainer [2023-08-31 23:07:40,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:07:40,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:07:40,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:07:40,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:07:40,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:07:38" (1/3) ... [2023-08-31 23:07:40,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a8c44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:07:40, skipping insertion in model container [2023-08-31 23:07:40,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:07:39" (2/3) ... [2023-08-31 23:07:40,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a8c44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:07:40, skipping insertion in model container [2023-08-31 23:07:40,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:07:40" (3/3) ... [2023-08-31 23:07:40,032 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2023-08-31 23:07:40,048 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:07:40,049 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:07:40,049 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:07:40,125 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:07:40,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 314 flow [2023-08-31 23:07:40,237 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2023-08-31 23:07:40,237 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:07:40,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:07:40,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 147 transitions, 314 flow [2023-08-31 23:07:40,250 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 143 transitions, 298 flow [2023-08-31 23:07:40,254 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:07:40,273 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 143 transitions, 298 flow [2023-08-31 23:07:40,278 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 143 transitions, 298 flow [2023-08-31 23:07:40,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 298 flow [2023-08-31 23:07:40,326 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2023-08-31 23:07:40,326 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:07:40,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:07:40,331 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-31 23:07:47,212 INFO L134 LiptonReduction]: Checked pairs total: 11488 [2023-08-31 23:07:47,213 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-31 23:07:47,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:07:47,228 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;@7e8ec0a4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:07:47,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:07:47,231 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:07:47,231 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:07:47,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:47,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:07:47,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:47,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:47,236 INFO L85 PathProgramCache]: Analyzing trace with hash 616, now seen corresponding path program 1 times [2023-08-31 23:07:47,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:47,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95150979] [2023-08-31 23:07:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:47,246 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:07:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:47,253 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:07:47,263 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:07:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:47,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:07:47,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:47,343 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:07:47,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:47,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:47,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95150979] [2023-08-31 23:07:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95150979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:47,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:47,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:07:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031413783] [2023-08-31 23:07:47,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:47,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:07:47,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:47,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:07:47,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:07:47,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 283 [2023-08-31 23:07:47,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:07:47,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:47,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 283 [2023-08-31 23:07:47,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:48,944 INFO L130 PetriNetUnfolder]: 9959/13469 cut-off events. [2023-08-31 23:07:48,945 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-31 23:07:48,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27057 conditions, 13469 events. 9959/13469 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 72803 event pairs, 9959 based on Foata normal form. 400/11820 useless extension candidates. Maximal degree in co-relation 27045. Up to 13371 conditions per place. [2023-08-31 23:07:49,029 INFO L137 encePairwiseOnDemand]: 274/283 looper letters, 29 selfloop transitions, 0 changer transitions 0/34 dead transitions. [2023-08-31 23:07:49,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 34 transitions, 138 flow [2023-08-31 23:07:49,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:07:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:07:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 302 transitions. [2023-08-31 23:07:49,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335689045936396 [2023-08-31 23:07:49,046 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 302 transitions. [2023-08-31 23:07:49,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 302 transitions. [2023-08-31 23:07:49,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:49,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 302 transitions. [2023-08-31 23:07:49,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:07:49,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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:07:49,062 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states 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:07:49,063 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 2 states and 302 transitions. [2023-08-31 23:07:49,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 34 transitions, 138 flow [2023-08-31 23:07:49,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:07:49,074 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-08-31 23:07:49,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-31 23:07:49,080 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -11 predicate places. [2023-08-31 23:07:49,080 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-08-31 23:07:49,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:07:49,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:49,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:07:49,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-31 23:07:49,290 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:07:49,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:49,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:49,291 INFO L85 PathProgramCache]: Analyzing trace with hash 608312, now seen corresponding path program 1 times [2023-08-31 23:07:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309505970] [2023-08-31 23:07:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:49,292 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:07:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:49,294 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:07:49,297 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:07:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:49,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:07:49,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:49,383 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:07:49,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:49,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:49,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309505970] [2023-08-31 23:07:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309505970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:49,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:07:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347919380] [2023-08-31 23:07:49,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:49,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:07:49,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:07:49,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:07:49,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 283 [2023-08-31 23:07:49,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:49,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:49,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 283 [2023-08-31 23:07:49,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:50,444 INFO L130 PetriNetUnfolder]: 7831/10658 cut-off events. [2023-08-31 23:07:50,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:07:50,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21391 conditions, 10658 events. 7831/10658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 55658 event pairs, 4023 based on Foata normal form. 0/9663 useless extension candidates. Maximal degree in co-relation 21388. Up to 8431 conditions per place. [2023-08-31 23:07:50,498 INFO L137 encePairwiseOnDemand]: 280/283 looper letters, 45 selfloop transitions, 2 changer transitions 4/56 dead transitions. [2023-08-31 23:07:50,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 228 flow [2023-08-31 23:07:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:07:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:07:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-31 23:07:50,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241460541813898 [2023-08-31 23:07:50,501 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-31 23:07:50,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-31 23:07:50,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:50,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-31 23:07:50,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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:07:50,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states 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:07:50,507 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states 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:07:50,507 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 445 transitions. [2023-08-31 23:07:50,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 228 flow [2023-08-31 23:07:50,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:07:50,509 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 74 flow [2023-08-31 23:07:50,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-08-31 23:07:50,510 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -10 predicate places. [2023-08-31 23:07:50,510 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 74 flow [2023-08-31 23:07:50,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:07:50,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:50,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:50,523 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:07:50,720 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:07:50,721 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:50,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:50,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1797446911, now seen corresponding path program 1 times [2023-08-31 23:07:50,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:50,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592202669] [2023-08-31 23:07:50,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:50,722 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:07:50,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:50,723 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:07:50,726 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:07:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:50,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:07:50,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:50,883 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:07:50,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:50,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:50,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592202669] [2023-08-31 23:07:50,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592202669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:50,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:50,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:07:50,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288508365] [2023-08-31 23:07:50,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:50,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:07:50,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:50,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:07:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:07:50,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-31 23:07:50,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:07:50,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:50,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-31 23:07:50,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:51,587 INFO L130 PetriNetUnfolder]: 4483/6404 cut-off events. [2023-08-31 23:07:51,587 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-31 23:07:51,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13353 conditions, 6404 events. 4483/6404 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 35281 event pairs, 818 based on Foata normal form. 320/6479 useless extension candidates. Maximal degree in co-relation 13349. Up to 4756 conditions per place. [2023-08-31 23:07:51,620 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 40 selfloop transitions, 5 changer transitions 27/77 dead transitions. [2023-08-31 23:07:51,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 77 transitions, 322 flow [2023-08-31 23:07:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:07:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:07:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2023-08-31 23:07:51,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975265017667845 [2023-08-31 23:07:51,623 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 704 transitions. [2023-08-31 23:07:51,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 704 transitions. [2023-08-31 23:07:51,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:51,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 704 transitions. [2023-08-31 23:07:51,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states 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:07:51,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states 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:07:51,629 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states 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:07:51,629 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 74 flow. Second operand 5 states and 704 transitions. [2023-08-31 23:07:51,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 77 transitions, 322 flow [2023-08-31 23:07:51,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:07:51,632 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 115 flow [2023-08-31 23:07:51,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-31 23:07:51,634 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -7 predicate places. [2023-08-31 23:07:51,634 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 115 flow [2023-08-31 23:07:51,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:07:51,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:51,635 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:07:51,655 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:07:51,847 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:07:51,847 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:51,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:51,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1863165190, now seen corresponding path program 1 times [2023-08-31 23:07:51,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:51,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986003244] [2023-08-31 23:07:51,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:51,849 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:07:51,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:51,850 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:07:51,853 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:07:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:51,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:07:51,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:51,993 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:07:51,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:51,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986003244] [2023-08-31 23:07:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986003244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:51,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:51,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:07:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378638118] [2023-08-31 23:07:51,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:51,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:07:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:51,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:07:51,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:07:52,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-31 23:07:52,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states 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:07:52,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:52,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-31 23:07:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:52,500 INFO L130 PetriNetUnfolder]: 2161/3299 cut-off events. [2023-08-31 23:07:52,501 INFO L131 PetriNetUnfolder]: For 1179/1179 co-relation queries the response was YES. [2023-08-31 23:07:52,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8694 conditions, 3299 events. 2161/3299 cut-off events. For 1179/1179 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17705 event pairs, 403 based on Foata normal form. 212/3402 useless extension candidates. Maximal degree in co-relation 8687. Up to 1426 conditions per place. [2023-08-31 23:07:52,519 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 53 selfloop transitions, 9 changer transitions 27/94 dead transitions. [2023-08-31 23:07:52,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 471 flow [2023-08-31 23:07:52,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:07:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:07:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions. [2023-08-31 23:07:52,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988221436984688 [2023-08-31 23:07:52,523 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 847 transitions. [2023-08-31 23:07:52,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 847 transitions. [2023-08-31 23:07:52,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:52,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 847 transitions. [2023-08-31 23:07:52,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 0 states 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:07:52,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states 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:07:52,529 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states 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:07:52,530 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 115 flow. Second operand 6 states and 847 transitions. [2023-08-31 23:07:52,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 471 flow [2023-08-31 23:07:52,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 464 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:07:52,540 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 180 flow [2023-08-31 23:07:52,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-31 23:07:52,541 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -3 predicate places. [2023-08-31 23:07:52,541 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 180 flow [2023-08-31 23:07:52,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states 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:07:52,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:52,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:52,553 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 (5)] Ended with exit code 0 [2023-08-31 23:07:52,753 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:07:52,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:52,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash -637050771, now seen corresponding path program 1 times [2023-08-31 23:07:52,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:52,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561386154] [2023-08-31 23:07:52,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:52,754 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:07:52,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:52,755 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:07:52,757 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:07:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:52,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:07:52,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:52,929 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:07:52,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:52,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:52,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561386154] [2023-08-31 23:07:52,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561386154] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:52,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:52,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:07:52,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299932039] [2023-08-31 23:07:52,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:52,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:07:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:52,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:07:52,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:07:52,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-31 23:07:52,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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:07:52,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:52,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-31 23:07:52,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:53,428 INFO L130 PetriNetUnfolder]: 1189/1877 cut-off events. [2023-08-31 23:07:53,428 INFO L131 PetriNetUnfolder]: For 1804/1804 co-relation queries the response was YES. [2023-08-31 23:07:53,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5597 conditions, 1877 events. 1189/1877 cut-off events. For 1804/1804 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9408 event pairs, 331 based on Foata normal form. 77/1908 useless extension candidates. Maximal degree in co-relation 5588. Up to 630 conditions per place. [2023-08-31 23:07:53,440 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 64 selfloop transitions, 13 changer transitions 27/109 dead transitions. [2023-08-31 23:07:53,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 109 transitions, 640 flow [2023-08-31 23:07:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:07:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:07:53,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 988 transitions. [2023-08-31 23:07:53,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49873801110550225 [2023-08-31 23:07:53,444 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 988 transitions. [2023-08-31 23:07:53,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 988 transitions. [2023-08-31 23:07:53,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:53,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 988 transitions. [2023-08-31 23:07:53,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.14285714285714) internal successors, (988), 7 states have internal predecessors, (988), 0 states have call successors, (0), 0 states 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:07:53,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states 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:07:53,450 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states 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:07:53,450 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 180 flow. Second operand 7 states and 988 transitions. [2023-08-31 23:07:53,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 109 transitions, 640 flow [2023-08-31 23:07:53,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 578 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:07:53,468 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 230 flow [2023-08-31 23:07:53,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=230, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-31 23:07:53,469 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2023-08-31 23:07:53,469 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 230 flow [2023-08-31 23:07:53,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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:07:53,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:53,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:53,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:07:53,681 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:07:53,681 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:53,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:53,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1125424202, now seen corresponding path program 1 times [2023-08-31 23:07:53,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:53,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271026788] [2023-08-31 23:07:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:53,683 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:07:53,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:53,684 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:07:53,685 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:07:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:53,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:07:53,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:53,843 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:07:53,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:53,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:53,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271026788] [2023-08-31 23:07:53,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271026788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:53,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:53,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:07:53,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935519076] [2023-08-31 23:07:53,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:53,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:07:53,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:53,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:07:53,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:07:53,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-08-31 23:07:53,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states 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:07:53,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:53,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-08-31 23:07:53,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:54,366 INFO L130 PetriNetUnfolder]: 1011/1571 cut-off events. [2023-08-31 23:07:54,366 INFO L131 PetriNetUnfolder]: For 1449/1449 co-relation queries the response was YES. [2023-08-31 23:07:54,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4523 conditions, 1571 events. 1011/1571 cut-off events. For 1449/1449 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7717 event pairs, 326 based on Foata normal form. 14/1552 useless extension candidates. Maximal degree in co-relation 4513. Up to 630 conditions per place. [2023-08-31 23:07:54,375 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 60 selfloop transitions, 17 changer transitions 14/96 dead transitions. [2023-08-31 23:07:54,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 96 transitions, 576 flow [2023-08-31 23:07:54,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:07:54,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:07:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1101 transitions. [2023-08-31 23:07:54,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48630742049469966 [2023-08-31 23:07:54,379 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1101 transitions. [2023-08-31 23:07:54,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1101 transitions. [2023-08-31 23:07:54,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:54,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1101 transitions. [2023-08-31 23:07:54,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.625) internal successors, (1101), 8 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states 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:07:54,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states 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:07:54,386 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states 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:07:54,386 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 230 flow. Second operand 8 states and 1101 transitions. [2023-08-31 23:07:54,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 96 transitions, 576 flow [2023-08-31 23:07:54,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 514 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:07:54,405 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 224 flow [2023-08-31 23:07:54,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2023-08-31 23:07:54,406 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 3 predicate places. [2023-08-31 23:07:54,406 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 224 flow [2023-08-31 23:07:54,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states 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:07:54,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:54,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:54,420 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:07:54,616 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:07:54,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:54,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash 641492753, now seen corresponding path program 1 times [2023-08-31 23:07:54,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:54,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394486486] [2023-08-31 23:07:54,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:54,618 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:07:54,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:54,619 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:07:54,621 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:07:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:54,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:07:54,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:55,251 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:07:55,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:55,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:55,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394486486] [2023-08-31 23:07:55,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394486486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:55,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:55,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:07:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806368983] [2023-08-31 23:07:55,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:55,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:07:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:55,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:07:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:07:55,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-08-31 23:07:55,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 224 flow. Second operand has 9 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:07:55,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:55,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-08-31 23:07:55,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:55,831 INFO L130 PetriNetUnfolder]: 1159/1895 cut-off events. [2023-08-31 23:07:55,832 INFO L131 PetriNetUnfolder]: For 2146/2146 co-relation queries the response was YES. [2023-08-31 23:07:55,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 1895 events. 1159/1895 cut-off events. For 2146/2146 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10392 event pairs, 145 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 5424. Up to 773 conditions per place. [2023-08-31 23:07:55,844 INFO L137 encePairwiseOnDemand]: 276/283 looper letters, 100 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2023-08-31 23:07:55,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 112 transitions, 816 flow [2023-08-31 23:07:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:07:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:07:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1072 transitions. [2023-08-31 23:07:55,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734982332155477 [2023-08-31 23:07:55,848 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1072 transitions. [2023-08-31 23:07:55,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1072 transitions. [2023-08-31 23:07:55,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:55,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1072 transitions. [2023-08-31 23:07:55,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states 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:07:55,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states 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:07:55,855 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states 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:07:55,855 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 224 flow. Second operand 8 states and 1072 transitions. [2023-08-31 23:07:55,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 112 transitions, 816 flow [2023-08-31 23:07:55,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 112 transitions, 660 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-31 23:07:55,868 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 192 flow [2023-08-31 23:07:55,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-08-31 23:07:55,869 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2023-08-31 23:07:55,869 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 192 flow [2023-08-31 23:07:55,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:07:55,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:55,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:55,879 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:07:56,075 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:07:56,076 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:56,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:56,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1299831491, now seen corresponding path program 2 times [2023-08-31 23:07:56,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714522816] [2023-08-31 23:07:56,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:07:56,077 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:07:56,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:56,078 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:07:56,081 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:07:56,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:07:56,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:07:56,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:07:56,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:56,259 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:07:56,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:56,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714522816] [2023-08-31 23:07:56,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714522816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:56,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:56,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:07:56,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402361546] [2023-08-31 23:07:56,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:56,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:07:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:56,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:07:56,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:07:56,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-31 23:07:56,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:07:56,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:56,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-31 23:07:56,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:56,771 INFO L130 PetriNetUnfolder]: 2066/3227 cut-off events. [2023-08-31 23:07:56,771 INFO L131 PetriNetUnfolder]: For 2488/2488 co-relation queries the response was YES. [2023-08-31 23:07:56,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9195 conditions, 3227 events. 2066/3227 cut-off events. For 2488/2488 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17782 event pairs, 452 based on Foata normal form. 1/3213 useless extension candidates. Maximal degree in co-relation 9184. Up to 1644 conditions per place. [2023-08-31 23:07:56,786 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 94 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2023-08-31 23:07:56,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 638 flow [2023-08-31 23:07:56,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:07:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:07:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-31 23:07:56,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925795053003534 [2023-08-31 23:07:56,789 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-31 23:07:56,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-31 23:07:56,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:56,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-31 23:07:56,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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:07:56,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states 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:07:56,794 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states 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:07:56,794 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 192 flow. Second operand 5 states and 697 transitions. [2023-08-31 23:07:56,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 638 flow [2023-08-31 23:07:56,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 102 transitions, 627 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:07:56,825 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 221 flow [2023-08-31 23:07:56,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2023-08-31 23:07:56,826 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2023-08-31 23:07:56,826 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 221 flow [2023-08-31 23:07:56,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:07:56,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:56,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:56,840 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:07:57,039 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:07:57,039 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:57,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash -561550323, now seen corresponding path program 3 times [2023-08-31 23:07:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052024144] [2023-08-31 23:07:57,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:07:57,041 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:07:57,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:57,042 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:07:57,045 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:07:57,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:07:57,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:07:57,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:07:57,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:57,197 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:07:57,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:57,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:57,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052024144] [2023-08-31 23:07:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052024144] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:57,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:57,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:07:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752931541] [2023-08-31 23:07:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:57,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:07:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:57,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:07:57,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:07:57,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-31 23:07:57,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:07:57,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:57,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-31 23:07:57,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:57,696 INFO L130 PetriNetUnfolder]: 3389/5745 cut-off events. [2023-08-31 23:07:57,697 INFO L131 PetriNetUnfolder]: For 4523/4523 co-relation queries the response was YES. [2023-08-31 23:07:57,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15804 conditions, 5745 events. 3389/5745 cut-off events. For 4523/4523 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 38813 event pairs, 418 based on Foata normal form. 1/5712 useless extension candidates. Maximal degree in co-relation 15790. Up to 2588 conditions per place. [2023-08-31 23:07:57,734 INFO L137 encePairwiseOnDemand]: 279/283 looper letters, 92 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2023-08-31 23:07:57,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 675 flow [2023-08-31 23:07:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:07:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:07:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2023-08-31 23:07:57,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48975265017667846 [2023-08-31 23:07:57,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2023-08-31 23:07:57,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2023-08-31 23:07:57,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:57,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2023-08-31 23:07:57,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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:07:57,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states 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:07:57,741 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states 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:07:57,741 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 221 flow. Second operand 5 states and 693 transitions. [2023-08-31 23:07:57,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 675 flow [2023-08-31 23:07:57,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:07:57,808 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 289 flow [2023-08-31 23:07:57,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2023-08-31 23:07:57,809 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2023-08-31 23:07:57,809 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 289 flow [2023-08-31 23:07:57,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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:07:57,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:57,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:57,823 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:07:58,020 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:07:58,020 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:07:58,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:07:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1672240080, now seen corresponding path program 1 times [2023-08-31 23:07:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:07:58,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997451827] [2023-08-31 23:07:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:07:58,022 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:07:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:07:58,023 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:07:58,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:07:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:07:58,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:07:58,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:07:58,786 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:07:58,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:07:58,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:07:58,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997451827] [2023-08-31 23:07:58,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997451827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:07:58,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:07:58,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:07:58,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906864312] [2023-08-31 23:07:58,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:07:58,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:07:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:07:58,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:07:58,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:07:59,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 283 [2023-08-31 23:07:59,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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:07:59,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:07:59,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 283 [2023-08-31 23:07:59,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:07:59,774 INFO L130 PetriNetUnfolder]: 2879/4593 cut-off events. [2023-08-31 23:07:59,775 INFO L131 PetriNetUnfolder]: For 4817/4817 co-relation queries the response was YES. [2023-08-31 23:07:59,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13635 conditions, 4593 events. 2879/4593 cut-off events. For 4817/4817 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 28924 event pairs, 211 based on Foata normal form. 8/4464 useless extension candidates. Maximal degree in co-relation 13618. Up to 3881 conditions per place. [2023-08-31 23:07:59,794 INFO L137 encePairwiseOnDemand]: 278/283 looper letters, 47 selfloop transitions, 4 changer transitions 23/79 dead transitions. [2023-08-31 23:07:59,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 552 flow [2023-08-31 23:07:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:07:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:07:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 716 transitions. [2023-08-31 23:07:59,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4216725559481743 [2023-08-31 23:07:59,797 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 716 transitions. [2023-08-31 23:07:59,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 716 transitions. [2023-08-31 23:07:59,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:07:59,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 716 transitions. [2023-08-31 23:07:59,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states 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:07:59,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states 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:07:59,802 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states 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:07:59,802 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 289 flow. Second operand 6 states and 716 transitions. [2023-08-31 23:07:59,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 552 flow [2023-08-31 23:07:59,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:07:59,838 INFO L231 Difference]: Finished difference. Result has 72 places, 42 transitions, 192 flow [2023-08-31 23:07:59,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=72, PETRI_TRANSITIONS=42} [2023-08-31 23:07:59,839 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2023-08-31 23:07:59,839 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 42 transitions, 192 flow [2023-08-31 23:07:59,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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:07:59,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:07:59,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:07:59,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:08:00,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:08:00,045 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:00,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash 476232057, now seen corresponding path program 4 times [2023-08-31 23:08:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:08:00,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523915880] [2023-08-31 23:08:00,046 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:08:00,046 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:08:00,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:08:00,047 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:08:00,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:08:00,179 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:08:00,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:08:00,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:08:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:08:00,308 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:08:00,308 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:08:00,309 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:08:00,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:08:00,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:08:00,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:08:00,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:08:00,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:08:00,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:08:00,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:08:00,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:08:00,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:08:00,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:08:00,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:08:00,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:08:00,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:08:00,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:08:00,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:08:00,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:08:00,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:08:00,523 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:08:00,527 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:08:00,527 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:08:00,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:08:00 BasicIcfg [2023-08-31 23:08:00,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:08:00,625 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:08:00,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:08:00,629 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:08:00,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:07:40" (3/4) ... [2023-08-31 23:08:00,631 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:08:00,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:08:00,632 INFO L158 Benchmark]: Toolchain (without parser) took 22048.36ms. Allocated memory was 67.1MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 43.2MB in the beginning and 819.2MB in the end (delta: -776.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-31 23:08:00,632 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 52.4MB. Free memory is still 29.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:08:00,632 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.11ms. Allocated memory is still 67.1MB. Free memory was 43.0MB in the beginning and 35.1MB in the end (delta: 7.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-31 23:08:00,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.01ms. Allocated memory is still 67.1MB. Free memory was 35.1MB in the beginning and 32.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:08:00,633 INFO L158 Benchmark]: Boogie Preprocessor took 26.64ms. Allocated memory is still 67.1MB. Free memory was 32.5MB in the beginning and 30.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:08:00,633 INFO L158 Benchmark]: RCFGBuilder took 794.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 30.1MB in the beginning and 50.6MB in the end (delta: -20.4MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2023-08-31 23:08:00,634 INFO L158 Benchmark]: TraceAbstraction took 20598.10ms. Allocated memory was 81.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 49.8MB in the beginning and 819.2MB in the end (delta: -769.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-31 23:08:00,634 INFO L158 Benchmark]: Witness Printer took 6.81ms. Allocated memory is still 1.9GB. Free memory is still 819.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:08:00,635 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.09ms. Allocated memory is still 52.4MB. Free memory is still 29.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.11ms. Allocated memory is still 67.1MB. Free memory was 43.0MB in the beginning and 35.1MB in the end (delta: 7.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.01ms. Allocated memory is still 67.1MB. Free memory was 35.1MB in the beginning and 32.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.64ms. Allocated memory is still 67.1MB. Free memory was 32.5MB in the beginning and 30.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 794.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 30.1MB in the beginning and 50.6MB in the end (delta: -20.4MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20598.10ms. Allocated memory was 81.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 49.8MB in the beginning and 819.2MB in the end (delta: -769.4MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 6.81ms. Allocated memory is still 1.9GB. Free memory is still 819.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 154 PlacesBefore, 55 PlacesAfterwards, 143 TransitionsBefore, 43 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 11488 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3986, independent: 3717, independent conditional: 0, independent unconditional: 3717, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1854, independent: 1802, independent conditional: 0, independent unconditional: 1802, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3986, independent: 1915, independent conditional: 0, independent unconditional: 1915, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 1854, unknown conditional: 0, unknown unconditional: 1854] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t89; [L874] FCALL, FORK 0 pthread_create(&t89, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t89, ((void *)0), P0, ((void *)0))=-1, t89={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t90; [L876] FCALL, FORK 0 pthread_create(&t90, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t90, ((void *)0), P1, ((void *)0))=0, t89={11:0}, t90={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L877] 0 pthread_t t91; [L878] FCALL, FORK 0 pthread_create(&t91, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t91, ((void *)0), P2, ((void *)0))=1, t89={11:0}, t90={15:0}, t91={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L812] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, y=1, z=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L879] 0 pthread_t t92; [L880] FCALL, FORK 0 pthread_create(&t92, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t92, ((void *)0), P3, ((void *)0))=2, t89={11:0}, t90={15:0}, t91={7:0}, t92={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89={11:0}, t90={15:0}, t91={7:0}, t92={-2147483637:0}, weak$$choice2=0, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=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: -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: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 880]: 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: 874]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 601 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 507 mSDsluCounter, 283 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2378 IncrementalHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 25 mSDtfsCounter, 2378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=9, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 187 ConstructedInterpolants, 19 QuantifiedInterpolants, 2070 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1532 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:08:00,663 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