./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:34:25,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:34:25,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:34:25,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:34:25,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:34:25,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:34:25,751 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:34:25,751 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:34:25,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:34:25,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:34:25,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:34:25,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:34:25,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:34:25,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:34:25,753 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:34:25,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:34:25,753 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:34:25,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:34:25,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:34:25,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:34:25,757 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:34:25,761 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:34:25,761 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:34:25,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:34:25,761 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:34:25,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:34:25,762 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:34:25,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:34:25,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:34:25,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:34:25,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:34:25,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:34:25,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:34:25,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:34:25,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:34:25,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:34:25,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:34:25,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:34:25,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:34:25,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:34:25,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:34:25,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:34:25,766 INFO L153 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 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 -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b [2024-11-19 09:34:25,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:34:25,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:34:25,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:34:26,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:34:26,000 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:34:26,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2024-11-19 09:34:27,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:34:27,443 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:34:27,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2024-11-19 09:34:27,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c28447ab7/aba5657e79754f3a9cd7628acb6b7d6e/FLAGcdaf2776b [2024-11-19 09:34:27,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c28447ab7/aba5657e79754f3a9cd7628acb6b7d6e [2024-11-19 09:34:27,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:34:27,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:34:27,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:34:27,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:34:27,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:34:27,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:27,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db1db7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27, skipping insertion in model container [2024-11-19 09:34:27,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:27,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:34:27,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:34:27,833 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:34:27,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:34:27,995 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:34:27,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27 WrapperNode [2024-11-19 09:34:27,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:34:27,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:34:27,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:34:27,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:34:28,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,043 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 183 [2024-11-19 09:34:28,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:34:28,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:34:28,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:34:28,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:34:28,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,080 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 8 writes are split as follows [0, 8]. [2024-11-19 09:34:28,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,094 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:34:28,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:34:28,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:34:28,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:34:28,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (1/1) ... [2024-11-19 09:34:28,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:34:28,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:34:28,135 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:34:28,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:34:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:34:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:34:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:34:28,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:34:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:34:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:34:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:34:28,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:34:28,180 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:34:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:34:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:34:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:34:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-19 09:34:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-19 09:34:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:34:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:34:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:34:28,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:34:28,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:34:28,184 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:34:28,325 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:34:28,327 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:34:28,753 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:34:28,753 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:34:29,198 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:34:29,199 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:34:29,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:29 BoogieIcfgContainer [2024-11-19 09:34:29,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:34:29,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:34:29,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:34:29,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:34:29,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:34:27" (1/3) ... [2024-11-19 09:34:29,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dafe57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:34:29, skipping insertion in model container [2024-11-19 09:34:29,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:27" (2/3) ... [2024-11-19 09:34:29,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41dafe57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:34:29, skipping insertion in model container [2024-11-19 09:34:29,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:29" (3/3) ... [2024-11-19 09:34:29,208 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2024-11-19 09:34:29,221 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:34:29,222 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2024-11-19 09:34:29,222 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:34:29,394 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:34:29,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 97 transitions, 210 flow [2024-11-19 09:34:29,477 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2024-11-19 09:34:29,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:29,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 394 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2024-11-19 09:34:29,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 97 transitions, 210 flow [2024-11-19 09:34:29,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 93 transitions, 198 flow [2024-11-19 09:34:29,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:34:29,505 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7c8d75f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:34:29,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-19 09:34:29,512 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:34:29,512 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-19 09:34:29,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:29,512 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:29,513 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:34:29,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:29,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:29,518 INFO L85 PathProgramCache]: Analyzing trace with hash 980986844, now seen corresponding path program 1 times [2024-11-19 09:34:29,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:29,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167502334] [2024-11-19 09:34:29,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:29,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:29,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:29,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167502334] [2024-11-19 09:34:29,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167502334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:29,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:34:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200334070] [2024-11-19 09:34:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:29,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:34:29,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:29,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:34:29,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:34:29,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:34:29,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 93 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:29,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:29,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:34:29,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:38,226 INFO L124 PetriNetUnfolderBase]: 41670/60435 cut-off events. [2024-11-19 09:34:38,227 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 09:34:38,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115766 conditions, 60435 events. 41670/60435 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3712. Compared 491337 event pairs, 41670 based on Foata normal form. 1960/38305 useless extension candidates. Maximal degree in co-relation 115754. Up to 54867 conditions per place. [2024-11-19 09:34:38,700 INFO L140 encePairwiseOnDemand]: 60/97 looper letters, 38 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2024-11-19 09:34:38,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 202 flow [2024-11-19 09:34:38,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:34:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:34:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-19 09:34:38,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4742268041237113 [2024-11-19 09:34:38,714 INFO L175 Difference]: Start difference. First operand has 104 places, 93 transitions, 198 flow. Second operand 3 states and 138 transitions. [2024-11-19 09:34:38,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 202 flow [2024-11-19 09:34:38,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 56 transitions, 198 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:34:38,734 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 122 flow [2024-11-19 09:34:38,736 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-11-19 09:34:38,739 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-11-19 09:34:38,739 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 122 flow [2024-11-19 09:34:38,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:38,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:38,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:34:38,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:34:38,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash 980986845, now seen corresponding path program 1 times [2024-11-19 09:34:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203928485] [2024-11-19 09:34:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:38,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:38,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203928485] [2024-11-19 09:34:38,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203928485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:38,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:38,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:34:38,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7451897] [2024-11-19 09:34:38,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:38,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:34:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:34:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:34:38,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:34:38,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:38,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:38,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:34:38,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:40,194 INFO L124 PetriNetUnfolderBase]: 5844/9113 cut-off events. [2024-11-19 09:34:40,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:40,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17256 conditions, 9113 events. 5844/9113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 64985 event pairs, 5844 based on Foata normal form. 0/8156 useless extension candidates. Maximal degree in co-relation 17250. Up to 7981 conditions per place. [2024-11-19 09:34:40,246 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 28 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-11-19 09:34:40,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 46 transitions, 160 flow [2024-11-19 09:34:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:34:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:34:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-19 09:34:40,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35051546391752575 [2024-11-19 09:34:40,249 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 122 flow. Second operand 3 states and 102 transitions. [2024-11-19 09:34:40,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 46 transitions, 160 flow [2024-11-19 09:34:40,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 46 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:34:40,251 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 103 flow [2024-11-19 09:34:40,251 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=101, 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=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-19 09:34:40,251 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-19 09:34:40,252 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 103 flow [2024-11-19 09:34:40,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:40,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:40,252 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:34:40,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:34:40,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:40,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:40,253 INFO L85 PathProgramCache]: Analyzing trace with hash 343889124, now seen corresponding path program 1 times [2024-11-19 09:34:40,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:40,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672630859] [2024-11-19 09:34:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:40,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:40,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672630859] [2024-11-19 09:34:40,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672630859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:40,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:40,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:34:40,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903867773] [2024-11-19 09:34:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:40,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:34:40,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:34:40,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:34:40,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:34:40,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:40,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:40,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:34:40,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:41,825 INFO L124 PetriNetUnfolderBase]: 4591/7092 cut-off events. [2024-11-19 09:34:41,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:41,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13527 conditions, 7092 events. 4591/7092 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 47575 event pairs, 1360 based on Foata normal form. 0/6756 useless extension candidates. Maximal degree in co-relation 13520. Up to 5038 conditions per place. [2024-11-19 09:34:41,867 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2024-11-19 09:34:41,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 245 flow [2024-11-19 09:34:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:34:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:34:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-19 09:34:41,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38831615120274915 [2024-11-19 09:34:41,872 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 103 flow. Second operand 3 states and 113 transitions. [2024-11-19 09:34:41,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 245 flow [2024-11-19 09:34:41,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:34:41,874 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 102 flow [2024-11-19 09:34:41,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-11-19 09:34:41,875 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-19 09:34:41,875 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 102 flow [2024-11-19 09:34:41,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:41,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:41,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:41,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:34:41,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:41,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2128680646, now seen corresponding path program 1 times [2024-11-19 09:34:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:41,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708334881] [2024-11-19 09:34:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:41,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:41,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708334881] [2024-11-19 09:34:41,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708334881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:41,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:41,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:34:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855347949] [2024-11-19 09:34:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:34:41,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:41,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:34:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:34:41,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:34:41,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:41,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:41,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:34:41,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:43,215 INFO L124 PetriNetUnfolderBase]: 3961/6222 cut-off events. [2024-11-19 09:34:43,215 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2024-11-19 09:34:43,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12184 conditions, 6222 events. 3961/6222 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 41240 event pairs, 1309 based on Foata normal form. 0/5967 useless extension candidates. Maximal degree in co-relation 12176. Up to 4477 conditions per place. [2024-11-19 09:34:43,238 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 41 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-11-19 09:34:43,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 224 flow [2024-11-19 09:34:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:34:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:34:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-19 09:34:43,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3711340206185567 [2024-11-19 09:34:43,239 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 102 flow. Second operand 3 states and 108 transitions. [2024-11-19 09:34:43,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 224 flow [2024-11-19 09:34:43,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:34:43,241 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 108 flow [2024-11-19 09:34:43,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-11-19 09:34:43,242 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-19 09:34:43,242 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 108 flow [2024-11-19 09:34:43,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:43,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:43,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:43,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:34:43,243 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:43,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1257550359, now seen corresponding path program 1 times [2024-11-19 09:34:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:43,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813221646] [2024-11-19 09:34:43,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:43,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:43,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813221646] [2024-11-19 09:34:43,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813221646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:43,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:43,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:34:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255229048] [2024-11-19 09:34:43,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:43,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:34:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:43,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:34:43,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:34:43,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:34:43,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:43,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:43,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:34:43,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:44,116 INFO L124 PetriNetUnfolderBase]: 3664/5817 cut-off events. [2024-11-19 09:34:44,116 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2024-11-19 09:34:44,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11735 conditions, 5817 events. 3664/5817 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38526 event pairs, 1165 based on Foata normal form. 0/5778 useless extension candidates. Maximal degree in co-relation 11726. Up to 4071 conditions per place. [2024-11-19 09:34:44,146 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 40 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-11-19 09:34:44,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 222 flow [2024-11-19 09:34:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:34:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:34:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-11-19 09:34:44,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.327319587628866 [2024-11-19 09:34:44,148 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 108 flow. Second operand 4 states and 127 transitions. [2024-11-19 09:34:44,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 222 flow [2024-11-19 09:34:44,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:34:44,150 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 104 flow [2024-11-19 09:34:44,151 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-11-19 09:34:44,151 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-19 09:34:44,151 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 104 flow [2024-11-19 09:34:44,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:44,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:44,152 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:44,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:34:44,152 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:44,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:44,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1257550358, now seen corresponding path program 1 times [2024-11-19 09:34:44,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:44,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450141745] [2024-11-19 09:34:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:44,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:44,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450141745] [2024-11-19 09:34:44,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450141745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:44,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:44,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:34:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828477284] [2024-11-19 09:34:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:44,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:34:44,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:44,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:34:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:34:44,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:34:44,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:44,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:44,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:34:44,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:45,186 INFO L124 PetriNetUnfolderBase]: 3367/5412 cut-off events. [2024-11-19 09:34:45,187 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2024-11-19 09:34:45,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10817 conditions, 5412 events. 3367/5412 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 35645 event pairs, 1021 based on Foata normal form. 108/5481 useless extension candidates. Maximal degree in co-relation 10808. Up to 3666 conditions per place. [2024-11-19 09:34:45,212 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 39 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-11-19 09:34:45,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 216 flow [2024-11-19 09:34:45,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:34:45,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:34:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-11-19 09:34:45,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3247422680412371 [2024-11-19 09:34:45,214 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 104 flow. Second operand 4 states and 126 transitions. [2024-11-19 09:34:45,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 216 flow [2024-11-19 09:34:45,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:34:45,216 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 99 flow [2024-11-19 09:34:45,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2024-11-19 09:34:45,218 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -47 predicate places. [2024-11-19 09:34:45,218 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 99 flow [2024-11-19 09:34:45,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:45,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:45,219 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:45,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:34:45,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:45,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:45,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1699449141, now seen corresponding path program 1 times [2024-11-19 09:34:45,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:45,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463316757] [2024-11-19 09:34:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:45,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:45,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463316757] [2024-11-19 09:34:45,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463316757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:45,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:45,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:34:45,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149025408] [2024-11-19 09:34:45,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:45,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:34:45,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:45,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:34:45,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:34:45,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-19 09:34:45,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:45,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:45,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-19 09:34:45,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:45,940 INFO L124 PetriNetUnfolderBase]: 3367/5409 cut-off events. [2024-11-19 09:34:45,941 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2024-11-19 09:34:45,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10813 conditions, 5409 events. 3367/5409 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 36945 event pairs, 3367 based on Foata normal form. 144/5415 useless extension candidates. Maximal degree in co-relation 10805. Up to 4646 conditions per place. [2024-11-19 09:34:45,966 INFO L140 encePairwiseOnDemand]: 95/97 looper letters, 23 selfloop transitions, 1 changer transitions 1/41 dead transitions. [2024-11-19 09:34:45,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 41 transitions, 147 flow [2024-11-19 09:34:45,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:34:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:34:45,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-19 09:34:45,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29553264604810997 [2024-11-19 09:34:45,968 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 99 flow. Second operand 3 states and 86 transitions. [2024-11-19 09:34:45,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 41 transitions, 147 flow [2024-11-19 09:34:45,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:34:45,969 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 94 flow [2024-11-19 09:34:45,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2024-11-19 09:34:45,970 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -48 predicate places. [2024-11-19 09:34:45,970 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 94 flow [2024-11-19 09:34:45,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:45,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:45,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:45,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:34:45,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:45,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:45,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1699450990, now seen corresponding path program 1 times [2024-11-19 09:34:45,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:45,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515519860] [2024-11-19 09:34:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:45,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:46,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515519860] [2024-11-19 09:34:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515519860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:46,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:34:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964623792] [2024-11-19 09:34:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:46,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:34:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:34:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:34:46,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 97 [2024-11-19 09:34:46,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:46,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:46,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 97 [2024-11-19 09:34:46,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:48,079 INFO L124 PetriNetUnfolderBase]: 5559/8770 cut-off events. [2024-11-19 09:34:48,079 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:34:48,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17618 conditions, 8770 events. 5559/8770 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 59483 event pairs, 1255 based on Foata normal form. 0/8549 useless extension candidates. Maximal degree in co-relation 17610. Up to 4327 conditions per place. [2024-11-19 09:34:48,119 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 40 selfloop transitions, 2 changer transitions 54/110 dead transitions. [2024-11-19 09:34:48,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 444 flow [2024-11-19 09:34:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:34:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:34:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2024-11-19 09:34:48,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.32216494845360827 [2024-11-19 09:34:48,121 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 94 flow. Second operand 8 states and 250 transitions. [2024-11-19 09:34:48,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 444 flow [2024-11-19 09:34:48,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 443 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:34:48,126 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 107 flow [2024-11-19 09:34:48,126 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=107, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2024-11-19 09:34:48,127 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2024-11-19 09:34:48,127 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 107 flow [2024-11-19 09:34:48,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:48,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:48,127 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:48,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:34:48,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:48,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1865231953, now seen corresponding path program 1 times [2024-11-19 09:34:48,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:48,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494878612] [2024-11-19 09:34:48,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:48,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:48,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:48,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:48,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494878612] [2024-11-19 09:34:48,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494878612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:48,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:48,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:34:48,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048098419] [2024-11-19 09:34:48,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:48,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:34:48,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:48,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:34:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:34:48,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 97 [2024-11-19 09:34:48,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 107 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:48,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:48,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 97 [2024-11-19 09:34:48,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:50,691 INFO L124 PetriNetUnfolderBase]: 6991/10691 cut-off events. [2024-11-19 09:34:50,691 INFO L125 PetriNetUnfolderBase]: For 1210/1210 co-relation queries the response was YES. [2024-11-19 09:34:50,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23613 conditions, 10691 events. 6991/10691 cut-off events. For 1210/1210 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 71666 event pairs, 1143 based on Foata normal form. 192/10712 useless extension candidates. Maximal degree in co-relation 23599. Up to 3913 conditions per place. [2024-11-19 09:34:50,734 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 43 selfloop transitions, 3 changer transitions 47/106 dead transitions. [2024-11-19 09:34:50,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 106 transitions, 454 flow [2024-11-19 09:34:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:34:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:34:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 239 transitions. [2024-11-19 09:34:50,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3079896907216495 [2024-11-19 09:34:50,736 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 107 flow. Second operand 8 states and 239 transitions. [2024-11-19 09:34:50,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 106 transitions, 454 flow [2024-11-19 09:34:50,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 106 transitions, 432 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-19 09:34:50,785 INFO L231 Difference]: Finished difference. Result has 67 places, 39 transitions, 117 flow [2024-11-19 09:34:50,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=117, PETRI_PLACES=67, PETRI_TRANSITIONS=39} [2024-11-19 09:34:50,786 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-11-19 09:34:50,786 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 117 flow [2024-11-19 09:34:50,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:50,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:50,786 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:34:50,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:34:50,786 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash -239763760, now seen corresponding path program 1 times [2024-11-19 09:34:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:50,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379042199] [2024-11-19 09:34:50,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:51,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379042199] [2024-11-19 09:34:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379042199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:51,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:51,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:34:51,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115489659] [2024-11-19 09:34:51,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:51,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:34:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:51,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:34:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:34:51,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-19 09:34:51,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 39 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:51,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:51,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-19 09:34:51,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:51,868 INFO L124 PetriNetUnfolderBase]: 3142/5112 cut-off events. [2024-11-19 09:34:51,868 INFO L125 PetriNetUnfolderBase]: For 1708/1724 co-relation queries the response was YES. [2024-11-19 09:34:51,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11163 conditions, 5112 events. 3142/5112 cut-off events. For 1708/1724 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 33780 event pairs, 493 based on Foata normal form. 144/5208 useless extension candidates. Maximal degree in co-relation 11147. Up to 2938 conditions per place. [2024-11-19 09:34:51,890 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 34 selfloop transitions, 2 changer transitions 37/88 dead transitions. [2024-11-19 09:34:51,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 381 flow [2024-11-19 09:34:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:34:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:34:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 215 transitions. [2024-11-19 09:34:51,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3166421207658321 [2024-11-19 09:34:51,891 INFO L175 Difference]: Start difference. First operand has 67 places, 39 transitions, 117 flow. Second operand 7 states and 215 transitions. [2024-11-19 09:34:51,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 381 flow [2024-11-19 09:34:51,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 349 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-19 09:34:51,909 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 113 flow [2024-11-19 09:34:51,909 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=113, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2024-11-19 09:34:51,911 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -38 predicate places. [2024-11-19 09:34:51,911 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 113 flow [2024-11-19 09:34:51,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:51,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:51,911 INFO L204 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] [2024-11-19 09:34:51,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:34:51,912 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:51,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:51,912 INFO L85 PathProgramCache]: Analyzing trace with hash -485852255, now seen corresponding path program 1 times [2024-11-19 09:34:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:51,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577980562] [2024-11-19 09:34:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:52,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:52,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577980562] [2024-11-19 09:34:52,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577980562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:52,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:52,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:34:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985025191] [2024-11-19 09:34:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:52,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:34:52,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:52,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:34:52,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:34:52,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-19 09:34:52,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 39 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:52,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:52,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-19 09:34:52,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:54,014 INFO L124 PetriNetUnfolderBase]: 3166/5082 cut-off events. [2024-11-19 09:34:54,015 INFO L125 PetriNetUnfolderBase]: For 1271/1271 co-relation queries the response was YES. [2024-11-19 09:34:54,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11027 conditions, 5082 events. 3166/5082 cut-off events. For 1271/1271 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 32431 event pairs, 1460 based on Foata normal form. 134/5154 useless extension candidates. Maximal degree in co-relation 11012. Up to 2763 conditions per place. [2024-11-19 09:34:54,049 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 51 selfloop transitions, 9 changer transitions 49/124 dead transitions. [2024-11-19 09:34:54,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 124 transitions, 534 flow [2024-11-19 09:34:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:34:54,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:34:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 332 transitions. [2024-11-19 09:34:54,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31115276476101217 [2024-11-19 09:34:54,051 INFO L175 Difference]: Start difference. First operand has 66 places, 39 transitions, 113 flow. Second operand 11 states and 332 transitions. [2024-11-19 09:34:54,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 124 transitions, 534 flow [2024-11-19 09:34:54,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 124 transitions, 508 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-19 09:34:54,066 INFO L231 Difference]: Finished difference. Result has 75 places, 46 transitions, 191 flow [2024-11-19 09:34:54,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=191, PETRI_PLACES=75, PETRI_TRANSITIONS=46} [2024-11-19 09:34:54,069 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -29 predicate places. [2024-11-19 09:34:54,069 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 46 transitions, 191 flow [2024-11-19 09:34:54,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:54,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:54,070 INFO L204 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] [2024-11-19 09:34:54,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:34:54,070 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:54,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash 516583743, now seen corresponding path program 1 times [2024-11-19 09:34:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264431240] [2024-11-19 09:34:54,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:54,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:54,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:54,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264431240] [2024-11-19 09:34:54,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264431240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:54,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:54,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:34:54,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522693479] [2024-11-19 09:34:54,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:54,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:34:54,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:54,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:34:54,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:34:54,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-19 09:34:54,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 46 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:54,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:54,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-19 09:34:54,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:55,831 INFO L124 PetriNetUnfolderBase]: 9491/13456 cut-off events. [2024-11-19 09:34:55,832 INFO L125 PetriNetUnfolderBase]: For 17221/17516 co-relation queries the response was YES. [2024-11-19 09:34:55,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41454 conditions, 13456 events. 9491/13456 cut-off events. For 17221/17516 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 78484 event pairs, 1015 based on Foata normal form. 466/13809 useless extension candidates. Maximal degree in co-relation 41434. Up to 7909 conditions per place. [2024-11-19 09:34:55,888 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 71 selfloop transitions, 6 changer transitions 1/88 dead transitions. [2024-11-19 09:34:55,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 88 transitions, 545 flow [2024-11-19 09:34:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:34:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:34:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2024-11-19 09:34:55,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.32216494845360827 [2024-11-19 09:34:55,889 INFO L175 Difference]: Start difference. First operand has 75 places, 46 transitions, 191 flow. Second operand 4 states and 125 transitions. [2024-11-19 09:34:55,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 88 transitions, 545 flow [2024-11-19 09:34:55,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 520 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-19 09:34:55,919 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 218 flow [2024-11-19 09:34:55,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2024-11-19 09:34:55,919 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -35 predicate places. [2024-11-19 09:34:55,919 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 218 flow [2024-11-19 09:34:55,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:55,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:55,920 INFO L204 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] [2024-11-19 09:34:55,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:34:55,920 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:55,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash -976245280, now seen corresponding path program 1 times [2024-11-19 09:34:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:55,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17405477] [2024-11-19 09:34:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:56,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:56,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17405477] [2024-11-19 09:34:56,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17405477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:56,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:56,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:34:56,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124547058] [2024-11-19 09:34:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:56,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:34:56,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:34:56,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:34:56,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-19 09:34:56,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:56,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:56,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-19 09:34:56,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:57,287 INFO L124 PetriNetUnfolderBase]: 7275/10444 cut-off events. [2024-11-19 09:34:57,288 INFO L125 PetriNetUnfolderBase]: For 14378/14646 co-relation queries the response was YES. [2024-11-19 09:34:57,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33719 conditions, 10444 events. 7275/10444 cut-off events. For 14378/14646 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 58701 event pairs, 429 based on Foata normal form. 431/10783 useless extension candidates. Maximal degree in co-relation 33700. Up to 5101 conditions per place. [2024-11-19 09:34:57,340 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 90 selfloop transitions, 10 changer transitions 1/111 dead transitions. [2024-11-19 09:34:57,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 717 flow [2024-11-19 09:34:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:34:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:34:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-11-19 09:34:57,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.32577319587628867 [2024-11-19 09:34:57,342 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 218 flow. Second operand 5 states and 158 transitions. [2024-11-19 09:34:57,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 717 flow [2024-11-19 09:34:57,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 706 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:34:57,348 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 270 flow [2024-11-19 09:34:57,349 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2024-11-19 09:34:57,350 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -31 predicate places. [2024-11-19 09:34:57,350 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 270 flow [2024-11-19 09:34:57,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:57,351 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:57,351 INFO L204 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] [2024-11-19 09:34:57,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:34:57,351 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:57,351 INFO L85 PathProgramCache]: Analyzing trace with hash -107651627, now seen corresponding path program 1 times [2024-11-19 09:34:57,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:57,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248723534] [2024-11-19 09:34:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248723534] [2024-11-19 09:34:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248723534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:57,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:34:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363760830] [2024-11-19 09:34:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:57,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:34:57,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:57,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:34:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:34:57,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-19 09:34:57,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:57,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:57,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-19 09:34:57,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:58,417 INFO L124 PetriNetUnfolderBase]: 4531/6560 cut-off events. [2024-11-19 09:34:58,417 INFO L125 PetriNetUnfolderBase]: For 12159/12433 co-relation queries the response was YES. [2024-11-19 09:34:58,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22321 conditions, 6560 events. 4531/6560 cut-off events. For 12159/12433 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 33808 event pairs, 263 based on Foata normal form. 297/6771 useless extension candidates. Maximal degree in co-relation 22300. Up to 1885 conditions per place. [2024-11-19 09:34:58,449 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 97 selfloop transitions, 14 changer transitions 1/122 dead transitions. [2024-11-19 09:34:58,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 122 transitions, 842 flow [2024-11-19 09:34:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:34:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:34:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-19 09:34:58,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3247422680412371 [2024-11-19 09:34:58,450 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 270 flow. Second operand 6 states and 189 transitions. [2024-11-19 09:34:58,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 122 transitions, 842 flow [2024-11-19 09:34:58,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 122 transitions, 812 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:34:58,464 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 320 flow [2024-11-19 09:34:58,464 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2024-11-19 09:34:58,464 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -28 predicate places. [2024-11-19 09:34:58,464 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 320 flow [2024-11-19 09:34:58,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:58,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:58,465 INFO L204 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, 1, 1] [2024-11-19 09:34:58,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:34:58,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:58,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash 156717809, now seen corresponding path program 1 times [2024-11-19 09:34:58,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938243705] [2024-11-19 09:34:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:34:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:34:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:34:58,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938243705] [2024-11-19 09:34:58,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938243705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:34:58,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:34:58,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:34:58,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758432651] [2024-11-19 09:34:58,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:34:58,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:34:58,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:34:58,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:34:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:34:58,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-19 09:34:58,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 58 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:58,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:34:58,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-19 09:34:58,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:34:59,396 INFO L124 PetriNetUnfolderBase]: 2963/4236 cut-off events. [2024-11-19 09:34:59,396 INFO L125 PetriNetUnfolderBase]: For 10292/10566 co-relation queries the response was YES. [2024-11-19 09:34:59,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15406 conditions, 4236 events. 2963/4236 cut-off events. For 10292/10566 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20168 event pairs, 197 based on Foata normal form. 125/4275 useless extension candidates. Maximal degree in co-relation 15384. Up to 1308 conditions per place. [2024-11-19 09:34:59,417 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 86 selfloop transitions, 18 changer transitions 1/115 dead transitions. [2024-11-19 09:34:59,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 787 flow [2024-11-19 09:34:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:34:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:34:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2024-11-19 09:34:59,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29455081001472755 [2024-11-19 09:34:59,418 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 320 flow. Second operand 7 states and 200 transitions. [2024-11-19 09:34:59,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 787 flow [2024-11-19 09:34:59,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 115 transitions, 710 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-19 09:34:59,436 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 305 flow [2024-11-19 09:34:59,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2024-11-19 09:34:59,437 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -28 predicate places. [2024-11-19 09:34:59,437 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 305 flow [2024-11-19 09:34:59,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:34:59,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:34:59,437 INFO L204 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, 1, 1, 1, 1, 1] [2024-11-19 09:34:59,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:34:59,437 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:34:59,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:34:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash 903286245, now seen corresponding path program 1 times [2024-11-19 09:34:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:34:59,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121502874] [2024-11-19 09:34:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:34:59,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:34:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:03,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:35:03,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121502874] [2024-11-19 09:35:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121502874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:03,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:03,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:35:03,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806727070] [2024-11-19 09:35:03,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:03,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:35:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:35:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:35:03,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:35:03,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-19 09:35:03,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 305 flow. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:03,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:03,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-19 09:35:03,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:04,074 INFO L124 PetriNetUnfolderBase]: 3034/4985 cut-off events. [2024-11-19 09:35:04,074 INFO L125 PetriNetUnfolderBase]: For 7421/7651 co-relation queries the response was YES. [2024-11-19 09:35:04,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15367 conditions, 4985 events. 3034/4985 cut-off events. For 7421/7651 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 31958 event pairs, 840 based on Foata normal form. 16/4638 useless extension candidates. Maximal degree in co-relation 15347. Up to 2168 conditions per place. [2024-11-19 09:35:04,103 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 76 selfloop transitions, 17 changer transitions 14/134 dead transitions. [2024-11-19 09:35:04,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 836 flow [2024-11-19 09:35:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:35:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:35:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 322 transitions. [2024-11-19 09:35:04,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30178069353327086 [2024-11-19 09:35:04,105 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 305 flow. Second operand 11 states and 322 transitions. [2024-11-19 09:35:04,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 134 transitions, 836 flow [2024-11-19 09:35:04,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 134 transitions, 622 flow, removed 76 selfloop flow, removed 12 redundant places. [2024-11-19 09:35:04,125 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 343 flow [2024-11-19 09:35:04,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=343, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2024-11-19 09:35:04,126 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -23 predicate places. [2024-11-19 09:35:04,126 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 343 flow [2024-11-19 09:35:04,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:04,126 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:04,126 INFO L204 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, 1, 1, 1, 1, 1] [2024-11-19 09:35:04,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:35:04,126 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:04,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1875353697, now seen corresponding path program 2 times [2024-11-19 09:35:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:35:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244520496] [2024-11-19 09:35:04,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:35:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:35:04,189 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:35:04,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:35:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:04,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:35:04,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244520496] [2024-11-19 09:35:04,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244520496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:04,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:04,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:35:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943080597] [2024-11-19 09:35:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:04,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:35:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:35:04,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:35:04,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:35:04,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 97 [2024-11-19 09:35:04,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:04,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:04,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 97 [2024-11-19 09:35:04,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:05,467 INFO L124 PetriNetUnfolderBase]: 6363/10335 cut-off events. [2024-11-19 09:35:05,467 INFO L125 PetriNetUnfolderBase]: For 7890/8185 co-relation queries the response was YES. [2024-11-19 09:35:05,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26858 conditions, 10335 events. 6363/10335 cut-off events. For 7890/8185 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 74375 event pairs, 1647 based on Foata normal form. 18/9533 useless extension candidates. Maximal degree in co-relation 26838. Up to 4311 conditions per place. [2024-11-19 09:35:05,534 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 55 selfloop transitions, 1 changer transitions 46/127 dead transitions. [2024-11-19 09:35:05,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 127 transitions, 811 flow [2024-11-19 09:35:05,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:35:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:35:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-11-19 09:35:05,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28350515463917525 [2024-11-19 09:35:05,536 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 343 flow. Second operand 6 states and 165 transitions. [2024-11-19 09:35:05,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 127 transitions, 811 flow [2024-11-19 09:35:05,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 127 transitions, 771 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-11-19 09:35:05,549 INFO L231 Difference]: Finished difference. Result has 86 places, 69 transitions, 307 flow [2024-11-19 09:35:05,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=86, PETRI_TRANSITIONS=69} [2024-11-19 09:35:05,550 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -18 predicate places. [2024-11-19 09:35:05,550 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 69 transitions, 307 flow [2024-11-19 09:35:05,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:05,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:05,551 INFO L204 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, 1, 1, 1, 1, 1] [2024-11-19 09:35:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:35:05,551 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:05,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 229443421, now seen corresponding path program 3 times [2024-11-19 09:35:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:35:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059022097] [2024-11-19 09:35:05,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:35:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:35:05,631 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:35:05,631 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:35:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:08,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:35:08,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059022097] [2024-11-19 09:35:08,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059022097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:08,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:08,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:35:08,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195790438] [2024-11-19 09:35:08,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:08,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:35:08,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:35:08,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:35:08,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:35:08,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-19 09:35:08,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 69 transitions, 307 flow. Second operand has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:08,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:08,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-19 09:35:08,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:09,282 INFO L124 PetriNetUnfolderBase]: 4632/7860 cut-off events. [2024-11-19 09:35:09,283 INFO L125 PetriNetUnfolderBase]: For 5950/6332 co-relation queries the response was YES. [2024-11-19 09:35:09,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19962 conditions, 7860 events. 4632/7860 cut-off events. For 5950/6332 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 56750 event pairs, 1763 based on Foata normal form. 35/7176 useless extension candidates. Maximal degree in co-relation 19939. Up to 3179 conditions per place. [2024-11-19 09:35:09,321 INFO L140 encePairwiseOnDemand]: 88/97 looper letters, 65 selfloop transitions, 8 changer transitions 27/127 dead transitions. [2024-11-19 09:35:09,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 127 transitions, 731 flow [2024-11-19 09:35:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:35:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:35:09,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2024-11-19 09:35:09,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31572164948453607 [2024-11-19 09:35:09,322 INFO L175 Difference]: Start difference. First operand has 86 places, 69 transitions, 307 flow. Second operand 8 states and 245 transitions. [2024-11-19 09:35:09,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 127 transitions, 731 flow [2024-11-19 09:35:09,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 127 transitions, 711 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-19 09:35:09,328 INFO L231 Difference]: Finished difference. Result has 90 places, 69 transitions, 331 flow [2024-11-19 09:35:09,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=331, PETRI_PLACES=90, PETRI_TRANSITIONS=69} [2024-11-19 09:35:09,329 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -14 predicate places. [2024-11-19 09:35:09,329 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 69 transitions, 331 flow [2024-11-19 09:35:09,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.666666666666668) internal successors, (260), 12 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:09,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:09,329 INFO L204 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, 1, 1, 1, 1, 1] [2024-11-19 09:35:09,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 09:35:09,329 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash -675857709, now seen corresponding path program 4 times [2024-11-19 09:35:09,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:35:09,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389912514] [2024-11-19 09:35:09,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 09:35:09,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:35:09,417 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 09:35:09,418 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:35:09,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:35:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:35:09,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:35:09,541 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:35:09,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (93 of 94 remaining) [2024-11-19 09:35:09,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 94 remaining) [2024-11-19 09:35:09,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 94 remaining) [2024-11-19 09:35:09,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 94 remaining) [2024-11-19 09:35:09,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 94 remaining) [2024-11-19 09:35:09,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 94 remaining) [2024-11-19 09:35:09,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (80 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2024-11-19 09:35:09,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2024-11-19 09:35:09,545 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2024-11-19 09:35:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2024-11-19 09:35:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2024-11-19 09:35:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2024-11-19 09:35:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2024-11-19 09:35:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2024-11-19 09:35:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2024-11-19 09:35:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2024-11-19 09:35:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2024-11-19 09:35:09,546 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2024-11-19 09:35:09,547 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (45 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2024-11-19 09:35:09,548 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (28 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 94 remaining) [2024-11-19 09:35:09,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2024-11-19 09:35:09,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 94 remaining) [2024-11-19 09:35:09,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 94 remaining) [2024-11-19 09:35:09,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 94 remaining) [2024-11-19 09:35:09,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 94 remaining) [2024-11-19 09:35:09,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 09:35:09,552 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:35:09,657 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:35:09,657 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:35:09,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:35:09 BasicIcfg [2024-11-19 09:35:09,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:35:09,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:35:09,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:35:09,662 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:35:09,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:29" (3/4) ... [2024-11-19 09:35:09,664 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:35:09,664 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:35:09,666 INFO L158 Benchmark]: Toolchain (without parser) took 42193.18ms. Allocated memory was 184.5MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 115.5MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2024-11-19 09:35:09,666 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:35:09,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.05ms. Allocated memory is still 184.5MB. Free memory was 115.3MB in the beginning and 149.0MB in the end (delta: -33.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 09:35:09,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.39ms. Allocated memory is still 184.5MB. Free memory was 149.0MB in the beginning and 146.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:35:09,667 INFO L158 Benchmark]: Boogie Preprocessor took 57.77ms. Allocated memory is still 184.5MB. Free memory was 146.1MB in the beginning and 140.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 09:35:09,667 INFO L158 Benchmark]: RCFGBuilder took 1096.93ms. Allocated memory is still 184.5MB. Free memory was 140.7MB in the beginning and 99.1MB in the end (delta: 41.6MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2024-11-19 09:35:09,668 INFO L158 Benchmark]: TraceAbstraction took 40459.85ms. Allocated memory was 184.5MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 98.0MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-19 09:35:09,668 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 7.4GB. Free memory is still 5.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:35:09,669 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.05ms. Allocated memory is still 184.5MB. Free memory was 115.3MB in the beginning and 149.0MB in the end (delta: -33.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.39ms. Allocated memory is still 184.5MB. Free memory was 149.0MB in the beginning and 146.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.77ms. Allocated memory is still 184.5MB. Free memory was 146.1MB in the beginning and 140.7MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1096.93ms. Allocated memory is still 184.5MB. Free memory was 140.7MB in the beginning and 99.1MB in the end (delta: 41.6MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40459.85ms. Allocated memory was 184.5MB in the beginning and 7.4GB in the end (delta: 7.2GB). Free memory was 98.0MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 7.4GB. Free memory is still 5.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L741] 0 int x = 0; [L742] 0 _Bool x$flush_delayed; [L743] 0 int x$mem_tmp; [L744] 0 _Bool x$r_buff0_thd0; [L745] 0 _Bool x$r_buff0_thd1; [L746] 0 _Bool x$r_buff0_thd2; [L747] 0 _Bool x$r_buff0_thd3; [L748] 0 _Bool x$r_buff0_thd4; [L749] 0 _Bool x$r_buff1_thd0; [L750] 0 _Bool x$r_buff1_thd1; [L751] 0 _Bool x$r_buff1_thd2; [L752] 0 _Bool x$r_buff1_thd3; [L753] 0 _Bool x$r_buff1_thd4; [L754] 0 _Bool x$read_delayed; [L755] 0 int *x$read_delayed_var; [L756] 0 int x$w_buff0; [L757] 0 _Bool x$w_buff0_used; [L758] 0 int x$w_buff1; [L759] 0 _Bool x$w_buff1_used; [L761] 0 int y = 0; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L884] 0 pthread_t t2421; [L885] FCALL, FORK 0 pthread_create(&t2421, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-4, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L886] 0 pthread_t t2422; [L887] FCALL, FORK 0 pthread_create(&t2422, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-4, t2422=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L888] 0 pthread_t t2423; [L889] FCALL, FORK 0 pthread_create(&t2423, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L890] 0 pthread_t t2424; [L891] FCALL, FORK 0 pthread_create(&t2424, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-2, t2424=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L796] 2 x$w_buff1 = x$w_buff0 [L797] 2 x$w_buff0 = 1 [L798] 2 x$w_buff1_used = x$w_buff0_used [L799] 2 x$w_buff0_used = (_Bool)1 [L800] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L800] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L801] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L802] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L803] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L804] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L805] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L806] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L823] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 3 x$flush_delayed = weak$$choice2 [L826] EXPR 3 \read(x) [L826] 3 x$mem_tmp = x [L827] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L828] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L828] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L828] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L829] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L830] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L831] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L832] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L833] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L834] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L835] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L836] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L837] EXPR 3 \read(x) [L837] 3 __unbuffered_p2_EAX = x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L838] 3 x = x$flush_delayed ? x$mem_tmp : x [L839] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L842] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 4 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L768] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L771] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 1 x$flush_delayed = weak$$choice2 [L774] EXPR 1 \read(x) [L774] 1 x$mem_tmp = x [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] EXPR 1 \read(x) [L775] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L776] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L777] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L778] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L779] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L781] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 1 \read(x) [L782] 1 __unbuffered_p0_EBX = x [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] EXPR 1 \read(x) [L783] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L783] 1 x = x$flush_delayed ? x$mem_tmp : x [L784] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L809] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L813] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 \read(x) [L845] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L845] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L845] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L846] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L847] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L848] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L849] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 \read(x) [L862] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L862] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L862] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L863] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L864] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L865] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L866] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L852] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L869] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L893] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-2, t2424=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L895] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L895] RET 0 assume_abort_if_not(main$tmp_guard0) [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 \read(x) [L897] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L897] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L897] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L898] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L899] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L900] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L901] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-2, t2424=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L904] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L905] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L905] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L905] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L906] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2421=-4, t2422=-3, t2423=-2, t2424=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L908] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "safe027_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: -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: 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: -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: -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: -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: -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: 882]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 891]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 889]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 885]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 887]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 94 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: 40.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1017 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 985 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2705 IncrementalHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 8 mSDtfsCounter, 2705 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=16, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 3504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 [2024-11-19 09:35:09,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:35:12,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:35:12,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:35:12,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:35:12,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:35:12,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:35:12,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:35:12,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:35:12,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:35:12,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:35:12,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:35:12,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:35:12,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:35:12,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:35:12,395 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:35:12,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:35:12,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:35:12,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:35:12,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:35:12,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:35:12,396 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:35:12,397 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:35:12,397 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:35:12,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:35:12,397 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:35:12,397 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:35:12,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:35:12,398 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:35:12,398 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:35:12,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:35:12,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:35:12,398 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:35:12,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:35:12,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:35:12,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:35:12,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:35:12,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:35:12,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:35:12,400 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:35:12,400 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:35:12,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:35:12,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:35:12,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:35:12,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:35:12,401 INFO L153 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 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 -> 3edc5a2d9ce2881b3565fd36253c94b9cf356a0dafd043fa3f9d27823541c09b [2024-11-19 09:35:12,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:35:12,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:35:12,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:35:12,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:35:12,670 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:35:12,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2024-11-19 09:35:13,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:35:14,191 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:35:14,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe027_power.opt.i [2024-11-19 09:35:14,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995a45eba/9e2d9a3c6c5e4a19a9fdefd8dbe8964e/FLAGc0ed3a5ee [2024-11-19 09:35:14,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/995a45eba/9e2d9a3c6c5e4a19a9fdefd8dbe8964e [2024-11-19 09:35:14,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:35:14,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:35:14,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:14,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:35:14,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:35:14,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d1f8094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14, skipping insertion in model container [2024-11-19 09:35:14,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:35:14,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:14,600 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:35:14,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:14,700 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:35:14,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14 WrapperNode [2024-11-19 09:35:14,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:14,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:35:14,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:35:14,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:35:14,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,755 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 184 [2024-11-19 09:35:14,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:35:14,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:35:14,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:35:14,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:35:14,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,790 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 8 writes are split as follows [0, 8]. [2024-11-19 09:35:14,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:35:14,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:35:14,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:35:14,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:35:14,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (1/1) ... [2024-11-19 09:35:14,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:35:14,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:35:14,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:35:14,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 09:35:14,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 09:35:14,886 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 09:35:14,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 09:35:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 09:35:14,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 09:35:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-19 09:35:14,887 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-19 09:35:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:35:14,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:35:14,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:35:14,889 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:35:15,030 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:35:15,032 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:35:15,588 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:35:15,588 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:35:16,106 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:35:16,107 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:35:16,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:35:16 BoogieIcfgContainer [2024-11-19 09:35:16,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:35:16,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:35:16,125 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:35:16,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:35:16,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:35:14" (1/3) ... [2024-11-19 09:35:16,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b1fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:35:16, skipping insertion in model container [2024-11-19 09:35:16,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:14" (2/3) ... [2024-11-19 09:35:16,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b1fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:35:16, skipping insertion in model container [2024-11-19 09:35:16,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:35:16" (3/3) ... [2024-11-19 09:35:16,131 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.opt.i [2024-11-19 09:35:16,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:35:16,145 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2024-11-19 09:35:16,145 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:35:16,307 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:35:16,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 97 transitions, 210 flow [2024-11-19 09:35:16,391 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2024-11-19 09:35:16,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:35:16,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 387 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2024-11-19 09:35:16,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 97 transitions, 210 flow [2024-11-19 09:35:16,399 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 93 transitions, 198 flow [2024-11-19 09:35:16,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:35:16,410 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7830fd76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:35:16,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-19 09:35:16,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:35:16,414 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-19 09:35:16,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:35:16,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:16,415 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:35:16,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:16,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash 982716708, now seen corresponding path program 1 times [2024-11-19 09:35:16,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:16,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360307072] [2024-11-19 09:35:16,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:16,428 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 [2024-11-19 09:35:16,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:16,439 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) [2024-11-19 09:35:16,441 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 [2024-11-19 09:35:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:16,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:35:16,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:16,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:16,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360307072] [2024-11-19 09:35:16,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360307072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:16,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:16,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:35:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763857524] [2024-11-19 09:35:16,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:16,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:35:16,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:16,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:35:16,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:35:16,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:35:16,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 93 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:16,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:16,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:35:16,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:24,745 INFO L124 PetriNetUnfolderBase]: 41670/60463 cut-off events. [2024-11-19 09:35:24,745 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2024-11-19 09:35:24,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115794 conditions, 60463 events. 41670/60463 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 3713. Compared 492533 event pairs, 41670 based on Foata normal form. 1960/38341 useless extension candidates. Maximal degree in co-relation 115782. Up to 54867 conditions per place. [2024-11-19 09:35:25,176 INFO L140 encePairwiseOnDemand]: 60/97 looper letters, 38 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2024-11-19 09:35:25,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 56 transitions, 202 flow [2024-11-19 09:35:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:35:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:35:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2024-11-19 09:35:25,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4742268041237113 [2024-11-19 09:35:25,189 INFO L175 Difference]: Start difference. First operand has 104 places, 93 transitions, 198 flow. Second operand 3 states and 138 transitions. [2024-11-19 09:35:25,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 56 transitions, 202 flow [2024-11-19 09:35:25,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 56 transitions, 198 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:35:25,206 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 122 flow [2024-11-19 09:35:25,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-11-19 09:35:25,210 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-11-19 09:35:25,211 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 122 flow [2024-11-19 09:35:25,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:25,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:25,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:35:25,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:35:25,413 WARN L453 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 [2024-11-19 09:35:25,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:25,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:25,414 INFO L85 PathProgramCache]: Analyzing trace with hash 982716709, now seen corresponding path program 1 times [2024-11-19 09:35:25,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:25,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77239934] [2024-11-19 09:35:25,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:25,419 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 [2024-11-19 09:35:25,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:25,423 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) [2024-11-19 09:35:25,614 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 [2024-11-19 09:35:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:25,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:35:25,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:25,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:25,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:25,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77239934] [2024-11-19 09:35:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77239934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:25,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:25,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:35:25,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388027816] [2024-11-19 09:35:25,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:25,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:35:25,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:25,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:35:25,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:35:25,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:35:25,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:25,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:25,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:35:25,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:27,709 INFO L124 PetriNetUnfolderBase]: 5844/9125 cut-off events. [2024-11-19 09:35:27,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:35:27,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17268 conditions, 9125 events. 5844/9125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 65292 event pairs, 5844 based on Foata normal form. 0/8168 useless extension candidates. Maximal degree in co-relation 17262. Up to 7981 conditions per place. [2024-11-19 09:35:27,752 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 28 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2024-11-19 09:35:27,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 46 transitions, 160 flow [2024-11-19 09:35:27,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:35:27,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:35:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-11-19 09:35:27,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35051546391752575 [2024-11-19 09:35:27,754 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 122 flow. Second operand 3 states and 102 transitions. [2024-11-19 09:35:27,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 46 transitions, 160 flow [2024-11-19 09:35:27,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 46 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:35:27,755 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 103 flow [2024-11-19 09:35:27,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=101, 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=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-11-19 09:35:27,756 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-19 09:35:27,756 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 103 flow [2024-11-19 09:35:27,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:27,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:27,760 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:35:27,765 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 [2024-11-19 09:35:27,961 WARN L453 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 [2024-11-19 09:35:27,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:27,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:27,963 INFO L85 PathProgramCache]: Analyzing trace with hash 397516832, now seen corresponding path program 1 times [2024-11-19 09:35:27,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:27,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874940944] [2024-11-19 09:35:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:27,964 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 [2024-11-19 09:35:27,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:27,967 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) [2024-11-19 09:35:27,968 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 [2024-11-19 09:35:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:28,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:35:28,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:28,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:28,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:28,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874940944] [2024-11-19 09:35:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874940944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:28,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:28,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:35:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057435904] [2024-11-19 09:35:28,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:28,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:35:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:35:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:35:28,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:35:28,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:28,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:28,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:35:28,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:29,158 INFO L124 PetriNetUnfolderBase]: 4591/6960 cut-off events. [2024-11-19 09:35:29,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:35:29,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13395 conditions, 6960 events. 4591/6960 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 47220 event pairs, 832 based on Foata normal form. 0/6633 useless extension candidates. Maximal degree in co-relation 13388. Up to 5038 conditions per place. [2024-11-19 09:35:29,188 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2024-11-19 09:35:29,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 245 flow [2024-11-19 09:35:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:35:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:35:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-19 09:35:29,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38831615120274915 [2024-11-19 09:35:29,190 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 103 flow. Second operand 3 states and 113 transitions. [2024-11-19 09:35:29,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 245 flow [2024-11-19 09:35:29,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:35:29,191 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 102 flow [2024-11-19 09:35:29,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-11-19 09:35:29,192 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -46 predicate places. [2024-11-19 09:35:29,192 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 102 flow [2024-11-19 09:35:29,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:29,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:29,192 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:35:29,195 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 (4)] Ended with exit code 0 [2024-11-19 09:35:29,393 WARN L453 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 [2024-11-19 09:35:29,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:29,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1930958012, now seen corresponding path program 1 times [2024-11-19 09:35:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:29,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242084668] [2024-11-19 09:35:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:29,394 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 [2024-11-19 09:35:29,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:29,397 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) [2024-11-19 09:35:29,398 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 [2024-11-19 09:35:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:29,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:35:29,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:29,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:29,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:29,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242084668] [2024-11-19 09:35:29,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242084668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:29,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:29,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:35:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732466346] [2024-11-19 09:35:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:29,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:35:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:35:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:35:29,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-19 09:35:29,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:29,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:29,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-19 09:35:29,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:32,544 INFO L124 PetriNetUnfolderBase]: 13359/19589 cut-off events. [2024-11-19 09:35:32,544 INFO L125 PetriNetUnfolderBase]: For 900/900 co-relation queries the response was YES. [2024-11-19 09:35:32,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38829 conditions, 19589 events. 13359/19589 cut-off events. For 900/900 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 132889 event pairs, 1061 based on Foata normal form. 400/19184 useless extension candidates. Maximal degree in co-relation 38821. Up to 13141 conditions per place. [2024-11-19 09:35:32,666 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 57 selfloop transitions, 6 changer transitions 1/76 dead transitions. [2024-11-19 09:35:32,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 304 flow [2024-11-19 09:35:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:35:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:35:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-11-19 09:35:32,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33505154639175255 [2024-11-19 09:35:32,668 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 102 flow. Second operand 4 states and 130 transitions. [2024-11-19 09:35:32,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 304 flow [2024-11-19 09:35:32,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:35:32,673 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 140 flow [2024-11-19 09:35:32,673 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-11-19 09:35:32,674 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -44 predicate places. [2024-11-19 09:35:32,674 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 140 flow [2024-11-19 09:35:32,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:32,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:32,675 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:35:32,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:35:32,877 WARN L453 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 [2024-11-19 09:35:32,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1966355607, now seen corresponding path program 1 times [2024-11-19 09:35:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:32,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536841309] [2024-11-19 09:35:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:32,879 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 [2024-11-19 09:35:32,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:32,881 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) [2024-11-19 09:35:32,882 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 [2024-11-19 09:35:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:33,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:35:33,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:33,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:33,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:33,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536841309] [2024-11-19 09:35:33,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536841309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:33,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:33,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:35:33,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684885710] [2024-11-19 09:35:33,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:33,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:35:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:33,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:35:33,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:35:33,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-19 09:35:33,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:33,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:33,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-19 09:35:33,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:34,989 INFO L124 PetriNetUnfolderBase]: 9555/14189 cut-off events. [2024-11-19 09:35:34,989 INFO L125 PetriNetUnfolderBase]: For 3026/3026 co-relation queries the response was YES. [2024-11-19 09:35:35,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31539 conditions, 14189 events. 9555/14189 cut-off events. For 3026/3026 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 92531 event pairs, 475 based on Foata normal form. 364/14008 useless extension candidates. Maximal degree in co-relation 31529. Up to 8281 conditions per place. [2024-11-19 09:35:35,045 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 72 selfloop transitions, 10 changer transitions 1/95 dead transitions. [2024-11-19 09:35:35,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 429 flow [2024-11-19 09:35:35,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:35:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:35:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-11-19 09:35:35,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3402061855670103 [2024-11-19 09:35:35,047 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 140 flow. Second operand 5 states and 165 transitions. [2024-11-19 09:35:35,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 429 flow [2024-11-19 09:35:35,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:35:35,050 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 192 flow [2024-11-19 09:35:35,051 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-11-19 09:35:35,051 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -40 predicate places. [2024-11-19 09:35:35,051 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 192 flow [2024-11-19 09:35:35,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:35,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:35,052 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:35:35,064 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 [2024-11-19 09:35:35,252 WARN L453 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 [2024-11-19 09:35:35,252 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:35,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1686963539, now seen corresponding path program 1 times [2024-11-19 09:35:35,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:35,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510011004] [2024-11-19 09:35:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:35,254 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 [2024-11-19 09:35:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:35,256 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) [2024-11-19 09:35:35,257 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 [2024-11-19 09:35:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:35,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:35:35,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:35,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:35,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510011004] [2024-11-19 09:35:35,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510011004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:35,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:35:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255497968] [2024-11-19 09:35:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:35,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:35:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:35,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:35:35,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:35:35,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-19 09:35:35,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:35,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:35,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-19 09:35:35,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:36,354 INFO L124 PetriNetUnfolderBase]: 5287/7877 cut-off events. [2024-11-19 09:35:36,354 INFO L125 PetriNetUnfolderBase]: For 5050/5050 co-relation queries the response was YES. [2024-11-19 09:35:36,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19519 conditions, 7877 events. 5287/7877 cut-off events. For 5050/5050 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 45281 event pairs, 313 based on Foata normal form. 244/7872 useless extension candidates. Maximal degree in co-relation 19507. Up to 2953 conditions per place. [2024-11-19 09:35:36,380 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 85 selfloop transitions, 14 changer transitions 1/112 dead transitions. [2024-11-19 09:35:36,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 560 flow [2024-11-19 09:35:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:35:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:35:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-11-19 09:35:36,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3402061855670103 [2024-11-19 09:35:36,381 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 192 flow. Second operand 6 states and 198 transitions. [2024-11-19 09:35:36,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 560 flow [2024-11-19 09:35:36,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 530 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 09:35:36,401 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 242 flow [2024-11-19 09:35:36,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2024-11-19 09:35:36,402 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-11-19 09:35:36,402 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 242 flow [2024-11-19 09:35:36,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:36,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:36,403 INFO L204 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] [2024-11-19 09:35:36,407 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 [2024-11-19 09:35:36,603 WARN L453 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 [2024-11-19 09:35:36,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:36,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash -611653204, now seen corresponding path program 1 times [2024-11-19 09:35:36,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112185654] [2024-11-19 09:35:36,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:36,605 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 [2024-11-19 09:35:36,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:36,606 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) [2024-11-19 09:35:36,606 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 [2024-11-19 09:35:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:36,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:35:36,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:36,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:36,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112185654] [2024-11-19 09:35:36,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112185654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:36,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:36,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 09:35:36,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314563483] [2024-11-19 09:35:36,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:36,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 09:35:36,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:36,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 09:35:36,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:35:36,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 97 [2024-11-19 09:35:36,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:36,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:36,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 97 [2024-11-19 09:35:36,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:37,545 INFO L124 PetriNetUnfolderBase]: 3123/4525 cut-off events. [2024-11-19 09:35:37,545 INFO L125 PetriNetUnfolderBase]: For 4902/4902 co-relation queries the response was YES. [2024-11-19 09:35:37,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12424 conditions, 4525 events. 3123/4525 cut-off events. For 4902/4902 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22891 event pairs, 255 based on Foata normal form. 96/4532 useless extension candidates. Maximal degree in co-relation 12411. Up to 1348 conditions per place. [2024-11-19 09:35:37,562 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 76 selfloop transitions, 18 changer transitions 1/107 dead transitions. [2024-11-19 09:35:37,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 107 transitions, 550 flow [2024-11-19 09:35:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:35:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:35:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-11-19 09:35:37,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3078055964653903 [2024-11-19 09:35:37,564 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 242 flow. Second operand 7 states and 209 transitions. [2024-11-19 09:35:37,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 107 transitions, 550 flow [2024-11-19 09:35:37,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 107 transitions, 504 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-19 09:35:37,582 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 252 flow [2024-11-19 09:35:37,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2024-11-19 09:35:37,583 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -34 predicate places. [2024-11-19 09:35:37,583 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 252 flow [2024-11-19 09:35:37,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:37,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:37,583 INFO L204 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, 1] [2024-11-19 09:35:37,588 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 (8)] Ended with exit code 0 [2024-11-19 09:35:37,784 WARN L453 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 [2024-11-19 09:35:37,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:37,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -395523371, now seen corresponding path program 1 times [2024-11-19 09:35:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647763345] [2024-11-19 09:35:37,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:37,786 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 [2024-11-19 09:35:37,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:37,787 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) [2024-11-19 09:35:37,787 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 [2024-11-19 09:35:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:37,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:35:37,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:38,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:38,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:38,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647763345] [2024-11-19 09:35:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647763345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:35:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238585627] [2024-11-19 09:35:38,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:38,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:35:38,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:38,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:35:38,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:35:38,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:35:38,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:38,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:38,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:35:38,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:38,369 INFO L124 PetriNetUnfolderBase]: 1598/2736 cut-off events. [2024-11-19 09:35:38,369 INFO L125 PetriNetUnfolderBase]: For 1428/1507 co-relation queries the response was YES. [2024-11-19 09:35:38,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6526 conditions, 2736 events. 1598/2736 cut-off events. For 1428/1507 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15776 event pairs, 471 based on Foata normal form. 0/2613 useless extension candidates. Maximal degree in co-relation 6512. Up to 1772 conditions per place. [2024-11-19 09:35:38,382 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 34 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-11-19 09:35:38,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 344 flow [2024-11-19 09:35:38,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:35:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:35:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-11-19 09:35:38,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3118556701030928 [2024-11-19 09:35:38,384 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 252 flow. Second operand 4 states and 121 transitions. [2024-11-19 09:35:38,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 344 flow [2024-11-19 09:35:38,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 248 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-11-19 09:35:38,392 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 158 flow [2024-11-19 09:35:38,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2024-11-19 09:35:38,394 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -42 predicate places. [2024-11-19 09:35:38,394 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 158 flow [2024-11-19 09:35:38,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:38,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:38,394 INFO L204 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, 1] [2024-11-19 09:35:38,400 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 [2024-11-19 09:35:38,594 WARN L453 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 [2024-11-19 09:35:38,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:38,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash 643704158, now seen corresponding path program 1 times [2024-11-19 09:35:38,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:38,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943612371] [2024-11-19 09:35:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:38,596 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 [2024-11-19 09:35:38,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:38,599 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) [2024-11-19 09:35:38,599 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 [2024-11-19 09:35:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:38,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:35:38,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:38,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:38,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943612371] [2024-11-19 09:35:38,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943612371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:38,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:38,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:35:38,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26515778] [2024-11-19 09:35:38,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:38,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:35:38,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:38,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:35:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:35:38,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 97 [2024-11-19 09:35:38,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:38,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:38,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 97 [2024-11-19 09:35:38,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:39,175 INFO L124 PetriNetUnfolderBase]: 1534/2642 cut-off events. [2024-11-19 09:35:39,175 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-11-19 09:35:39,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5333 conditions, 2642 events. 1534/2642 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 15827 event pairs, 273 based on Foata normal form. 0/2490 useless extension candidates. Maximal degree in co-relation 5324. Up to 1680 conditions per place. [2024-11-19 09:35:39,185 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-19 09:35:39,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 248 flow [2024-11-19 09:35:39,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:35:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:35:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-11-19 09:35:39,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30927835051546393 [2024-11-19 09:35:39,186 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 158 flow. Second operand 4 states and 120 transitions. [2024-11-19 09:35:39,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 248 flow [2024-11-19 09:35:39,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:35:39,188 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 157 flow [2024-11-19 09:35:39,188 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2024-11-19 09:35:39,188 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -42 predicate places. [2024-11-19 09:35:39,188 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 157 flow [2024-11-19 09:35:39,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:39,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:39,189 INFO L204 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, 1, 1, 1, 1, 1] [2024-11-19 09:35:39,194 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 [2024-11-19 09:35:39,392 WARN L453 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 [2024-11-19 09:35:39,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:39,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:39,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1583180314, now seen corresponding path program 1 times [2024-11-19 09:35:39,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:39,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981967799] [2024-11-19 09:35:39,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:39,394 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 [2024-11-19 09:35:39,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:39,395 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) [2024-11-19 09:35:39,396 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 [2024-11-19 09:35:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:39,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:35:39,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:39,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:39,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:39,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981967799] [2024-11-19 09:35:39,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981967799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:39,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:39,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:35:39,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453964525] [2024-11-19 09:35:39,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:39,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:35:39,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:39,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:35:39,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:35:39,576 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 97 [2024-11-19 09:35:39,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:39,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:39,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 97 [2024-11-19 09:35:39,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:39,836 INFO L124 PetriNetUnfolderBase]: 1499/2513 cut-off events. [2024-11-19 09:35:39,837 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2024-11-19 09:35:39,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5233 conditions, 2513 events. 1499/2513 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14998 event pairs, 1405 based on Foata normal form. 16/2259 useless extension candidates. Maximal degree in co-relation 5224. Up to 2088 conditions per place. [2024-11-19 09:35:39,847 INFO L140 encePairwiseOnDemand]: 95/97 looper letters, 23 selfloop transitions, 1 changer transitions 1/53 dead transitions. [2024-11-19 09:35:39,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 205 flow [2024-11-19 09:35:39,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:35:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:35:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2024-11-19 09:35:39,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29553264604810997 [2024-11-19 09:35:39,848 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 157 flow. Second operand 3 states and 86 transitions. [2024-11-19 09:35:39,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 205 flow [2024-11-19 09:35:39,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:35:39,849 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 152 flow [2024-11-19 09:35:39,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-11-19 09:35:39,850 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -43 predicate places. [2024-11-19 09:35:39,850 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 152 flow [2024-11-19 09:35:39,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:39,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:39,850 INFO L204 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, 1, 1, 1, 1, 1] [2024-11-19 09:35:39,859 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 [2024-11-19 09:35:40,050 WARN L453 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 [2024-11-19 09:35:40,051 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:40,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1591742267, now seen corresponding path program 1 times [2024-11-19 09:35:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:40,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963818720] [2024-11-19 09:35:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:40,052 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 [2024-11-19 09:35:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:40,053 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) [2024-11-19 09:35:40,053 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 [2024-11-19 09:35:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:40,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:35:40,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:40,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:40,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:40,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963818720] [2024-11-19 09:35:40,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963818720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:40,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:35:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916278554] [2024-11-19 09:35:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:40,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:35:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:40,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:35:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:35:40,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 97 [2024-11-19 09:35:40,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:40,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:40,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 97 [2024-11-19 09:35:40,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:35:40,922 INFO L124 PetriNetUnfolderBase]: 3635/5850 cut-off events. [2024-11-19 09:35:40,922 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:35:40,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12175 conditions, 5850 events. 3635/5850 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 37285 event pairs, 943 based on Foata normal form. 16/5528 useless extension candidates. Maximal degree in co-relation 12166. Up to 1903 conditions per place. [2024-11-19 09:35:40,943 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 40 selfloop transitions, 3 changer transitions 16/85 dead transitions. [2024-11-19 09:35:40,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 340 flow [2024-11-19 09:35:40,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:35:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:35:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 174 transitions. [2024-11-19 09:35:40,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29896907216494845 [2024-11-19 09:35:40,944 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 152 flow. Second operand 6 states and 174 transitions. [2024-11-19 09:35:40,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 340 flow [2024-11-19 09:35:40,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 339 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:35:40,946 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 169 flow [2024-11-19 09:35:40,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2024-11-19 09:35:40,946 INFO L277 CegarLoopForPetriNet]: 104 programPoint places, -37 predicate places. [2024-11-19 09:35:40,947 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 169 flow [2024-11-19 09:35:40,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:40,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:40,947 INFO L204 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, 1, 1, 1, 1, 1] [2024-11-19 09:35:40,953 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 (12)] Ended with exit code 0 [2024-11-19 09:35:41,147 WARN L453 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 [2024-11-19 09:35:41,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 09:35:41,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:41,148 INFO L85 PathProgramCache]: Analyzing trace with hash -102396771, now seen corresponding path program 2 times [2024-11-19 09:35:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:41,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492530941] [2024-11-19 09:35:41,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:35:41,149 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 [2024-11-19 09:35:41,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:41,150 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2024-11-19 09:35:41,150 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 (13)] Waiting until timeout for monitored process [2024-11-19 09:35:41,292 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:35:41,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:35:41,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-19 09:35:41,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:42,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 09:35:42,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 90 [2024-11-19 09:35:42,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 83 [2024-11-19 09:35:43,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19