./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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/mix033_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:54:21,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:54:21,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:54:21,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:54:21,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:54:21,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:54:21,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:54:21,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:54:21,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:54:21,756 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:54:21,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:54:21,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:54:21,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:54:21,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:54:21,757 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:54:21,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:54:21,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:54:21,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:54:21,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:54:21,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:54:21,759 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:54:21,759 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:54:21,759 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:54:21,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:54:21,760 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:54:21,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:54:21,760 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:54:21,760 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:54:21,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:54:21,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:54:21,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:54:21,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:54:21,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:54:21,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:54:21,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:54:21,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:54:21,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:54:21,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:54:21,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:54:21,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:54:21,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:54:21,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:54:21,764 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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2024-11-10 17:54:21,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:54:21,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:54:21,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:54:21,992 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:54:21,992 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:54:21,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2024-11-10 17:54:23,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:54:23,389 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:54:23,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2024-11-10 17:54:23,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ce5888c/5f0045d7b29a4ea2bbd731d86b043ba4/FLAG15af8b779 [2024-11-10 17:54:23,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ce5888c/5f0045d7b29a4ea2bbd731d86b043ba4 [2024-11-10 17:54:23,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:54:23,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:54:23,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:54:23,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:54:23,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:54:23,424 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,425 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489eb9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23, skipping insertion in model container [2024-11-10 17:54:23,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,459 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:54:23,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:54:23,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:54:23,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:54:23,875 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:54:23,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23 WrapperNode [2024-11-10 17:54:23,876 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:54:23,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:54:23,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:54:23,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:54:23,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,916 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2024-11-10 17:54:23,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:54:23,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:54:23,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:54:23,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:54:23,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,952 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 17:54:23,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,958 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:54:23,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:54:23,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:54:23,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:54:23,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (1/1) ... [2024-11-10 17:54:23,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:54:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:54:23,996 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-10 17:54:23,998 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-10 17:54:24,030 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:54:24,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:54:24,030 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:54:24,031 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:54:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:54:24,031 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:54:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:54:24,031 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:54:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:54:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:54:24,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:54:24,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:54:24,033 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:54:24,167 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:54:24,169 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:54:24,404 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:54:24,404 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:54:24,543 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:54:24,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:54:24,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:54:24 BoogieIcfgContainer [2024-11-10 17:54:24,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:54:24,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:54:24,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:54:24,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:54:24,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:54:23" (1/3) ... [2024-11-10 17:54:24,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4863198d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:54:24, skipping insertion in model container [2024-11-10 17:54:24,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:23" (2/3) ... [2024-11-10 17:54:24,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4863198d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:54:24, skipping insertion in model container [2024-11-10 17:54:24,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:54:24" (3/3) ... [2024-11-10 17:54:24,551 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2024-11-10 17:54:24,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:54:24,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:54:24,564 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:54:24,601 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:54:24,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2024-11-10 17:54:24,647 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2024-11-10 17:54:24,647 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:54:24,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-11-10 17:54:24,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2024-11-10 17:54:24,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2024-11-10 17:54:24,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:54:24,665 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;@206193f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:54:24,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 17:54:24,671 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:54:24,672 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-11-10 17:54:24,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:54:24,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:24,673 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:54:24,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:24,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1061988621, now seen corresponding path program 1 times [2024-11-10 17:54:24,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:24,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977073775] [2024-11-10 17:54:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:25,085 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-10 17:54:25,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:25,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977073775] [2024-11-10 17:54:25,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977073775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:25,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:25,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:54:25,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952240977] [2024-11-10 17:54:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:25,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:54:25,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:54:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:54:25,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:25,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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-10 17:54:25,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:25,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:25,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:26,370 INFO L124 PetriNetUnfolderBase]: 9711/13823 cut-off events. [2024-11-10 17:54:26,370 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-10 17:54:26,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27598 conditions, 13823 events. 9711/13823 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 79966 event pairs, 793 based on Foata normal form. 762/14577 useless extension candidates. Maximal degree in co-relation 27587. Up to 12363 conditions per place. [2024-11-10 17:54:26,436 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 53 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2024-11-10 17:54:26,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 254 flow [2024-11-10 17:54:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:54:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:54:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-10 17:54:26,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-10 17:54:26,446 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 92 transitions. [2024-11-10 17:54:26,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 254 flow [2024-11-10 17:54:26,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 17:54:26,452 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2024-11-10 17:54:26,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-10 17:54:26,457 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-11-10 17:54:26,458 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2024-11-10 17:54:26,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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-10 17:54:26,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:26,458 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:54:26,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:54:26,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:26,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:26,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1484670924, now seen corresponding path program 1 times [2024-11-10 17:54:26,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:26,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533432322] [2024-11-10 17:54:26,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:26,578 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-10 17:54:26,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:26,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533432322] [2024-11-10 17:54:26,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533432322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:26,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:54:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767883015] [2024-11-10 17:54:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:26,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:54:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:26,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:54:26,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:54:26,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 17:54:26,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-10 17:54:26,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:26,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 17:54:26,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:27,552 INFO L124 PetriNetUnfolderBase]: 8719/13255 cut-off events. [2024-11-10 17:54:27,552 INFO L125 PetriNetUnfolderBase]: For 444/444 co-relation queries the response was YES. [2024-11-10 17:54:27,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26097 conditions, 13255 events. 8719/13255 cut-off events. For 444/444 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 81195 event pairs, 8719 based on Foata normal form. 384/13584 useless extension candidates. Maximal degree in co-relation 26087. Up to 12284 conditions per place. [2024-11-10 17:54:27,625 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 31 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-11-10 17:54:27,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 154 flow [2024-11-10 17:54:27,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:54:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:54:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-11-10 17:54:27,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-11-10 17:54:27,627 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 3 states and 61 transitions. [2024-11-10 17:54:27,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 154 flow [2024-11-10 17:54:27,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:54:27,629 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 84 flow [2024-11-10 17:54:27,629 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2024-11-10 17:54:27,631 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-11-10 17:54:27,631 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 84 flow [2024-11-10 17:54:27,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-10 17:54:27,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:27,631 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:54:27,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:54:27,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:27,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:27,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1484671152, now seen corresponding path program 1 times [2024-11-10 17:54:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:27,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092145489] [2024-11-10 17:54:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:27,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:27,896 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-10 17:54:27,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:27,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092145489] [2024-11-10 17:54:27,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092145489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:27,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:27,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:54:27,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988016711] [2024-11-10 17:54:27,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:27,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:54:27,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:27,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:54:27,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:54:27,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 17:54:27,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-10 17:54:27,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:27,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 17:54:27,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:28,997 INFO L124 PetriNetUnfolderBase]: 9895/14527 cut-off events. [2024-11-10 17:54:28,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:54:29,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28677 conditions, 14527 events. 9895/14527 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 84240 event pairs, 2317 based on Foata normal form. 0/14280 useless extension candidates. Maximal degree in co-relation 28671. Up to 6737 conditions per place. [2024-11-10 17:54:29,037 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 46 selfloop transitions, 2 changer transitions 84/137 dead transitions. [2024-11-10 17:54:29,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 137 transitions, 546 flow [2024-11-10 17:54:29,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:54:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 17:54:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions. [2024-11-10 17:54:29,039 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5364583333333334 [2024-11-10 17:54:29,039 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 84 flow. Second operand 8 states and 206 transitions. [2024-11-10 17:54:29,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 137 transitions, 546 flow [2024-11-10 17:54:29,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 137 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 17:54:29,043 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 97 flow [2024-11-10 17:54:29,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2024-11-10 17:54:29,044 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2024-11-10 17:54:29,044 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 97 flow [2024-11-10 17:54:29,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-10 17:54:29,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:29,045 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-10 17:54:29,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:54:29,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:29,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash 205959104, now seen corresponding path program 1 times [2024-11-10 17:54:29,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:29,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260428274] [2024-11-10 17:54:29,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:29,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:29,368 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-10 17:54:29,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260428274] [2024-11-10 17:54:29,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260428274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:29,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:54:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942902995] [2024-11-10 17:54:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:29,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:54:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:29,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:54:29,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:54:29,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 17:54:29,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-10 17:54:29,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:29,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 17:54:29,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:30,412 INFO L124 PetriNetUnfolderBase]: 6900/10170 cut-off events. [2024-11-10 17:54:30,412 INFO L125 PetriNetUnfolderBase]: For 1788/1788 co-relation queries the response was YES. [2024-11-10 17:54:30,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21949 conditions, 10170 events. 6900/10170 cut-off events. For 1788/1788 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 56487 event pairs, 1991 based on Foata normal form. 240/10403 useless extension candidates. Maximal degree in co-relation 21937. Up to 5926 conditions per place. [2024-11-10 17:54:30,456 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 48 selfloop transitions, 2 changer transitions 53/108 dead transitions. [2024-11-10 17:54:30,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 108 transitions, 460 flow [2024-11-10 17:54:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 17:54:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 17:54:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-11-10 17:54:30,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-10 17:54:30,459 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 97 flow. Second operand 7 states and 168 transitions. [2024-11-10 17:54:30,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 108 transitions, 460 flow [2024-11-10 17:54:30,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 108 transitions, 438 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-10 17:54:30,540 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 101 flow [2024-11-10 17:54:30,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2024-11-10 17:54:30,541 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2024-11-10 17:54:30,542 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 101 flow [2024-11-10 17:54:30,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 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-10 17:54:30,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:30,543 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-10 17:54:30,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:54:30,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:30,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:30,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1485943601, now seen corresponding path program 1 times [2024-11-10 17:54:30,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:30,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612245478] [2024-11-10 17:54:30,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:30,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:31,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-10 17:54:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612245478] [2024-11-10 17:54:31,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612245478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:31,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:31,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:54:31,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508422069] [2024-11-10 17:54:31,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:31,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:54:31,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:31,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:54:31,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:54:31,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 17:54:31,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 101 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 17:54:31,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:31,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 17:54:31,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:32,087 INFO L124 PetriNetUnfolderBase]: 6861/10114 cut-off events. [2024-11-10 17:54:32,088 INFO L125 PetriNetUnfolderBase]: For 1533/1533 co-relation queries the response was YES. [2024-11-10 17:54:32,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22122 conditions, 10114 events. 6861/10114 cut-off events. For 1533/1533 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 55165 event pairs, 1996 based on Foata normal form. 150/10264 useless extension candidates. Maximal degree in co-relation 22109. Up to 7615 conditions per place. [2024-11-10 17:54:32,131 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 76 selfloop transitions, 12 changer transitions 53/146 dead transitions. [2024-11-10 17:54:32,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 146 transitions, 640 flow [2024-11-10 17:54:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 17:54:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 17:54:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 243 transitions. [2024-11-10 17:54:32,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4602272727272727 [2024-11-10 17:54:32,133 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 101 flow. Second operand 11 states and 243 transitions. [2024-11-10 17:54:32,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 146 transitions, 640 flow [2024-11-10 17:54:32,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 146 transitions, 612 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-11-10 17:54:32,176 INFO L231 Difference]: Finished difference. Result has 66 places, 48 transitions, 190 flow [2024-11-10 17:54:32,177 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=190, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2024-11-10 17:54:32,177 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2024-11-10 17:54:32,177 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 48 transitions, 190 flow [2024-11-10 17:54:32,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 17:54:32,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:32,178 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-10 17:54:32,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:54:32,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:32,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1760283971, now seen corresponding path program 2 times [2024-11-10 17:54:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219008077] [2024-11-10 17:54:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:32,667 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-10 17:54:32,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:32,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219008077] [2024-11-10 17:54:32,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219008077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:32,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:32,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:54:32,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32169324] [2024-11-10 17:54:32,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:32,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:54:32,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:32,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:54:32,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:54:32,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 17:54:32,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 48 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 17:54:32,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:32,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 17:54:32,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:33,622 INFO L124 PetriNetUnfolderBase]: 7145/10502 cut-off events. [2024-11-10 17:54:33,622 INFO L125 PetriNetUnfolderBase]: For 11102/11104 co-relation queries the response was YES. [2024-11-10 17:54:33,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28819 conditions, 10502 events. 7145/10502 cut-off events. For 11102/11104 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 57066 event pairs, 2380 based on Foata normal form. 164/10666 useless extension candidates. Maximal degree in co-relation 28801. Up to 7939 conditions per place. [2024-11-10 17:54:33,668 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 69 selfloop transitions, 12 changer transitions 45/131 dead transitions. [2024-11-10 17:54:33,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 131 transitions, 729 flow [2024-11-10 17:54:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:54:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 17:54:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-11-10 17:54:33,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-11-10 17:54:33,670 INFO L175 Difference]: Start difference. First operand has 66 places, 48 transitions, 190 flow. Second operand 8 states and 188 transitions. [2024-11-10 17:54:33,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 131 transitions, 729 flow [2024-11-10 17:54:33,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 131 transitions, 721 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-10 17:54:33,702 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 290 flow [2024-11-10 17:54:33,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=290, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2024-11-10 17:54:33,702 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 18 predicate places. [2024-11-10 17:54:33,702 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 290 flow [2024-11-10 17:54:33,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 17:54:33,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:33,703 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-10 17:54:33,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:54:33,703 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:33,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1081736912, now seen corresponding path program 1 times [2024-11-10 17:54:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:33,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972883033] [2024-11-10 17:54:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:33,831 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-10 17:54:33,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:33,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972883033] [2024-11-10 17:54:33,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972883033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:33,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:33,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:54:33,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798786518] [2024-11-10 17:54:33,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:33,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:54:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:54:33,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:54:33,834 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 17:54:33,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-10 17:54:33,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:33,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 17:54:33,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:34,826 INFO L124 PetriNetUnfolderBase]: 9617/14066 cut-off events. [2024-11-10 17:54:34,826 INFO L125 PetriNetUnfolderBase]: For 29034/29038 co-relation queries the response was YES. [2024-11-10 17:54:34,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44549 conditions, 14066 events. 9617/14066 cut-off events. For 29034/29038 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 79347 event pairs, 918 based on Foata normal form. 117/14180 useless extension candidates. Maximal degree in co-relation 44525. Up to 7805 conditions per place. [2024-11-10 17:54:34,882 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 89 selfloop transitions, 2 changer transitions 41/137 dead transitions. [2024-11-10 17:54:34,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 1010 flow [2024-11-10 17:54:34,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:54:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:54:34,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-10 17:54:34,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-11-10 17:54:34,883 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 290 flow. Second operand 6 states and 149 transitions. [2024-11-10 17:54:34,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 1010 flow [2024-11-10 17:54:34,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 137 transitions, 976 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-11-10 17:54:34,942 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 293 flow [2024-11-10 17:54:34,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2024-11-10 17:54:34,942 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2024-11-10 17:54:34,943 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 293 flow [2024-11-10 17:54:34,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-10 17:54:34,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:34,943 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-10 17:54:34,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:54:34,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:34,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1171445294, now seen corresponding path program 2 times [2024-11-10 17:54:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:34,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639302369] [2024-11-10 17:54:34,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:34,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:35,056 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-10 17:54:35,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:35,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639302369] [2024-11-10 17:54:35,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639302369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:35,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:35,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:54:35,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417734511] [2024-11-10 17:54:35,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:35,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:54:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:35,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:54:35,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:54:35,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:35,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-10 17:54:35,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:35,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:35,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:35,827 INFO L124 PetriNetUnfolderBase]: 7686/11709 cut-off events. [2024-11-10 17:54:35,827 INFO L125 PetriNetUnfolderBase]: For 22678/22682 co-relation queries the response was YES. [2024-11-10 17:54:35,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36097 conditions, 11709 events. 7686/11709 cut-off events. For 22678/22682 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 70049 event pairs, 1478 based on Foata normal form. 604/12311 useless extension candidates. Maximal degree in co-relation 36070. Up to 5563 conditions per place. [2024-11-10 17:54:35,864 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 91 selfloop transitions, 5 changer transitions 6/107 dead transitions. [2024-11-10 17:54:35,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 107 transitions, 748 flow [2024-11-10 17:54:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:54:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 17:54:35,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-10 17:54:35,865 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2024-11-10 17:54:35,865 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 293 flow. Second operand 4 states and 115 transitions. [2024-11-10 17:54:35,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 107 transitions, 748 flow [2024-11-10 17:54:35,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 735 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-10 17:54:35,885 INFO L231 Difference]: Finished difference. Result has 74 places, 54 transitions, 292 flow [2024-11-10 17:54:35,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=74, PETRI_TRANSITIONS=54} [2024-11-10 17:54:35,888 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2024-11-10 17:54:35,888 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 54 transitions, 292 flow [2024-11-10 17:54:35,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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-10 17:54:35,888 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:35,891 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-10 17:54:35,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:54:35,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:35,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:35,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1917092677, now seen corresponding path program 1 times [2024-11-10 17:54:35,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047181108] [2024-11-10 17:54:35,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:36,022 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-10 17:54:36,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:36,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047181108] [2024-11-10 17:54:36,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047181108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:36,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:36,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:54:36,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283971751] [2024-11-10 17:54:36,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:36,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:54:36,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:36,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:54:36,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:54:36,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:36,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 54 transitions, 292 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-10 17:54:36,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:36,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:36,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:36,488 INFO L124 PetriNetUnfolderBase]: 4499/6909 cut-off events. [2024-11-10 17:54:36,489 INFO L125 PetriNetUnfolderBase]: For 12686/12690 co-relation queries the response was YES. [2024-11-10 17:54:36,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22413 conditions, 6909 events. 4499/6909 cut-off events. For 12686/12690 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 37389 event pairs, 871 based on Foata normal form. 387/7294 useless extension candidates. Maximal degree in co-relation 22385. Up to 2535 conditions per place. [2024-11-10 17:54:36,520 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 103 selfloop transitions, 8 changer transitions 4/120 dead transitions. [2024-11-10 17:54:36,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 120 transitions, 830 flow [2024-11-10 17:54:36,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:54:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:54:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-11-10 17:54:36,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6125 [2024-11-10 17:54:36,524 INFO L175 Difference]: Start difference. First operand has 74 places, 54 transitions, 292 flow. Second operand 5 states and 147 transitions. [2024-11-10 17:54:36,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 120 transitions, 830 flow [2024-11-10 17:54:36,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 120 transitions, 816 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-10 17:54:36,539 INFO L231 Difference]: Finished difference. Result has 78 places, 57 transitions, 330 flow [2024-11-10 17:54:36,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=330, PETRI_PLACES=78, PETRI_TRANSITIONS=57} [2024-11-10 17:54:36,539 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2024-11-10 17:54:36,540 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 57 transitions, 330 flow [2024-11-10 17:54:36,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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-10 17:54:36,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:36,540 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-10 17:54:36,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:54:36,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:36,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2123922011, now seen corresponding path program 1 times [2024-11-10 17:54:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:36,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921291536] [2024-11-10 17:54:36,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:36,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:36,680 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-10 17:54:36,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:36,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921291536] [2024-11-10 17:54:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921291536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:36,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:36,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:54:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624922040] [2024-11-10 17:54:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:36,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:54:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:36,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:54:36,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:54:36,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:36,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 57 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-10 17:54:36,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:36,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:36,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:37,024 INFO L124 PetriNetUnfolderBase]: 3000/4544 cut-off events. [2024-11-10 17:54:37,024 INFO L125 PetriNetUnfolderBase]: For 9668/9672 co-relation queries the response was YES. [2024-11-10 17:54:37,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15433 conditions, 4544 events. 3000/4544 cut-off events. For 9668/9672 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 22764 event pairs, 738 based on Foata normal form. 125/4667 useless extension candidates. Maximal degree in co-relation 15403. Up to 1730 conditions per place. [2024-11-10 17:54:37,040 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 76 selfloop transitions, 11 changer transitions 16/108 dead transitions. [2024-11-10 17:54:37,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 108 transitions, 759 flow [2024-11-10 17:54:37,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:54:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:54:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-10 17:54:37,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-11-10 17:54:37,041 INFO L175 Difference]: Start difference. First operand has 78 places, 57 transitions, 330 flow. Second operand 6 states and 145 transitions. [2024-11-10 17:54:37,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 108 transitions, 759 flow [2024-11-10 17:54:37,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 108 transitions, 678 flow, removed 28 selfloop flow, removed 10 redundant places. [2024-11-10 17:54:37,071 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 273 flow [2024-11-10 17:54:37,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2024-11-10 17:54:37,073 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2024-11-10 17:54:37,073 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 273 flow [2024-11-10 17:54:37,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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-10 17:54:37,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:37,073 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] [2024-11-10 17:54:37,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:54:37,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:37,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash 961129233, now seen corresponding path program 1 times [2024-11-10 17:54:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042445692] [2024-11-10 17:54:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:37,267 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-10 17:54:37,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:54:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042445692] [2024-11-10 17:54:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042445692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:37,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:37,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:54:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152327303] [2024-11-10 17:54:37,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:37,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:54:37,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:54:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:54:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:54:37,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 17:54:37,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 52 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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-10 17:54:37,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:37,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 17:54:37,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:37,745 INFO L124 PetriNetUnfolderBase]: 2475/3816 cut-off events. [2024-11-10 17:54:37,745 INFO L125 PetriNetUnfolderBase]: For 5814/5814 co-relation queries the response was YES. [2024-11-10 17:54:37,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12175 conditions, 3816 events. 2475/3816 cut-off events. For 5814/5814 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18325 event pairs, 614 based on Foata normal form. 8/3823 useless extension candidates. Maximal degree in co-relation 12150. Up to 2414 conditions per place. [2024-11-10 17:54:37,758 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 54 selfloop transitions, 1 changer transitions 55/115 dead transitions. [2024-11-10 17:54:37,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 115 transitions, 835 flow [2024-11-10 17:54:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:54:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:54:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-11-10 17:54:37,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4548611111111111 [2024-11-10 17:54:37,760 INFO L175 Difference]: Start difference. First operand has 75 places, 52 transitions, 273 flow. Second operand 6 states and 131 transitions. [2024-11-10 17:54:37,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 115 transitions, 835 flow [2024-11-10 17:54:37,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 607 flow, removed 46 selfloop flow, removed 17 redundant places. [2024-11-10 17:54:37,783 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 172 flow [2024-11-10 17:54:37,783 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2024-11-10 17:54:37,783 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2024-11-10 17:54:37,783 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 172 flow [2024-11-10 17:54:37,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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-10 17:54:37,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:37,784 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] [2024-11-10 17:54:37,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:54:37,784 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:37,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1895748375, now seen corresponding path program 2 times [2024-11-10 17:54:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:54:37,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202649772] [2024-11-10 17:54:37,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:54:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:54:37,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:54:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:54:37,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 17:54:37,967 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:54:37,968 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 17:54:37,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 17:54:37,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 17:54:37,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 17:54:37,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 17:54:37,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 17:54:37,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 17:54:37,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:54:37,971 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-10 17:54:38,061 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 17:54:38,061 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 17:54:38,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:54:38 BasicIcfg [2024-11-10 17:54:38,066 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 17:54:38,067 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 17:54:38,067 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 17:54:38,067 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 17:54:38,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:54:24" (3/4) ... [2024-11-10 17:54:38,069 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 17:54:38,070 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 17:54:38,071 INFO L158 Benchmark]: Toolchain (without parser) took 14653.23ms. Allocated memory was 176.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 105.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 368.2MB. Max. memory is 16.1GB. [2024-11-10 17:54:38,071 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:54:38,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.93ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 78.7MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 17:54:38,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.07ms. Allocated memory is still 176.2MB. Free memory was 78.7MB in the beginning and 75.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 17:54:38,072 INFO L158 Benchmark]: Boogie Preprocessor took 46.08ms. Allocated memory is still 176.2MB. Free memory was 75.7MB in the beginning and 72.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 17:54:38,072 INFO L158 Benchmark]: IcfgBuilder took 580.53ms. Allocated memory is still 176.2MB. Free memory was 72.4MB in the beginning and 96.7MB in the end (delta: -24.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 17:54:38,073 INFO L158 Benchmark]: TraceAbstraction took 13520.99ms. Allocated memory was 176.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 95.7MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 357.7MB. Max. memory is 16.1GB. [2024-11-10 17:54:38,073 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 3.0GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:54:38,074 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 125.8MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.93ms. Allocated memory is still 176.2MB. Free memory was 105.1MB in the beginning and 78.7MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.07ms. Allocated memory is still 176.2MB. Free memory was 78.7MB in the beginning and 75.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.08ms. Allocated memory is still 176.2MB. Free memory was 75.7MB in the beginning and 72.4MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 580.53ms. Allocated memory is still 176.2MB. Free memory was 72.4MB in the beginning and 96.7MB in the end (delta: -24.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13520.99ms. Allocated memory was 176.2MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 95.7MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 357.7MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 3.0GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=-3, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=-3, t892=-2, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=-3, t892=-2, t893=-1, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 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) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 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) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 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 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=-3, t892=-2, t893=-1, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 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) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 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 [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=-3, t892=-2, t893=-1, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=-3, t892=-2, t893=-1, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 843]: 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: 841]: 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 7 procedures, 76 locations, 7 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: 13.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 727 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 723 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2131 IncrementalHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 4 mSDtfsCounter, 2131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=9, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 1292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-10 17:54:38,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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/mix033_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:54:40,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:54:40,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:54:40,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:54:40,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:54:40,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:54:40,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:54:40,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:54:40,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:54:40,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:54:40,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:54:40,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:54:40,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:54:40,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:54:40,199 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:54:40,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:54:40,200 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:54:40,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:54:40,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:54:40,201 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:54:40,202 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:54:40,202 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:54:40,202 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:54:40,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:54:40,203 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:54:40,203 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:54:40,203 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:54:40,203 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:54:40,203 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:54:40,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:54:40,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:54:40,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:54:40,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:54:40,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:54:40,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:54:40,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:54:40,206 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:54:40,206 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:54:40,207 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:54:40,207 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:54:40,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:54:40,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:54:40,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:54:40,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:54:40,208 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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2024-11-10 17:54:40,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:54:40,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:54:40,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:54:40,470 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:54:40,470 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:54:40,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2024-11-10 17:54:41,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:54:41,990 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:54:41,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2024-11-10 17:54:42,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0441161/fb6b10967b044d588de0f408ff621a76/FLAG03ac18c9d [2024-11-10 17:54:42,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab0441161/fb6b10967b044d588de0f408ff621a76 [2024-11-10 17:54:42,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:54:42,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:54:42,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:54:42,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:54:42,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:54:42,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8c8168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42, skipping insertion in model container [2024-11-10 17:54:42,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:54:42,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:54:42,395 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:54:42,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:54:42,478 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:54:42,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42 WrapperNode [2024-11-10 17:54:42,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:54:42,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:54:42,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:54:42,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:54:42,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,523 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2024-11-10 17:54:42,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:54:42,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:54:42,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:54:42,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:54:42,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,545 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 17:54:42,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:54:42,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:54:42,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:54:42,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:54:42,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (1/1) ... [2024-11-10 17:54:42,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:54:42,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:54:42,591 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-10 17:54:42,593 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-10 17:54:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 17:54:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:54:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:54:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 17:54:42,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 17:54:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 17:54:42,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 17:54:42,629 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 17:54:42,629 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 17:54:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 17:54:42,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:54:42,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:54:42,631 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:54:42,747 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:54:42,749 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:54:43,014 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:54:43,014 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:54:43,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:54:43,213 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:54:43,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:54:43 BoogieIcfgContainer [2024-11-10 17:54:43,214 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:54:43,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:54:43,215 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:54:43,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:54:43,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:54:42" (1/3) ... [2024-11-10 17:54:43,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6399b673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:54:43, skipping insertion in model container [2024-11-10 17:54:43,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:54:42" (2/3) ... [2024-11-10 17:54:43,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6399b673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:54:43, skipping insertion in model container [2024-11-10 17:54:43,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:54:43" (3/3) ... [2024-11-10 17:54:43,222 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2024-11-10 17:54:43,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:54:43,234 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:54:43,234 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:54:43,277 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 17:54:43,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 108 flow [2024-11-10 17:54:43,328 INFO L124 PetriNetUnfolderBase]: 2/45 cut-off events. [2024-11-10 17:54:43,328 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:54:43,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 2/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-11-10 17:54:43,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 48 transitions, 108 flow [2024-11-10 17:54:43,335 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 45 transitions, 99 flow [2024-11-10 17:54:43,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:54:43,347 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;@e6d02a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:54:43,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 17:54:43,352 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:54:43,352 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-11-10 17:54:43,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:54:43,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:43,353 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:54:43,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:43,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:43,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1002821709, now seen corresponding path program 1 times [2024-11-10 17:54:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:54:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276706297] [2024-11-10 17:54:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:43,368 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-10 17:54:43,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:54:43,370 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-10 17:54:43,371 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-10 17:54:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:43,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:54:43,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:54:43,493 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-10 17:54:43,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:54:43,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:54:43,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276706297] [2024-11-10 17:54:43,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276706297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:43,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:43,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:54:43,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892011107] [2024-11-10 17:54:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:43,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:54:43,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:54:43,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:54:43,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:54:43,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:43,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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-10 17:54:43,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:43,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:43,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:44,735 INFO L124 PetriNetUnfolderBase]: 9711/13823 cut-off events. [2024-11-10 17:54:44,735 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-10 17:54:44,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27598 conditions, 13823 events. 9711/13823 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 79966 event pairs, 793 based on Foata normal form. 762/14577 useless extension candidates. Maximal degree in co-relation 27587. Up to 12363 conditions per place. [2024-11-10 17:54:44,794 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 53 selfloop transitions, 2 changer transitions 2/64 dead transitions. [2024-11-10 17:54:44,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 254 flow [2024-11-10 17:54:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:54:44,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:54:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-10 17:54:44,804 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-11-10 17:54:44,805 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 99 flow. Second operand 3 states and 92 transitions. [2024-11-10 17:54:44,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 254 flow [2024-11-10 17:54:44,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 17:54:44,813 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 90 flow [2024-11-10 17:54:44,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-11-10 17:54:44,818 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2024-11-10 17:54:44,818 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 90 flow [2024-11-10 17:54:44,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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-10 17:54:44,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:44,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:54:44,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 17:54:45,022 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-10 17:54:45,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:45,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:45,024 INFO L85 PathProgramCache]: Analyzing trace with hash 877973006, now seen corresponding path program 1 times [2024-11-10 17:54:45,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:54:45,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336400586] [2024-11-10 17:54:45,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:45,026 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-10 17:54:45,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:54:45,027 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-10 17:54:45,028 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-10 17:54:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:45,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:54:45,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:54:45,133 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-10 17:54:45,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:54:45,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:54:45,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336400586] [2024-11-10 17:54:45,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336400586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:45,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:45,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:54:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028080201] [2024-11-10 17:54:45,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:45,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:54:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:54:45,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:54:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:54:45,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:45,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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-10 17:54:45,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:45,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:45,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:45,908 INFO L124 PetriNetUnfolderBase]: 6447/10359 cut-off events. [2024-11-10 17:54:45,909 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2024-11-10 17:54:45,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20185 conditions, 10359 events. 6447/10359 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 66350 event pairs, 1119 based on Foata normal form. 384/10738 useless extension candidates. Maximal degree in co-relation 20175. Up to 5601 conditions per place. [2024-11-10 17:54:45,959 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 68 selfloop transitions, 5 changer transitions 1/81 dead transitions. [2024-11-10 17:54:45,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 328 flow [2024-11-10 17:54:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:54:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 17:54:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-10 17:54:45,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-11-10 17:54:45,961 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 90 flow. Second operand 4 states and 116 transitions. [2024-11-10 17:54:45,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 328 flow [2024-11-10 17:54:45,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:54:45,964 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 120 flow [2024-11-10 17:54:45,964 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-11-10 17:54:45,965 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-11-10 17:54:45,965 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 120 flow [2024-11-10 17:54:45,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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-10 17:54:45,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:45,966 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] [2024-11-10 17:54:45,969 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 (3)] Ended with exit code 0 [2024-11-10 17:54:46,169 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-10 17:54:46,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:46,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:46,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2130572406, now seen corresponding path program 1 times [2024-11-10 17:54:46,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:54:46,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703111042] [2024-11-10 17:54:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:46,175 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-10 17:54:46,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:54:46,196 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-10 17:54:46,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 17:54:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:46,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:54:46,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:54:46,355 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-10 17:54:46,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:54:46,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:54:46,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703111042] [2024-11-10 17:54:46,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703111042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:46,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:54:46,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491612257] [2024-11-10 17:54:46,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:46,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:54:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:54:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:54:46,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:54:46,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:46,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-10 17:54:46,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:46,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:46,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:46,803 INFO L124 PetriNetUnfolderBase]: 3243/5163 cut-off events. [2024-11-10 17:54:46,803 INFO L125 PetriNetUnfolderBase]: For 992/992 co-relation queries the response was YES. [2024-11-10 17:54:46,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11467 conditions, 5163 events. 3243/5163 cut-off events. For 992/992 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 27728 event pairs, 731 based on Foata normal form. 240/5398 useless extension candidates. Maximal degree in co-relation 11455. Up to 1692 conditions per place. [2024-11-10 17:54:46,825 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 87 selfloop transitions, 8 changer transitions 1/103 dead transitions. [2024-11-10 17:54:46,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 103 transitions, 453 flow [2024-11-10 17:54:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:54:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 17:54:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-11-10 17:54:46,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-11-10 17:54:46,828 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 120 flow. Second operand 5 states and 148 transitions. [2024-11-10 17:54:46,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 103 transitions, 453 flow [2024-11-10 17:54:46,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 103 transitions, 443 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 17:54:46,834 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 160 flow [2024-11-10 17:54:46,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-11-10 17:54:46,835 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2024-11-10 17:54:46,836 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 160 flow [2024-11-10 17:54:46,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 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-10 17:54:46,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:46,836 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-10 17:54:46,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 17:54:47,039 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-10 17:54:47,039 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:47,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1264062359, now seen corresponding path program 1 times [2024-11-10 17:54:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:54:47,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517763659] [2024-11-10 17:54:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:47,042 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-10 17:54:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:54:47,045 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-10 17:54:47,046 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-10 17:54:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:47,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:54:47,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:54:47,174 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-10 17:54:47,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:54:47,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:54:47,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517763659] [2024-11-10 17:54:47,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517763659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:47,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:47,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:54:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162574305] [2024-11-10 17:54:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:47,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:54:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:54:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:54:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:54:47,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:47,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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-10 17:54:47,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:47,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:47,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:47,544 INFO L124 PetriNetUnfolderBase]: 1991/3039 cut-off events. [2024-11-10 17:54:47,544 INFO L125 PetriNetUnfolderBase]: For 1682/1682 co-relation queries the response was YES. [2024-11-10 17:54:47,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7371 conditions, 3039 events. 1991/3039 cut-off events. For 1682/1682 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 14173 event pairs, 667 based on Foata normal form. 72/3106 useless extension candidates. Maximal degree in co-relation 7357. Up to 1168 conditions per place. [2024-11-10 17:54:47,558 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 72 selfloop transitions, 11 changer transitions 1/91 dead transitions. [2024-11-10 17:54:47,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 428 flow [2024-11-10 17:54:47,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:54:47,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:54:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-10 17:54:47,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-11-10 17:54:47,559 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 160 flow. Second operand 6 states and 146 transitions. [2024-11-10 17:54:47,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 428 flow [2024-11-10 17:54:47,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 403 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 17:54:47,576 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 174 flow [2024-11-10 17:54:47,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-11-10 17:54:47,577 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2024-11-10 17:54:47,578 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 174 flow [2024-11-10 17:54:47,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 0 states have call successors, (0), 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-10 17:54:47,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:47,578 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] [2024-11-10 17:54:47,583 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-10 17:54:47,779 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-10 17:54:47,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:47,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash -984176407, now seen corresponding path program 1 times [2024-11-10 17:54:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:54:47,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422009321] [2024-11-10 17:54:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:47,780 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-10 17:54:47,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:54:47,781 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-10 17:54:47,782 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-10 17:54:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:47,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:54:47,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:54:47,915 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-10 17:54:47,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:54:47,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:54:47,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422009321] [2024-11-10 17:54:47,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422009321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:47,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:54:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678508847] [2024-11-10 17:54:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:47,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:54:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:54:47,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:54:47,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:54:47,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-11-10 17:54:47,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-10 17:54:47,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:47,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-11-10 17:54:47,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:48,092 INFO L124 PetriNetUnfolderBase]: 1859/2827 cut-off events. [2024-11-10 17:54:48,093 INFO L125 PetriNetUnfolderBase]: For 1576/1576 co-relation queries the response was YES. [2024-11-10 17:54:48,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6860 conditions, 2827 events. 1859/2827 cut-off events. For 1576/1576 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12718 event pairs, 1775 based on Foata normal form. 8/2828 useless extension candidates. Maximal degree in co-relation 6845. Up to 2792 conditions per place. [2024-11-10 17:54:48,103 INFO L140 encePairwiseOnDemand]: 46/48 looper letters, 37 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2024-11-10 17:54:48,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 250 flow [2024-11-10 17:54:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:54:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:54:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-11-10 17:54:48,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-11-10 17:54:48,105 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 174 flow. Second operand 3 states and 61 transitions. [2024-11-10 17:54:48,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 250 flow [2024-11-10 17:54:48,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 194 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-10 17:54:48,111 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 116 flow [2024-11-10 17:54:48,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-11-10 17:54:48,112 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-11-10 17:54:48,113 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 116 flow [2024-11-10 17:54:48,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-10 17:54:48,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:48,113 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] [2024-11-10 17:54:48,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 17:54:48,314 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-10 17:54:48,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:48,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:48,315 INFO L85 PathProgramCache]: Analyzing trace with hash -12725571, now seen corresponding path program 1 times [2024-11-10 17:54:48,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:54:48,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498107555] [2024-11-10 17:54:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:54:48,315 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-10 17:54:48,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:54:48,316 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-10 17:54:48,317 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-10 17:54:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:54:48,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:54:48,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:54:48,583 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-10 17:54:48,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:54:48,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:54:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498107555] [2024-11-10 17:54:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498107555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:48,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:48,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:54:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859870479] [2024-11-10 17:54:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:48,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:54:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:54:48,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:54:48,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:54:48,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:48,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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-10 17:54:48,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:48,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:48,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:48,948 INFO L124 PetriNetUnfolderBase]: 2559/3903 cut-off events. [2024-11-10 17:54:48,949 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-11-10 17:54:48,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8416 conditions, 3903 events. 2559/3903 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 18726 event pairs, 319 based on Foata normal form. 8/3904 useless extension candidates. Maximal degree in co-relation 8409. Up to 2192 conditions per place. [2024-11-10 17:54:48,958 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 48 selfloop transitions, 1 changer transitions 36/91 dead transitions. [2024-11-10 17:54:48,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 91 transitions, 407 flow [2024-11-10 17:54:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:54:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:54:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2024-11-10 17:54:48,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-11-10 17:54:48,960 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 116 flow. Second operand 6 states and 132 transitions. [2024-11-10 17:54:48,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 91 transitions, 407 flow [2024-11-10 17:54:48,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 91 transitions, 406 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 17:54:48,962 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 126 flow [2024-11-10 17:54:48,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2024-11-10 17:54:48,962 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2024-11-10 17:54:48,963 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 126 flow [2024-11-10 17:54:48,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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-10 17:54:48,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:48,963 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] [2024-11-10 17:54:48,968 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 (7)] Ended with exit code 0 [2024-11-10 17:54:49,163 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-10 17:54:49,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:49,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash 102343405, now seen corresponding path program 2 times [2024-11-10 17:54:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:54:49,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995335702] [2024-11-10 17:54:49,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:54:49,165 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-10 17:54:49,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:54:49,167 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-10 17:54:49,168 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-10 17:54:49,239 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 17:54:49,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:54:49,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:54:49,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:54:49,406 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-10 17:54:49,406 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:54:49,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:54:49,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995335702] [2024-11-10 17:54:49,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995335702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:49,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:49,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:54:49,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709594054] [2024-11-10 17:54:49,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:49,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:54:49,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:54:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:54:49,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:54:49,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:49,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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-10 17:54:49,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:49,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:49,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:49,833 INFO L124 PetriNetUnfolderBase]: 2399/3720 cut-off events. [2024-11-10 17:54:49,834 INFO L125 PetriNetUnfolderBase]: For 534/534 co-relation queries the response was YES. [2024-11-10 17:54:49,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8217 conditions, 3720 events. 2399/3720 cut-off events. For 534/534 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 18856 event pairs, 317 based on Foata normal form. 8/3727 useless extension candidates. Maximal degree in co-relation 8206. Up to 2300 conditions per place. [2024-11-10 17:54:49,844 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 46 selfloop transitions, 1 changer transitions 43/96 dead transitions. [2024-11-10 17:54:49,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 450 flow [2024-11-10 17:54:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:54:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 17:54:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-11-10 17:54:49,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4756944444444444 [2024-11-10 17:54:49,845 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 126 flow. Second operand 6 states and 137 transitions. [2024-11-10 17:54:49,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 450 flow [2024-11-10 17:54:49,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 96 transitions, 438 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:54:49,847 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 130 flow [2024-11-10 17:54:49,848 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2024-11-10 17:54:49,848 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2024-11-10 17:54:49,848 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 130 flow [2024-11-10 17:54:49,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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-10 17:54:49,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:49,849 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] [2024-11-10 17:54:49,856 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-10 17:54:50,052 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-10 17:54:50,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:50,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2050740329, now seen corresponding path program 3 times [2024-11-10 17:54:50,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:54:50,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338387799] [2024-11-10 17:54:50,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:54:50,055 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-10 17:54:50,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:54:50,057 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-10 17:54:50,058 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-10 17:54:50,122 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-10 17:54:50,123 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:54:50,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 17:54:50,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:54:50,773 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-10 17:54:50,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:54:50,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:54:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338387799] [2024-11-10 17:54:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338387799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:54:50,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:54:50,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 17:54:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328823031] [2024-11-10 17:54:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:54:50,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 17:54:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:54:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 17:54:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:54:50,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-11-10 17:54:50,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 130 flow. Second operand has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 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-10 17:54:50,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:54:50,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-11-10 17:54:50,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:54:51,293 INFO L124 PetriNetUnfolderBase]: 2097/3321 cut-off events. [2024-11-10 17:54:51,293 INFO L125 PetriNetUnfolderBase]: For 858/858 co-relation queries the response was YES. [2024-11-10 17:54:51,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7589 conditions, 3321 events. 2097/3321 cut-off events. For 858/858 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 16679 event pairs, 537 based on Foata normal form. 8/3329 useless extension candidates. Maximal degree in co-relation 7577. Up to 1134 conditions per place. [2024-11-10 17:54:51,300 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 49 selfloop transitions, 4 changer transitions 49/108 dead transitions. [2024-11-10 17:54:51,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 108 transitions, 516 flow [2024-11-10 17:54:51,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:54:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 17:54:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-11-10 17:54:51,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4401041666666667 [2024-11-10 17:54:51,301 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 130 flow. Second operand 8 states and 169 transitions. [2024-11-10 17:54:51,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 108 transitions, 516 flow [2024-11-10 17:54:51,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 108 transitions, 504 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-10 17:54:51,303 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 137 flow [2024-11-10 17:54:51,303 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=137, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2024-11-10 17:54:51,304 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2024-11-10 17:54:51,304 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 137 flow [2024-11-10 17:54:51,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.636363636363637) internal successors, (139), 11 states have internal predecessors, (139), 0 states have call successors, (0), 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-10 17:54:51,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:54:51,304 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] [2024-11-10 17:54:51,309 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-10 17:54:51,504 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-10 17:54:51,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-10 17:54:51,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:54:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash 882206861, now seen corresponding path program 4 times [2024-11-10 17:54:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:54:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826305398] [2024-11-10 17:54:51,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:54:51,509 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-10 17:54:51,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:54:51,510 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-10 17:54:51,511 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-10 17:54:51,576 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:54:51,576 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-10 17:54:51,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 17:54:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 17:54:51,656 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 17:54:51,657 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 17:54:51,657 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 17:54:51,658 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 17:54:51,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 17:54:51,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 17:54:51,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 17:54:51,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-10 17:54:51,659 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 17:54:51,664 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-10 17:54:51,863 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-10 17:54:51,863 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2024-11-10 17:54:51,926 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 17:54:51,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 17:54:51,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:54:51 BasicIcfg [2024-11-10 17:54:51,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 17:54:51,930 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 17:54:51,930 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 17:54:51,930 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 17:54:51,931 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:54:43" (3/4) ... [2024-11-10 17:54:51,932 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 17:54:51,932 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 17:54:51,933 INFO L158 Benchmark]: Toolchain (without parser) took 9911.89ms. Allocated memory was 67.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 44.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 185.7MB. Max. memory is 16.1GB. [2024-11-10 17:54:51,933 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 50.3MB. Free memory is still 26.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:54:51,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.20ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 34.4MB in the end (delta: 9.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 17:54:51,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.37ms. Allocated memory is still 67.1MB. Free memory was 34.4MB in the beginning and 31.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 17:54:51,933 INFO L158 Benchmark]: Boogie Preprocessor took 38.88ms. Allocated memory is still 67.1MB. Free memory was 31.5MB in the beginning and 28.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 17:54:51,934 INFO L158 Benchmark]: IcfgBuilder took 650.88ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 28.1MB in the beginning and 50.7MB in the end (delta: -22.6MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-11-10 17:54:51,934 INFO L158 Benchmark]: TraceAbstraction took 8715.05ms. Allocated memory was 81.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 50.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 175.6MB. Max. memory is 16.1GB. [2024-11-10 17:54:51,934 INFO L158 Benchmark]: Witness Printer took 2.34ms. Allocated memory is still 1.5GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:54:51,935 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.65ms. Allocated memory is still 50.3MB. Free memory is still 26.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.20ms. Allocated memory is still 67.1MB. Free memory was 44.1MB in the beginning and 34.4MB in the end (delta: 9.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.37ms. Allocated memory is still 67.1MB. Free memory was 34.4MB in the beginning and 31.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.88ms. Allocated memory is still 67.1MB. Free memory was 31.5MB in the beginning and 28.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 650.88ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 28.1MB in the beginning and 50.7MB in the end (delta: -22.6MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8715.05ms. Allocated memory was 81.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 50.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 175.6MB. Max. memory is 16.1GB. * Witness Printer took 2.34ms. Allocated memory is still 1.5GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=0, t892=1, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891=0, t892=1, t893=2, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 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) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L818] 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) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 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 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 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}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=0, t892=1, t893=2, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 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) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 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 [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=0, t892=1, t893=2, weak$$choice0=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891=0, t892=1, t893=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 843]: 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: 841]: 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 7 procedures, 76 locations, 7 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: 8.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 545 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 539 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1511 IncrementalHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 0 mSDtfsCounter, 1511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=4, InterpolantAutomatonStates: 41, 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.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 987 SizeOfPredicates, 14 NumberOfNonLiveVariables, 948 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 17:54:51,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample